Computing the Moore-Penrose inverse using its error bounds
DOI10.1016/J.AMC.2019.124957zbMATH Open1435.65061OpenAlexW2998543699MaRDI QIDQ2287706FDOQ2287706
Authors: Predrag S. Stanimirović, Falguni Roy, Shwetabh Srivastava, D. K. Gupta 
Publication date: 21 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124957
Recommendations
- Interval iterative methods for computing Moore-Penrose inverse
- Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse
- An improved method for the computation of the Moore-Penrose inverse matrix
- An iterative method to compute Moore-Penrose inverse based on gradient maximal convergence rate
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Generalized inverses. Theory and applications.
- Interval analysis: Theory and applications
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- Title not available (Why is that?)
- Gauss-Jordan elimination method for computing outer inverses
- On the perturbation of the group inverse and oblique projection
- Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- An improved method for the computation of the Moore-Penrose inverse matrix
- Contributions to the Theory of Generalized Inverses
- Interval iterative methods for computing Moore-Penrose inverse
- A new method for computing Moore-Penrose inverse matrices
- Computation of generalized inverses by using the \(LDL^{\ast}\) decomposition
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- Generalized matrix inversion is not harder than matrix multiplication
- Fast computing of the Moore-Penrose inverse matrix
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization
- Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices
- Removal of blur in images based on least squares solutions
- A hyperpower iterative method for computing the generalized Drazin inverse of Banach algebra element
- Higher order iterations for Moore-Penrose inverses
Cited In (5)
- Enclosing Moore-Penrose inverses
- Interval iterative methods for computing Moore-Penrose inverse
- Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse
- An efficient matrix iteration family for finding the generalized outer inverse
- Moore-Penrose inverse of an interval matrix and its application
Uses Software
This page was built for publication: Computing the Moore-Penrose inverse using its error bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287706)
