Generalized Schultz iterative methods for the computation of outer inverses
From MaRDI portal
Publication:2364221
DOI10.1016/j.camwa.2014.03.019zbMath1367.65040OpenAlexW2041018132MaRDI QIDQ2364221
Publication date: 18 July 2017
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2014.03.019
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10)
Related Items (15)
Modified bas iteration method for absolute value equation ⋮ An efficient matrix iteration family for finding the generalized outer inverse ⋮ An iterative method for solving general restricted linear equations ⋮ Enclosing Moore-Penrose inverses ⋮ A family of iterative methods with accelerated convergence for restricted linear system of 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 ⋮ Hyper-power methods for the computation of outer inverses ⋮ A general class of arbitrary order iterative methods for computing generalized inverses ⋮ Exact solutions and convergence of gradient based dynamical systems for computing outer inverses ⋮ Rapid generalized Schultz iterative methods for the computation of outer inverses ⋮ On the perturbation of outer inverses of linear operators in Banach spaces ⋮ An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) ⋮ A class of quadratically convergent iterative methods ⋮ Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse ⋮ Hyperpower least squares progressive iterative approximation
Uses Software
Cites Work
- On the computation of weighted Moore-Penrose inverse using a high-order matrix method
- A third order iterative method for \(A^\dagger\)
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Computation of generalized inverses by using the \(LDL^{\ast}\) decomposition
- An improved method for the computation of the Moore-Penrose inverse matrix
- The representation and approximations of outer generalized inverses
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- A note on computing the generalized inverse \(A_{T,S}^{(2)}\) of a matrix \(A\)
- 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
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- Generalized matrix inversion is not harder than matrix multiplication
- Generalised matrix inversion and rank computation by successive matrix powering
- Successive matrix squaring algorithm for computing the Drazin inverse
- The representation and approximation for the generalized inverse \(A^{(2)}_{T,S}\)
- Generalized inverses. Theory and applications.
- A self-correcting matrix iteration for the Moore-Penrose generalized inverse
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- Successive matrix squaring algorithm for computing the generalized inverse \(A^{(2)}_{T, S}\)
- Representation and approximation of the outer inverse \(A_{T,S}^{(2)}\) of a matrix \(A\)
- Gauss-Jordan elimination method for computing outer inverses
- Full-rank representation of generalized inverse \(A_{T,S}^{(2)}\) and its application
- Successive matrix squaring algorithm for computing outer inverses
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
This page was built for publication: Generalized Schultz iterative methods for the computation of outer inverses
