A fast convergent iterative solver for approximate inverse of matrices
DOI10.1002/nla.1890zbMath1340.65051OpenAlexW1693006369MaRDI QIDQ5502422
Publication date: 26 August 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1890
algorithmstabilityconvergenceconsistencysparse matrixpreconditionersMoore-Penrose inversenumerical comparisonsapproximate inverseiterative matrix inversion
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Approximate Newton methods and homotopy for stationary operator equations
- A characterization and representation of the generalized inverse \(A_{T,S}^{(2)}\) and its applications
- Generalized inverses. Theory and applications.
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- Successive matrix squaring algorithm for computing outer inverses
- The university of Florida sparse matrix collection
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Mathematica in Action
- Parallel Preconditioning with Sparse Approximate Inverses
- A probing method for computing the diagonal of a matrix inverse
- On the Moore–Penrose inverse in solving saddle‐point systems with singular diagonal blocks
- Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations
- On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products