Computing generalized inverse of polynomial matrices by interpolation

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 int...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 172; no. 1; pp. 508 - 523
Main Authors STANIMIROVIC, Predrag S, PETKOVIC, Marko D
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier Inc 2006
Elsevier
Subjects
Exact sciences and technology
Interpolation
Leverrier–Faddeev method
MATHEMATICA
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical approximation
Numerical linear algebra
Polynomial matrices
Pseudoinverse
Sciences and techniques of general use
Pseudoinverse
Interpolation
MATHEMATICA
Polynomial matrices
Leverrier–Faddeev method
Polynomial matrix
Moore Penrose inverse
Numerical linear algebra
Leverrier-Faddeev method
Overdetermined system
Computing
Algorithm
Generalized inverse
Numerical approximation
Leverrier Faddeev method
Inverse matrix
Applied mathematics
Polynomial interpolation
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2005.02.031