On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse

DOI10.1137/0711008zbMath0241.65038OpenAlexW2053225713WikidataQ56227098 ScholiaQ56227098MaRDI QIDQ5652128

Publication date: 1974

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0711008

Mathematics Subject Classification ID

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

Related Items (30)

Exploiting higher computational efficiency index for computing outer generalized inverses ⋮ An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse ⋮ On the computation of weighted Moore-Penrose inverse using a high-order matrix method ⋮ An efficient matrix iteration family for finding the generalized outer inverse ⋮ The hyperpower iteration revisited ⋮ On finding robust approximate inverses for large sparse matrices ⋮ Iterative inversion of structured matrices ⋮ A self-correcting matrix iteration for the Moore-Penrose generalized inverse ⋮ A fast computational algorithm for computing outer pseudo-inverses with numerical experiments ⋮ Computing outer inverses by scaled matrix iterations ⋮ Computational methods of linear algebra ⋮ Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs ⋮ An efficient matrix iterative method for computing Moore-Penrose inverse ⋮ Hybrid Ikebe-Newton's iteration for inverting general nonsingular Hessenberg matrices ⋮ An efficient computation of generalized inverse of a matrix ⋮ Iterative solution of a class of linear equations with application to reconstruction of three-dimensional object arrays† ⋮ A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors ⋮ Homotopic residual correction processes ⋮ An efficient matrix iteration for computing weighted Moore-Penrose inverse ⋮ A rapid and powerful iterative method for computing inverses of sparse tensors with applications ⋮ Factorizations of hyperpower family of iterative methods via least squares approach ⋮ An improved Newton iteration for the weighted Moore-Penrose inverse ⋮ On continuity of the Moore-Penrose and Drazin generalized inverses ⋮ Schultz matrix iteration based method for stable solution of discrete ill-posed problems ⋮ An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) ⋮ LU factorization of non-standard forms and direct multiresolution solvers ⋮ Fast and efficient parallel solution of dense linear systems ⋮ Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\) ⋮ A note on the stability of a \(p\)th order iteration for finding generalized inverses ⋮ Finding the Moore-Penrose inverse by a new matrix iteration

This page was built for publication: On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse