论文信息 - Recursive algorithms for the matrix Padé problem

Recursive algorithms for the matrix Padé problem

Abstract. A matrix triangularization interpretation is given for the recursive algorithms computing the Padd approximants along a certain path in the Padd table, which makes it possible to unify all known algorithms in this field [51, [61. For the normal Padd table, all these results carry over to the matrix Padd problem in a straightforward way. Additional features, resulting from the noncommutativity are investigated. A generalization of the Trench-Zohar algorithm and related recursions are studied in greater detail.

Adhemar Bultheel | A. Bultheel

[1] G. Baxter. Polynomials defined by a difference system , 1960 .

[2] Adhemar Bultheel,et al. Recursive algorithms for the Padé table : Two approaches , 1979 .

[3] Adhemar Bultheel,et al. Division algorithms for continued fractions and the Padé table , 1980 .

[4] William B. Gragg,et al. LAURENT, FOURIER, AND CHEBYSHEV-PADÉ TABLES , 1977 .

[5] H. Akaike. Block Toeplitz Matrix Inversion , 1973 .

[6] E. Robinson,et al. Recursive solution to the multichannel filtering problem , 1965 .

[7] N. Levinson. The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction , 1946 .

[8] J. Rissanen. Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials , 1973 .

[9] Y. Kamp,et al. Orthogonal polynomial matrices on the unit circle , 1978 .

[10] N. Wiener. The Wiener RMS (Root Mean Square) Error Criterion in Filter Design and Prediction , 1949 .

[11] W. F. Trench. An Algorithm for the Inversion of Finite Toeplitz Matrices , 1964 .

[12] B. Dickinson,et al. A minimal realization algorithm for matrix sequences , 1973, CDC 1973.

[13] Shalhav Zohar,et al. Toeplitz Matrix Inversion: The Algorithm of W. F. Trench , 1969, JACM.

[14] William F. Trench,et al. An Algorithm for the Inversion of Finite Hankel Matrices , 1965 .