论文信息 - A new extension of Leverrier's algorithm

A new extension of Leverrier's algorithm

Abstract An algorithm for computing the inverse of a matrix polynomial s N J - s N -1A 1 -⋯- sA N-1 - A N is given, where J is a singular matrix. This algorithm is a new extension of Leverrier's algorithm for computing the inverse of a matrix polynomial s N I - s N -1 A 1 -⋯- sA N -1- A N , where I denotes the unit matrix.

Guorong Wang | Guo-rong Wang | Yuhua Lin | Yuh-Yue Lin

[1] Basil G. Mertzios. Leverrier's algorithm for singular systems , 1984 .

[2] Frank L. Lewis,et al. Further remarks on the Cayley-Hamilton theorem and Leverrier's method for the matrix pencil (sE - A) , 1986 .

[3] A finite algorithm for computing the weighted Moore-Penrose inverse A +MN , 1987 .

[4] J. Victória. Block Eigenvalues of block compound matrices , 1982 .

[5] S. Barnett,et al. Leverrier's algorithm: a new proof and extensions , 1989 .

[6] Henry P. Decell. An application of the Cayley-Hamilton theorem to generalized matrix inversion. , 1965 .