A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
From MaRDI portal
Publication:426929
DOI10.1016/j.amc.2011.05.066zbMath1298.65068OpenAlexW1988956646MaRDI QIDQ426929
Publication date: 13 June 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.05.066
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10)
Related Items (36)
A linearly convergent algorithm for sparse signal reconstruction ⋮ Smoothing approximation to the lower order exact penalty function for inequality constrained optimization ⋮ Some inequalities for the Fan product of \(M\)-tensors ⋮ Generalized Schultz iterative methods for the computation of outer inverses ⋮ Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems ⋮ Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices ⋮ Characterizations, iterative method, sign pattern and perturbation analysis for the DMP inverse with its applications ⋮ High-order sum-of-squares structured tensors: theory and applications ⋮ HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations ⋮ GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications ⋮ A Novel Iterative Method for Computing Generalized Inverse ⋮ Partial orders based on the CS decomposition ⋮ An efficient algorithm for finding the maximal eigenvalue of zero symmetric nonnegative matrices ⋮ Hyper-power methods for the computation of outer inverses ⋮ Effective implementation to reduce execution time of a low-rank matrix approximation problem ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors ⋮ An efficient method to compute the Moore-Penrose inverse ⋮ A general class of arbitrary order iterative methods for computing generalized inverses ⋮ An alternative extragradient projection method for quasi-equilibrium problems ⋮ The conjugate gradient viscosity approximation algorithm for split generalized equilibrium and variational inequality problems ⋮ An improved algorithm for basis pursuit problem and its applications ⋮ Higher-order convergent iterative method for computing the generalized inverse over Banach spaces ⋮ Solution structures of tensor complementarity problem ⋮ Rapid generalized Schultz iterative methods for the computation of outer inverses ⋮ Computing the Moore-Penrose inverse using its error bounds ⋮ A higher order iterative method for \(A^{(2)}_{T,S}\) ⋮ New characterizations of the CMP inverse of matrices ⋮ 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 ⋮ Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement ⋮ High-order iterative methods for the DMP inverse ⋮ An accelerated augmented Lagrangian method for multi-criteria optimization problem ⋮ A note on the stability of a \(p\)th order iteration for finding generalized inverses ⋮ A singular fractional Kelvin-Voigt model involving a nonlinear operator and their convergence properties ⋮ Finding the Moore-Penrose inverse by a new matrix iteration
Cites Work
- Unnamed Item
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- 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
- The representation and approximation for the weighted Moore-Penrose inverse
- Successive matrix squaring algorithm for computing outer inverses
- On Iterative Computation of Generalized Inverses and Associated Projections
- Contributions to the Theory of Generalized Inverses
- Recurrent neural networks for computing weighted Moore-Penrose inverse
- Successive matrix squaring algorithm for parallel computing the weighted generalized inverse \(A^+_{MN}\)
This page was built for publication: A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
