Numerical experiments with parallel orderings for ILU preconditioners
Incomplete factorization techniques such as ILU, ILUT, MILU provide a good preconditioning strategy for solving linear systems with Krylov subspace methods. These preconditioners can be parallelized using various techniques such as multicolor orderings and subdomain preconditioning. The authors' purpose is to perform numerical experiments to compare these techniques in order to establish the most effective ways to use preconditioning on serial and parallel computers. The effect of symmetric reordering of the matrix for ILU preconditioners, and subdomain overlap for additive Schwarz preconditioners, on the convergence of preconditioned Krylov subspace method is studied. Some structurally symmetric matrices, arising from partial differential equations discretized on structured grids using finite differences, are considered. It is shown that parallel ordering can perform well even in a sequential environment especially for ILUT preconditioning of two-dimensional problems. The numerical experiments show that preconditioners derived from finite difference matrices reordered with multicoloring strategies can outperform those derived from the naturally ordered system in a significant number of cases.
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Comparison Criteria for Parallel Orderings in ILU Preconditioning
- Publication:3198794
- Block and full matrix ILU preconditioners for parallel finite element solvers
- On parallelism and convergence of incomplete LU factorizations
- Experimental study of ILU preconditioners for indefinite matrices
- Independent columns: A new parallel ILU preconditioner for the PCG method
- On the convergence of iterative solvers for polygonal discontinuous Galerkin discretizations
- The effect of block red-black ordering on block ILU preconditioner for sparse matrices
- Preconditioning techniques for large linear systems: A survey
- A novel ILU preconditioning method with a block structure suitable for SIMD vectorization
- Graph coarsening: from scientific computing to machine learning
- ParILUT---A New Parallel Threshold ILU Factorization
- scientific article; zbMATH DE number 4174229 (Why is no real title available?)
- Updating incomplete factorization preconditioners for model order reduction
- ILU preconditioning based on the FAPINV algorithm
- Two-Color Fourier Analysis of Iterative Algorithms for Elliptic Problems with Red/Black Ordering
- Flexible incomplete Cholesky factorization with multi-parameters to control the number of nonzero elements in preconditioners
- Block regularization Kaczmarz method
- Об одной вычислительной реализации блочного метода Гаусса-Зейделя для нормальных систем уравнений
- An asynchronous incomplete block LU preconditioner for computational fluid dynamics on unstructured grids
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Fine-grained parallel incomplete LU factorization
- Comparison Criteria for Parallel Orderings in ILU Preconditioning
- On the effectiveness of fine-grain parallel linear iterations for computational aerodynamics on structured grids for graphics processing units
- A generalized iterative method and comparison results using projection techniques for solving linear systems
- On a new iterative method for solving linear systems and comparison results
This page was built for publication: Numerical experiments with parallel orderings for ILU preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292268)
