A unified superfast algorithm for boundary rational tangential interpolation problems and for inversion and factorization of dense structured matrices

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/sup 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/sup 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/sup 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.

[1]  Hidenori Kimura,et al.  Directional interpolation approach to H ∞ -Optimization and robust stabilization , 1987 .

[2]  I. Gohberg,et al.  Complexity of multiplication with vectors for structured matrices , 1994 .

[3]  Vadim Olshevsky,et al.  Pivoting for structured matrices with applications , 1997 .

[4]  B. Anderson,et al.  Asymptotically fast solution of toeplitz and related systems of linear equations , 1980 .

[5]  T. Kailath,et al.  Recursive solutions of rational interpolation problems via fast matrix factorization , 1994 .

[6]  M. Morf.  Fast Algorithms for Multivariable Systems , 1974 .

[7]  Thomas Kailath,et al.  Displacement-structure approach to polynomial Vandermonde and related matrices , 1997 .

[8]  L. Ljung,et al.  New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices , 1979 .

[9]  Arthur E. Frazho,et al.  Metric Constrained Interpolation, Commutant Lifting and Systems , 1998 .

[10]  D. Alpay,et al.  On Applications of Reproducing Kernel Spaces to the Schur Algorithm and Rational J Unitary Factorization , 1986 .

[11]  J. Willems,et al.  On the solution of the minimal rational interpolation problem , 1990 .

[12]  Thomas Kailath,et al.  State-space approach to factorization of lossless transfer functions and structured matrices☆ , 1992 .

[13]  V. Potapov,et al.  Indefinite metric in the Nevanlinna-Pick problem , 1974 .

[14]  Lev A. Sakhnovich,et al.  Factorization problems and operator identities , 1986 .

[15]  Georg Pick,et al.  Über die Beschränkungen analytischer Funktionen, welche durch vorgegebene Funktionswerte bewirkt werden , 1915 .

[16]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[17]  Ronald L. Rivest,et al.  The Design and Analysis of Computer Algorithms , 1990 .

[18]  Israel Gohberg,et al.  Unitary Rational Matrix Functions , 1988 .

[19]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[20]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[21]  Georg Heinig,et al.  Algebraic Methods for Toeplitz-like Matrices and Operators , 1984 .

[22]  C. Foias,et al.  The commutant lifting approach to interpolation problems , 1990 .

[23]  Martin Morf,et al.  Doubling algorithms for Toeplitz and related equations , 1980, ICASSP.

[24]  Thomas Kailath,et al.  Diagonal pivoting for partially reconstructible Cauchy-like Matrices , 1997 .

[25]  L. Rodman,et al.  Interpolation of Rational Matrix Functions , 1990 .

[26]  Paul Van Dooren,et al.  On Sigma-lossless transfer functions and related questions , 1983 .

[27]  Israel Gohberg,et al.  Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems , 1994 .

[28]  S. Darlington,et al.  Synthesis of Reactance 4-Poles Which Produce Prescribed Insertion Loss Characteristics: Including Special Applications To Filter Design , 1939 .

[29]  H. Dym.  J Contractive Matrix Functions, Reproducing Kernel Hilbert Spaces and Interpolation , 1989 .

[30]  Ali H. Sayed,et al.  Displacement Structure: Theory and Applications , 1995, SIAM Rev..

[31]  P. Khargonekar,et al.  State-space solutions to standard H/sub 2/ and H/sub infinity / control problems , 1989 .

[32]  M. Morf,et al.  Displacement ranks of matrices and linear equations , 1979 .

[33]  Y. Kamp,et al.  The Nevanlinna–Pick Problem for Matrix-Valued Functions , 1979 .

[34]  Y. Genin,et al.  On the role of the Nevanlinna–Pick problem in circuit and system theory† , 1981 .

[35]  B. Wyman,et al.  Factorizations of transfer functions , 1986, 1986 25th IEEE Conference on Decision and Control.

[36]  V. Potapov.  The multiplicative structure of J-contractive matrix functions , 1960 .