On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
From MaRDI portal
Publication:5652128
DOI10.1137/0711008zbMATH Open0241.65038OpenAlexW2053225713WikidataQ56227098 ScholiaQ56227098MaRDI QIDQ5652128FDOQ5652128
Authors: G. W. Stewart, Torsten Söderström
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
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)
Cited In (30)
- A note on the stability of a \(p\)th order iteration for finding generalized inverses
- Factorizations of hyperpower family of iterative methods via least squares approach
- Finding the Moore-Penrose inverse by a new matrix iteration
- On finding robust approximate inverses for large sparse matrices
- Exploiting higher computational efficiency index for computing outer generalized inverses
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
- Computational methods of linear algebra
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
- Iterative inversion of structured matrices
- Schultz matrix iteration based method for stable solution of discrete ill-posed problems
- Iterative solution of a class of linear equations with application to reconstruction of three-dimensional object arrays†
- Fast and efficient parallel solution of dense linear systems
- On the computation of weighted Moore-Penrose inverse using a high-order matrix method
- An efficient matrix iterative method for computing Moore-Penrose inverse
- The hyperpower iteration revisited
- Computing outer inverses by scaled matrix iterations
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- An efficient matrix iteration family for finding the generalized outer inverse
- Homotopic residual correction processes
- A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
- A self-correcting matrix iteration for the Moore-Penrose generalized inverse
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs
- An efficient matrix iteration for computing weighted Moore-Penrose inverse
- An efficient computation of generalized inverse of a matrix
- Hybrid Ikebe-Newton's iteration for inverting general nonsingular Hessenberg matrices
- On continuity of the Moore-Penrose and Drazin generalized inverses
- An improved Newton iteration for the weighted Moore-Penrose inverse
- LU factorization of non-standard forms and direct multiresolution solvers
This page was built for publication: On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652128)