Extensions of Faddeev's algorithms to polynomial matrices

DOI10.1016/J.AMC.2009.03.076MaRDI QIDQ2391309zbMATH OpenOpenAlexFDO

Authors Predrag S. Stanimirović, Milan B. Tasić, Ky M. Vu

Publication date 24 July 2009

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2009.03.076

zbMATH Keywords

\texttt{MATHEMATICA}complexity analysisDrazin inverseLeverrier-Faddeev algorithmMoore-Penrose inversepolynomial matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Review text

The authors derive two new algorithms: one for computing the Drazin inverse of a singular \(n \times n\) one-variable polynomial matrix, the other for computing the Moore-Penrose inverse of a singular \(n \times m\) one-variable polynomial matrix. These two algorithms are alternatives to known algorithms for computing the Drazin inverse and the Moore-Penrose inverse based on the Leverrier-Faddeev method; this approach uses derivative of the matrix powers and was initiated by the third author [An extension of the Faddeev's algorithms, in: Proceedings of the IEEE Multi-conference on Systems and Control on September 3--5th, 2008, San Antonio, TX. (2008)]. The authors compare the computational complexity and the memory space requirements of the two new introduced algorithms versus some known alternative algorithms using \texttt{MATHEMATICA 5.2}; illustrative test examples are presented. The \texttt{MATHEMATICA} code for the two new algorithms is presented in Appendix.

Recommendations

• scientific article; zbMATH DE number 5243977
• Interpolation algorithm for computing Drazin inverse of polynomial matrices
• The algorithm for computing the Drazin inverses of two-variable polynomial matrices
• DFT calculation of the generalized and Drazin inverse of a polynomial matrix
• A finite algorithm for generalized inverses of polynomial and rational matrices

Cites work

• A finite algorithm for generalized inverses of polynomial and rational matrices
• A finite algorithm for the Drazin inverse of a polynomial matrix
• A new proof for Decell's finite algorithm for generalized inverses
• An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
• Computation of the generalized inverse of a polynomial matrix and applications
• Computation of the inverse of a polynomial matrix and evaluation of its Laurent expansion
• Computing generalized inverse of polynomial matrices by interpolation
• DFT calculation of the generalized and Drazin inverse of a polynomial matrix
• Fast projection methods for minimal design problems in linear system theory
• Generalized inverses of two-variable polynomial matrices and applications
• scientific article; zbMATH DE number 5841246 (Why is no real title available?)
• scientific article; zbMATH DE number 3140820 (Why is no real title available?)
• scientific article; zbMATH DE number 1292563 (Why is no real title available?)
• scientific article; zbMATH DE number 5243977 (Why is no real title available?)
• scientific article; zbMATH DE number 3074072 (Why is no real title available?)
• Interpolation algorithm for computing Drazin inverse of polynomial matrices
• Interpolation algorithm of Leverrier-Faddev type for polynomial matrices
• Inverses of multivariable polynomial matrices by discrete Fourier transforms
• Linear multivariable systems
• Matrices
• On the computation of the generalized inverse of a polynomial matrix
• Report on test matrices for generalized inverses
• The algorithm for computing the Drazin inverses of two-variable polynomial matrices
• The computation and application of the generalized inverse via Maple
• The Souriau-Frame algorithm and the Drazin pseudoinverse

Cited in

(14)

• Gröbner basis computation of Drazin inverses with multivariate rational function entries
• Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
• The Moore-Penrose inverses of matrices over quaternion polynomial rings
• Computing generalized inverse of polynomial matrices by interpolation
• On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse
• Computing generalized inverses of a rational matrix and applications
• scientific article; zbMATH DE number 5015711 (Why is no real title available?)
• Symbolic computation of the Duggal transform
• scientific article; zbMATH DE number 6876 (Why is no real title available?)
• scientific article; zbMATH DE number 5679783 (Why is no real title available?)
• scientific article; zbMATH DE number 2208699 (Why is no real title available?)
• The contribution of D. K. Faddeev to the development of computational methods in linear algebra
• Symbolic computation of Drazin inverses by specializations
• Interpolation algorithm of Leverrier-Faddev type for polynomial matrices

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Extensions of Faddeev's algorithms to polynomial matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391309)