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

DOI10.1016/0096-3003(83)90007-3MaRDI QIDQ797954zbMATH OpenOpenAlexFDO

Authors Nima Rasakhoo, Asher Tishler, R. E. Kalaba, Jiasong Wang

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

Decell's algorithmiterative methodMoore-Penrose generalized inversepseudoinverserectangular matrix

Mathematics Subject Classification ID

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

Review text

This paper presents a new proof for \textit{H. P. Decell's} finite algorithm [SIAM REv. 7, 526-528 (1965; Zbl 0178.355)] for finding the pseudoinverse of a rectangular matrix. The main result is stated as follows. For Z a given \(m\times n\) matrix of real elements of rank r, the Moore-Penrose generalized inverse (pseudoinverse) of Z is \(Z^+=A_ r/\delta_ rZ^ T\), \(\delta_ r\neq 0\) where \(A_ r\), \(\delta_ r\) are generated recursively by \(A_{k+1}=\delta_ kI-Z^ TZA_ k, \delta_{k+1}=(1/k+1)tr(Z^ TZA_{k+1}), k=0,1,...,n\), with initial conditions \(\delta_ 0=1\), \(A_ 0=0\) and where I denotes the \(n\times n\) identity matrix. The authors develop some additional properties of Decell's algorithm and point out how it can be used in the development of algebraic properties of the pseudoinverse.

Recommendations

• Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix
• A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\)
• Algorithms for generalized inverses
• A finite algorithm for generalized inverses of polynomial and rational matrices
• scientific article; zbMATH DE number 3947520

Cites work

• A comparison of estimators for undersized samples
• Algorithms for generalized inverses
• An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
• scientific article; zbMATH DE number 3642602 (Why is no real title available?)
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• scientific article; zbMATH DE number 3271181 (Why is no real title available?)
• scientific article; zbMATH DE number 3350922 (Why is no real title available?)

Cited in

(8)

• Algorithms for generalized inverses
• A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\)
• An alternative limit expression of Drazin inverse and its application
• A finite algorithm for the Drazin inverse of a polynomial matrix
• 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
• Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix

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

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