A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\)

DOI10.1016/0096-3003(87)90058-0zbMath0635.65039OpenAlexW2049235729MaRDI QIDQ1097639

Guo-rong Wang

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0096-3003(87)90058-0

zbMATH Keywords

weighted Moore-Penrose inversestopping ruleFaddeev-Decell algorithmrank determination

Mathematics Subject Classification ID

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

Related Items (10)

Finite algorithms for the (2)-generalized inverse ⋮ Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights ⋮ Successive matrix squaring algorithm for parallel computing the weighted generalized inverse \(A^+_{MN}\) ⋮ A new extension of Leverrier's algorithm ⋮ The representation of generalized inverse \(A_{T,S}^{(2,3)}\) and its applications ⋮ DFT calculation for the \(\{2\}\)-inverse of a polynomial matrix with prescribed image and kernel ⋮ Methods of computing weighted pseudoinverse matrices with singular weights ⋮ The representation and approximation for the weighted Moore-Penrose inverse ⋮ A finite algorithm for the Drazin inverse of a polynomial matrix ⋮ An alternative limit expression of Drazin inverse and its application

Cites Work

• A new proof for Decell's finite algorithm for generalized inverses
• An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A finite algorithm for computing the weighted Moore-Penrose inverse \(A^ +_{MN}\)