A new scheme of computing the approximate inverse preconditioner for the reduced linear systems
From MaRDI portal
Publication:861899
DOI10.1016/j.cam.2005.08.033zbMath1108.65042OpenAlexW2091674155MaRDI QIDQ861899
Publication date: 2 February 2007
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.08.033
numerical examplesSchur complementpreconditioningreductiongreedy algorithmNewton schemelarge sparse matrixreduced linear system
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
A family of iterative methods with accelerated convergence for restricted linear system of equations ⋮ A rapid numerical algorithm to compute matrix inversion ⋮ Chebyshev-type methods and preconditioning techniques ⋮ An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\)
Uses Software
Cites Work
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- On Iterative Computation of Generalized Inverses and Associated Projections
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new scheme of computing the approximate inverse preconditioner for the reduced linear systems
