On the relation between the AINV and the FAPINV algorithms
From MaRDI portal
Publication:963484
DOI10.1155/2009/179481zbMath1188.65030OpenAlexW2141530648WikidataQ58648404 ScholiaQ58648404MaRDI QIDQ963484
Hadi Roohani, Davod Khojasteh Salkuyeh
Publication date: 20 April 2010
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/225562
Related Items (1)
Cites Work
- Unnamed Item
- A new class of decomposition for symmetric systems
- An incomplete inverse as a preconditioner for the conjugate gradient method
- Numerical experiments with two approximate inverse preconditioners
- A comparative study of sparse approximate inverse preconditioners
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- Preconditioning techniques for large linear systems: A survey
- A new class of decomposition for inverting asymmetric and indefinite matrices
- ILU preconditioning based on the FAPINV algorithm
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
This page was built for publication: On the relation between the AINV and the FAPINV algorithms