Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Computing generalized inverse of polynomial matrices by interpolation

Predrag S. Stanimirovic
Organization: University of Nis
Department: Department of Mathematics, Faculty of Science
Marko D. Petkovic
Journal / Anthology

Applied Mathematics and Computation
Year: 2006
Volume: 172
Page range: 508-523

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.

*Applied Mathematics > Numerical Methods
*Mathematics > Algebra > Linear Algebra
*Mathematics > Algebra > Polynomials

interpolation, polynomial matrices, generalized inverse

Translate this page: