A displacement approach to efficient decoding of algebraic-geometric codes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Nearly optimal computations with structured matrices
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Fast and Superfast Algorithms for Hankel-Like Matrices Related to Orthogonal Polynominals
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Iterative inversion of structured matrices
Theoretical Computer Science - Algebraic and numerical algorithm
Pivoting for structured matrices and rational tangential interpolation
Contemporary mathematics
A displacement approach to decoding algebraic codes
Contemporary mathematics
Computations with quasiseparable polynomials and matrices
Theoretical Computer Science
The Journal of Supercomputing
Computing specified generators of structured matrix inverses
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
Hi-index | 0.00 |
The classical scalar Nevanlinna-Pick interpolation problem has a long and distinguished history, appearing in a variety of applications in mathematics and electrical engineering. There is a vast literature on this problem and on its various far reaching generalizations. It is widely known that the now classical algorithm for solving this problem proposed by Nevanlinna in 1929 can be seen as a way of computing the Cholesky factorization for the corresponding Pick matrix. Moreover, the classical Nevanlinna algorithm takes advantage of the special structure of the Pick matrix to compute this triangular factorization in only $O(n^2)$ arithmetic operations, where $n$ is the number of interpolation points, or, equivalently, the size of the Pick matrix. Since the structure-ignoring standard Cholesky algorithm [though applicable to the wider class of general matrices] has much higher complexity $O(n^3)$, the Nevanlinna algorithm is an example of what is now called fast algorithms. In this paper we use a divide-and-conquer approach to propose a new superfast $O(n \log^3 n)$ algorithm to construct solutions for the more general boundary tangential Nevanlinna-Pick problem. This dramatic speed-up is achieved via a new divide-and-conquer algorithm for factorization of rational matrix functions; this superfast algorithm seems to have a practical and theoretical significance itself. It can be used to solve similar rational interpolation problems [e.g., the matrix Nehari problem], and a variety of engineering problems. It can also be used for inversion and triangular factorization of matrices with displacement structure, including Hankel-like, Vandermonde-like, and Cauchy-like matrices.