A new proof for Decell's finite algorithm for generalized inverses

DOI10.1016/0096-3003(83)90007-3zbMath0546.65015OpenAlexW2003703126MaRDI QIDQ797954

Asher Tishler, Nima Rasakhoo, Jia-Song Wang, Robert E. Kalaba

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0096-3003(83)90007-3

zbMATH Keywords

iterative methodpseudoinverseMoore-Penrose generalized inverserectangular matrixDecell's algorithm

Mathematics Subject Classification ID

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

Related Items (8)

A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\) ⋮ Extensions of Faddeev's algorithms to polynomial matrices ⋮ On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse ⋮ Finite algorithms for the (2)-generalized inverse ⋮ Algorithms for generalized inverses ⋮ Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix ⋮ A finite algorithm for the Drazin inverse of a polynomial matrix ⋮ An alternative limit expression of Drazin inverse and its application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for generalized inverses
• A comparison of estimators for undersized samples
• An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion

This page was built for publication: A new proof for Decell's finite algorithm for generalized inverses