Iterative method for computing the Moore-Penrose inverse based on Penrose equations
From MaRDI portal
The authors present an iterative algorithm for computing the Moore-Penrose generalized inverse, based on the usage of the Penrose equations \(XAX=X\) and \((XA)^*=XA\). They also provide conditions for the convergence of the method as well as the first-order and second-order terms in error estimates. A comparison with similar iterative algorithms and numerical results are also given.
Recommendations
- An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
- A self-correcting matrix iteration for the Moore-Penrose generalized inverse
- Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations
- An efficient matrix iterative method for computing Moore-Penrose inverse
- An iterative method to compute Moore-Penrose inverse based on gradient maximal convergence rate
Cites work
- A Note on an Iterative Method for Generalized Inversion of Matrices
- A self-correcting matrix iteration for the Moore-Penrose generalized inverse
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
- Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
- Contributions to the Theory of Generalized Inverses
- Generalised matrix inversion and rank computation by successive matrix powering
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- Neumann-type expansion of reflexive generalized inverses of a matrix and the hyperpower iterative method
- On Iterative Computation of Generalized Inverses and Associated Projections
- Successive matrix squaring algorithm for computing outer inverses
- Successive matrix squaring algorithm for computing the Drazin inverse
- Successive matrix squaring algorithm for parallel computing the weighted generalized inverse \(A^+_{MN}\)
Cited in
(40)- From Zhang neural network to scaled hyperpower iterations
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
- Computation of Moore-Penrose generalized inverses of matrices with meromorphic function entries
- A self-correcting matrix iteration for the Moore-Penrose generalized inverse
- Discrete-time noise-tolerant Zhang neural network for dynamic matrix pseudoinversion
- An improved algorithm for basis pursuit problem and its applications
- An efficient matrix iterative method for computing Moore-Penrose inverse
- Characterizations, approximation and perturbations of the core-EP inverse
- Computing the Moore-Penrose inverse using its error bounds
- A class of quadratically convergent iterative methods
- A note on the stability of a \(p\)th order iteration for finding generalized inverses
- Generalized Schultz iterative methods for the computation of outer inverses
- A parallel computing method based on zeroing neural networks for time-varying complex-valued matrix Moore-Penrose inversion
- Neural network approach to computing outer inverses based on the full rank representation
- Smoothed Analysis of Moore–Penrose Inversion
- On the computation of weighted Moore-Penrose inverse using a high-order matrix method
- Iterative method for M-P inverse based on matrix splittings
- Iterations for approximating limit representations of generalized inverses
- An iterative algorithm for Moore-Penrose inverse and Drazin inverse of real matrix
- scientific article; zbMATH DE number 3976205 (Why is no real title available?)
- 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
- Iterative methods for computing generalized inverses related with optimization methods
- An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
- Computer-Aided Verification for Iterative Matrix Inversion Problems in Systems and Control
- ZNN models for computing matrix inverse based on hyperpower iterative methods
- A fourth-order iterative method for computing the Moore-Penrose inverse
- An iterative method to compute Moore-Penrose inverse based on gradient maximal convergence rate
- A novel iterative method for computing generalized inverse
- Recurrent Neural Network for Computing Outer Inverse
- Higher order iterations for Moore-Penrose inverses
- An improved method for the computation of the Moore-Penrose inverse matrix
- Neural network for computing pseudoinverses and outer inverses of complex-valued matrices
- Rapid generalized Schultz iterative methods for the computation of outer inverses
- Schultz matrix iteration based method for stable solution of discrete ill-posed problems
- A higher order iterative method for \(A^{(2)}_{T,S}\)
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers
- Interval iterative methods for computing Moore-Penrose inverse
- Computing outer inverses by scaled matrix iterations
This page was built for publication: Iterative method for computing the Moore-Penrose inverse based on Penrose equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611833)
