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
From MaRDI portal
Publication:6175916
DOI10.1080/03081087.2022.2088673zbMath1515.65097OpenAlexW4283446350WikidataQ114100555 ScholiaQ114100555MaRDI QIDQ6175916
Saeed Karimi, Eisa Khosravi Dehdezi
Publication date: 25 July 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2022.2088673
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Hyper-power methods for the computation of outer inverses
- Rapid generalized Schultz iterative methods for the computation of outer inverses
- Some variant of Newton's method with third-order convergence.
- A new iterative method for finding approximate inverses of complex matrices
- Recurrent neural network for computing the \(W\)-weighted Drazin inverse
- An efficient computation of generalized inverse of a matrix
- Generalized inverses: theory and computations
- Generalized inverses. Theory and applications.
- Two finite-time convergent Zhang neural network models for time-varying complex matrix Drazin inverse
- Characterizations, iterative method, sign pattern and perturbation analysis for the DMP inverse with its applications
- Characterizations, approximation and perturbations of the core-EP inverse
- Generalized Schultz iterative methods for the computation of outer inverses
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Numerical and Symbolic Computations of Generalized Inverses
This page was built for publication: 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