论文信息 - Inversion of polynomial matrices by interpolation

Inversion of polynomial matrices by interpolation

Known polynomial interpolation methods to polynomial matrices are generalized to obtain new algorithms for the computation of the inverse of such matrices. The algorithms use numerically stabilizable manipulations of constant matrices. Among the three methods investigated Lagrange's interpolation seems especially suitable for the purpose. >

P. Hippe | P. Hippe | A. Schuster | A. Schuster

[1] Neil Munro,et al. Inversion of rational polynomial matrices , 1970 .

[2] Ellis Horowitz,et al. On Computing the Exact Determinant of Matrices with Polynomial Entries , 1975, JACM.

[3] Yujiro Inouye. An algorithm for inverting polynomial matrices , 1979 .

[4] C. Kurth,et al. A Simple Calculation of the Determinant Polynomial of General Networks , 1967, IEEE Transactions on Circuit Theory.

[5] Michael T. McClellan,et al. The Exact Solution of Linear Equations with Rational Function Coefficients , 1977, TOMS.

[6] H. A. Luther,et al. Applied numerical methods , 1969 .

[7] Peter Hippe,et al. Design of observer based compensators: The polynomial approach , 1991, Kybernetika.

[8] Shou-Yuan Zhang. Inversion of polynomial matrices , 1987 .

[9] E. Emre,et al. Generalization of Leverrier's algorithm to polynomial matrices of arbitrary degree , 1975 .

[10] Thomas Kailath,et al. Linear Systems , 1980 .

[11] Leang S. Shieh,et al. Inverse of polynomial matrices in the irreducible form , 1987 .

[12] G. Pierobon,et al. FFT calculation of a determinantal polynomial , 1976 .

[13] W. Wolovich. Linear multivariable systems , 1974 .