An iterative method to compute Moore-Penrose inverse based on gradient maximal convergence rate
From MaRDI portal
Publication:5259505
DOI10.2298/FIL1307269SzbMATH Open1391.65073OpenAlexW2107941921MaRDI QIDQ5259505FDOQ5259505
Authors: Xingping Sheng, Tao Wang
Publication date: 26 June 2015
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1307269s
Recommendations
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
- A fourth-order iterative method for computing the Moore-Penrose inverse
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Interval iterative methods for computing Moore-Penrose inverse
Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10)
Cited In (5)
- 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
- Iterative method for M-P inverse based on matrix splittings
- Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
- Title not available (Why is that?)
This page was built for publication: An iterative method to compute Moore-Penrose inverse based on gradient maximal convergence rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259505)