Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices
DOI10.1007/BF02896480zbMath1104.65042OpenAlexW2135635858MaRDI QIDQ854442
Publication date: 4 December 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02896480
algorithmconvergencenumerical examplespreconditioningKrylov subspace methodsreorderingindefinite matrixincomplete Lu factorization
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the problem of unstable pivots in the incomplete LU-conjugate gradient method
- Experimental study of ILU preconditioners for indefinite matrices
- Preconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications
- Preconditioning techniques for large linear systems: A survey
- A Multilevel Dual Reordering Strategy for Robust Incomplete LU Factorization of Indefinite Matrices
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Preconditioning Highly Indefinite and Nonsymmetric Matrices
- The university of Florida sparse matrix collection
- A Stability Analysis of Incomplete LU Factorizations
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- ILUT: A dual threshold incomplete LU factorization
This page was built for publication: Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices