Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition
From MaRDI portal
Publication:2968582
DOI10.1137/15M1053256zbMath1360.65094MaRDI QIDQ2968582
Publication date: 20 March 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block SSOR preconditionings for high-order 3D FE systems. II: Incomplete BSSOR preconditionings
- The effect of ordering on preconditioned conjugate gradients
- Experimental study of ILU preconditioners for indefinite matrices
- Preconditioning techniques for large linear systems: A survey
- VBARMS: a variable block algebraic recursive multilevel solver for sparse linear systems
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
- A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
- The university of Florida sparse matrix collection
- An Empirical Analysis of the Performance of Preconditioners for SPD Systems
- A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
- Adaptive Techniques for Improving the Performance of Incomplete Factorization Preconditioning
- The Role of Elimination Trees in Sparse Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An extended set of FORTRAN basic linear algebra subprograms
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Effect of Equilibration on Residual Size for Partial Pivoting
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- On Finding Supernodes for Sparse Matrix Computations
- An object-oriented framework for block preconditioning
- A set of level 3 basic linear algebra subprograms
- Finding Exact and Approximate Block Structures for ILU Preconditioning
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
- Crout Versions of ILU for General Sparse Matrices
- Large Growth Factors in Gaussian Elimination with Pivoting
- Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
- A Restarted GMRES Method Augmented with Eigenvectors
- ILUT: A dual threshold incomplete LU factorization
- Performance Issues for Iterative Solvers in Device Simulation
- IMF: An Incomplete Multifrontal $LU$-Factorization for Element-Structured Sparse Linear Systems
- On equilibration and sparse factorization of matrices arising in finite element solutions of partial differential equations
- On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- ARMS: an algebraic recursive multilevel solver for general sparse linear systems
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
This page was built for publication: Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition