A finite algorithm for generalized inverses of polynomial and rational matrices

There are proposed two types of finite algorithms for symbolic computation of outer inverses of a given polynomial or rational matrix, based on the extension of the Leverrier–Faddeev algorithm. The implementation of the algorithm corresponding to rational matrices is developed in the symbolic packag...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 144; no. 2; pp. 199 - 214
Main Author STANIMIROVIC, Predrag S
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier Inc 10.12.2003
Elsevier
Subjects
Algebra
Exact sciences and technology
Generalized inverses
Leverrier–Faddeev algorithm
Linear and multilinear algebra, matrix theory
Mathematical analysis
Mathematics
Polynomial matrix
Sciences and techniques of general use
Special functions
Symbolic computation
Polynomial matrix
Generalized inverses
Leverrier–Faddeev algorithm
Symbolic computation
Polynomial
Drazin inverse
Rational matrix
Moore Penrose inverse
Inverse
Algorithm
Implementation
Leverrier Faddeev algorithm
Online AccessGet full text

Cover

More Information
Summary:There are proposed two types of finite algorithms for symbolic computation of outer inverses of a given polynomial or rational matrix, based on the extension of the Leverrier–Faddeev algorithm. The implementation of the algorithm corresponding to rational matrices is developed in the symbolic package MATHEMATICA.
ISSN:0096-3003
1873-5649
DOI:10.1016/S0096-3003(02)00401-0