A new proof for Decell's finite algorithm for generalized inverses
From MaRDI portal
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
- 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?)
- A comparison of estimators for undersized samples
- Algorithms for generalized inverses
- An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
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
- Decell's finite algorithm for generalized inverses and tests to determine the rank of a matrix
- On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse
- 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)