A family of iterative methods for computing Moore-Penrose inverse of a matrix
From MaRDI portal
Publication:1932581
DOI10.1016/j.laa.2012.08.004zbMath1258.65035OpenAlexW2022808741MaRDI QIDQ1932581
Li Juan, Qiao Tiantian, Li Weiguo
Publication date: 21 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.08.004
Related Items (25)
Generalized Schultz iterative methods for the computation of outer inverses ⋮ On finding robust approximate inverses for large sparse matrices ⋮ From Zhang neural network to scaled hyperpower iterations ⋮ Approximation of inverse operators by a new family of high-order iterative methods ⋮ A higher-order zeroing neural network for pseudoinversion of an arbitrary time-varying matrix with applications to mobile object localization ⋮ Computing outer inverses by scaled matrix iterations ⋮ A new iterative method for finding approximate inverses of complex matrices ⋮ An efficient matrix iterative method for computing Moore-Penrose inverse ⋮ Finding generalized inverses by a fast and efficient numerical method ⋮ An efficient matrix iteration for computing weighted Moore-Penrose inverse ⋮ An efficient method to compute the Moore-Penrose inverse ⋮ A general class of arbitrary order iterative methods for computing generalized inverses ⋮ ZNN models for computing matrix inverse based on hyperpower iterative methods ⋮ Computing the Moore-Penrose inverse using its error bounds ⋮ A higher order iterative method for \(A^{(2)}_{T,S}\) ⋮ Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems ⋮ An efficient quadratically convergent iterative method to find the Moore–Penrose inverse ⋮ A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis ⋮ A class of Kung-Traub-type iterative algorithms for matrix inversion ⋮ A fast convergent iterative solver for approximate inverse of matrices ⋮ A class of quadratically convergent iterative methods ⋮ Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\) ⋮ A note on the stability of a \(p\)th order iteration for finding generalized inverses ⋮ Finding the Moore-Penrose inverse by a new matrix iteration ⋮ An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T,S}^{(2)}\)
Cites Work
- Unnamed Item
- Unnamed Item
- The representation and approximations of outer generalized inverses
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- Interval iterative methods for computing Moore-Penrose inverse
- Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
- A note on computational algorithm for the inverse of a square matrix
- Generalised matrix inversion and rank computation by successive matrix powering
- Successive matrix squaring algorithm for computing the Drazin inverse
- Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration
- A characterization and representation of the generalized inverse \(A_{T,S}^{(2)}\) and its applications
- Generalized inverses. Theory and applications.
- Optimization theory and methods. Nonlinear programming
- Successive matrix squaring algorithm for computing outer inverses
- The Representation and Computational Procedures for the Generalized Inverse of an OperatorAin Hilbert Spaces
- The representation and approximation for Drazin inverse
This page was built for publication: A family of iterative methods for computing Moore-Penrose inverse of a matrix
