On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse

DOI10.1007/s12190-009-0347-1zbMath1216.65049OpenAlexW2066192022MaRDI QIDQ2430466

Milan B. Tasić, Predrag S. Stanimirović

Publication date: 6 April 2011

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-009-0347-1

zbMATH Keywords

polynomial matricesMoore-Penrose inverse\texttt{Mathematica}Leverrier-Faddeev algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)

Related Items (1)

Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization

Uses Software

• Mathematica

Cites Work

• Computation of the generalized inverse of a polynomial matrix and applications
• Inverses of multivariable polynomial matrices by discrete Fourier transforms
• A new proof for Decell's finite algorithm for generalized inverses
• Generalized inverses of two-variable polynomial matrices and applications
• The computation and application of the generalized inverse via Maple
• DFT calculation of the generalized and Drazin inverse of a polynomial matrix
• Computing generalized inverse of polynomial matrices by interpolation
• On the computation of the generalized inverse of a polynomial matrix
• An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion

This page was built for publication: On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse