A block version algorithm to approximate inverse factors

DOI10.1016/j.amc.2004.03.024zbMath1063.65027OpenAlexW2001623670MaRDI QIDQ1765883

Davod Khojasteh Salkuyeh, Faezeh Toutounian

Publication date: 23 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.03.024

zbMATH Keywords

Schur complementNumerical experimentsGMRES methodPreconditioningParallel computersDomain decomposition methodBordering techniqueInverse factorsSkyline formatSparse approximate inverse factors

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items (2)

Factored sparse approximate inverse of block tridiagonal and block pentadiagonal matrices ⋮ A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations

Uses Software

• ITSOL
• ILUM
• SPARSKIT

Cites Work

• Unnamed Item
• Numerical experiments with two approximate inverse preconditioners
• A comparative study of sparse approximate inverse preconditioners
• Preconditioning techniques for large linear systems: A survey
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Approximate Inverse Techniques for Block-Partitioned Matrices
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations
• Iterative Solution Methods
• ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method

This page was built for publication: A block version algorithm to approximate inverse factors