An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
DOI10.1080/00207160.2016.1167883zbMATH Open1372.65114OpenAlexW2316657193MaRDI QIDQ4976308FDOQ4976308
Authors:
Publication date: 28 July 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1167883
Recommendations
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- An efficient matrix iterative method for computing Moore-Penrose inverse
- A fourth-order iterative method for computing the Moore-Penrose inverse
numerical examplesiterative methodmatrix multiplicationMoore-Penrose inversesecond-order convergenceSchulz-type method
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Cites Work
- Generalized inverses. Theory and applications.
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inverse Problems in Neural Field Theory
- A higher order iterative method for \(A^{(2)}_{T,S}\)
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- On Iterative Computation of Generalized Inverses and Associated Projections
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- A note on the stability of a \(p\)th order iteration for finding generalized inverses
- Chebyshev-type methods and preconditioning techniques
- The generalized weighted Moore-Penrose inverse
- Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
- Application of the pseudoinverse computation in reconstruction of blurred images
Cited In (14)
- An improved computationally efficient method for finding the Drazin inverse
- Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- An efficient method to compute the Moore-Penrose inverse
- Finding the Moore-Penrose inverse by a new matrix iteration
- An interval extension of SMS method for computing weighted Moore-Penrose inverse
- An efficient matrix iterative method for computing Moore-Penrose inverse
- On the extension of Householder's method for weighted Moore-Penrose inverse
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
- Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
- A family of iterative methods with accelerated convergence for restricted linear system of equations
- On the Moore–Penrose inverse in solving saddle‐point systems with singular diagonal blocks
This page was built for publication: An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976308)
