论文信息 - Computing generalized inverse of polynomial matrices by interpolation

Computing generalized inverse of polynomial matrices by interpolation

Abstract We investigated an interpolation algorithm for computing the Moore–Penrose inverse of a given polynomial matrix, based on the Leverrier–Faddeev method. Also, a method for estimating the degrees of polynomial matrices arising from the Leverrier–Faddeev algorithm is given as the improvement of the interpolation algorithm. Algorithms are implemented in the symbolic programming language MATHEMATICA , and tested on several different classes of test examples.

Predrag S. Stanimirovic | Marko D. Petkovic

[1] Predrag S. Stanimirovic,et al. Symbolic computation of the Moore–Penrose inverse using a partitioning method , 2005, Int. J. Comput. Math..

[2] Gerhard Zielke,et al. Report on test matrices for generalized inverses , 1986, Computing.

[3] Yimin Wei,et al. The algorithm for computing the Drazin inverses of two-variable polynomial matrices , 2004, Appl. Math. Comput..

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

[5] P. Tzekis,et al. ON THE COMPUTATION OF THE GENERALIZED INVERSE OF A POLYNOMIAL MATRIX , 1999 .

[6] Stephen Wolfram,et al. The Mathematica Book , 1996 .

[7] T. Greville,et al. The Souriau-Frame algorithm and the Drazin pseudoinverse , 1973 .

[8] Nicholas P. Karampetakis,et al. The Computation and Application of the Generalized Inverse via Maple , 1998, J. Symb. Comput..

[9] P. Hippe,et al. Inversion of polynomial matrices by interpolation , 1992 .

[10] Nicholas P. Karampetakis,et al. Computation of the Generalized Inverse of a Polynomial Matrix and Applications , 1997 .

[11] Nicholas P. Karampetakis,et al. Generalized inverses of two-variable polynomial matrices and applications , 1997 .

[12] Predrag S. Stanimirovic,et al. Partitioning method for rational and polynomial matrices , 2004, Appl. Math. Comput..