Resumen
We introduce block versions of the multielimination incomplete LU (ILUM) factorization preconditioning technique for solving general sparse unstructured linear systems. These preconditioners have a multilevel structure and, for certain types of problems, may exhibit properties that are typically enjoyed by multigrid methods. Several heuristic strategies for forming blocks of independent sets are introduced and their relative merits are discussed. The advantages of block ILUM over point ILUM include increased robustness and efficiency. We compare several versions of the block ILUM, point ILUM, and the dual-threshold-based ILUT preconditioners. In particular, tests with some convection-diffusion problems show that it may be possible to obtain convergence that is nearly independent of the Reynolds number as well as of the grid size.
| Idioma original | English |
|---|---|
| Páginas (desde-hasta) | 2103-2121 |
| Número de páginas | 19 |
| Publicación | Unknown Journal |
| Volumen | 20 |
| N.º | 6 |
| DOI | |
| Estado | Published - 1999 |
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics
Huella
Profundice en los temas de investigación de 'Bilum: block versions of multielimination and multilevel ILU preconditioner for general sparse linear systems'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver