A rapid numerical algorithm to compute matrix inversion
From MaRDI portal
Publication:715101
DOI10.1155/2012/134653zbMath1253.65051OpenAlexW1996383103WikidataQ58705540 ScholiaQ58705540MaRDI QIDQ715101
Publication date: 16 October 2012
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/134653
Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items
An efficient matrix iteration family for finding the generalized outer inverse, Comparison of linear solvers for equilibrium geochemistry computations, A matrix iteration for finding Drazin inverse with ninth-order convergence, An efficient matrix iterative method for computing Moore-Penrose inverse, An improved computationally efficient method for finding the Drazin inverse, A general class of arbitrary order iterative methods for computing generalized inverses
Uses Software
Cites Work
- A generalized Taylor factorization for Hermite subdivision schemes
- Chebyshev-type methods and preconditioning techniques
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- A new scheme of computing the approximate inverse preconditioner for the reduced linear systems
- On the relation between the AINV and the FAPINV algorithms
- Numerical experiments with two approximate inverse preconditioners
- Newton-like iteration based on a cubic polynomial for structured matrices
- Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise.
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Mathematica in Action
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
