A new proof for Decell's finite algorithm for generalized inverses
From MaRDI portal
Publication:797954
DOI10.1016/0096-3003(83)90007-3zbMATH Open0546.65015OpenAlexW2003703126MaRDI QIDQ797954FDOQ797954
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
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
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Cites Work
Cited In (8)
- Finite algorithms for the (2)-generalized inverse
- A finite algorithm for the Drazin inverse of a polynomial matrix
- An alternative limit expression of Drazin inverse and its application
- Extensions of Faddeev's algorithms to polynomial matrices
- On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse
- Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix
- Algorithms for generalized inverses
- A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\)
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)