Supporting theory for a block approximate inverse preconditioner
From MaRDI portal
Publication:2229496
DOI10.1016/j.laa.2020.06.017zbMath1460.65030MaRDI QIDQ2229496
Paulo Goldfeld, Moisés Ceni de Almeida, Luiz Mariano Carvalho, Julia Sekiguchi da Cruz, Michael Souza
Publication date: 17 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.06.017
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65Y05: Parallel numerical computation
65Y10: Numerical algorithms for specific classes of architectures
65F08: Preconditioners for iterative methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classes of general \(H\)-matrices
- Block approximate inverse preconditioners for sparse nonsymmetric linear systems
- Practical considerations for adaptive implicit methods in reservoir simulation
- Symmetric multisplitting of a symmetric positive definite matrix
- M-matrix characterizations. I: nonsingular M-matrices
- A comparative study of sparse approximate inverse preconditioners
- Factorized sparse approximate inverse preconditionings. III: Iterative construction of preconditioners
- A synchronization-free algorithm for parallel sparse triangular solves
- Preconditioning techniques for large linear systems: A survey
- Two-sided bounds for the inverse of an \(H\)-matrix
- A generalized block FSAI preconditioner for nonsymmetric linear systems
- Enhanced Block FSAI Preconditioning Using Domain Decomposition Techniques
- A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
- Improved Balanced Incomplete Factorization
- Balanced Incomplete Factorization
- The Use of Supernodes in Factored Sparse Approximate Inverse Preconditioning
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Numerical Linear Algebra for High-Performance Computers
- Parallel Preconditioning with Sparse Approximate Inverses
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
- BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
- BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Fine-Grained Parallel Incomplete LU Factorization
- Linear algebra software for large-scale accelerated multicore computing
- Methods of conjugate gradients for solving linear systems
- Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics