A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse

DOI10.1137/0708013zbMath0217.52605OpenAlexW2086399057MaRDI QIDQ5621905

Adi Ben-Israel, Stephen S. Yau, James M. Garnett III

Publication date: 1971

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

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

Mathematics Subject Classification ID

Factorization of matrices (15A23) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (9)

Computational methods of linear algebra ⋮ Numerical algorithms for the Moore-Penrose inverse of a matrix: iterative methods ⋮ A geometrical approach on generalized inverses by Neumann-type series ⋮ Neumann-type expansion of reflexive generalized inverses of a matrix and the hyperpower iterative method ⋮ Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix ⋮ Schultz matrix iteration based method for stable solution of discrete ill-posed problems ⋮ Fast and efficient parallel solution of dense linear systems ⋮ Best accessible estimation: Convergence properties and limiting forms of the direct and reduced versions ⋮ Hyperpower least squares progressive iterative approximation

This page was built for publication: A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse