Communication Avoiding ILU0 Preconditioner
From MaRDI portal
Publication:5254468
DOI10.1137/130930376zbMath1328.65076OpenAlexW2024149451MaRDI QIDQ5254468
Sophie Moufawad, Laura Grigori
Publication date: 9 June 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130930376
Parallel algorithms in computer science (68W10) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Related Items (9)
A Matrix-Free ILU Realization Based on Surrogates ⋮ Exploiting spatial symmetries for solving Poisson's equation ⋮ Varying the \(s\) in your \(s\)-step GMRES ⋮ A supernodal block factorized sparse approximate inverse for non-symmetric linear systems ⋮ A parallel version of GPBi-CG method suitable for distributed parallel computing ⋮ s-Step Enlarged Krylov Subspace Conjugate Gradient Methods ⋮ Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication ⋮ Preparing sparse solvers for exascale computing ⋮ Communication Avoiding ILU0 Preconditioner
Uses Software
Cites Work
- Unnamed Item
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems
- s-step iterative methods for symmetric linear systems
- Some simplified NP-complete graph problems
- Preconditioning techniques for large linear systems: A survey
- A parallel GMRES version for general sparse matrices
- Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
- On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- The university of Florida sparse matrix collection
- Minimizing Communication in Numerical Linear Algebra
- CALU: A Communication Optimal LU Factorization Algorithm
- Low frequency tangential filtering decomposition
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
- New development in freefem++
- Communication Avoiding ILU0 Preconditioner
- Nested Dissection of a Regular Finite Element Mesh
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Communication Avoiding ILU0 Preconditioner
