Metraipolis › archive › dc_33efc567fd5f
A comparison of parallel iterative methods for ILU triangular solves — arXiv:2611.00552
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00552
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:35:33.682Z
- SHA-256 of the archived text
86d5f9cdd5b81884a301a59d572dd6176ce655686649ff9afab5bfce08d7b59e- Stable URL of this page
https://metraipolis.com/documento/dc_33efc567fd5f
How to cite
A comparison of parallel iterative methods for ILU triangular solves — arXiv:2611.00552 — arXiv (en), https://arxiv.org/abs/2611.00552 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_33efc567fd5f (Metraipolis archive dc_33efc567fd5f, sha256 86d5f9cdd5b81884a301a59d572dd6176ce655686649ff9afab5bfce08d7b59e)
BibTeX
@misc{dc33efc567fd5f,
title = {A comparison of parallel iterative methods for ILU triangular solves — arXiv:2611.00552},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00552},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_33efc567fd5f; sha256 86d5f9cdd5b81884a301a59d572dd6176ce655686649ff9afab5bfce08d7b59e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00552. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Exact triangular solves parallelise poorly, limited by the size and number of the level sets, so on GPUs the factors from incomplete LU (ILU) factorisations are often solved approximately with parallel iterative methods. We compare four such methods: a Jacobi method, an Incomplete Sparse Approximate Inverse (ISAI), GMRES polynomials, and AIRG, a reduction multigrid built on GMRES polynomials, for which we introduce a parallel coarse/fine splitting that bounds the diagonal dominance ratio of the fine-fine block. We test them with ILU(0) and ILU(1) factors of canonical PDE problems and 91 SuiteSparse/Matrix Market matrices, the latter on a single GPU. AIRG is the most robust on the PDE factors, with nearly flat iteration counts under refinement and no per-problem tuning, but has the largest setup and memory costs. GMRES polynomials are more robust than the Jacobi method at a similar cost. As the inner solve of an ILU preconditioner with tuned inner iteration counts, ISAI gives the largest median speedups over a hipSPARSE exact triangular solve (4.5$\times$ and 6.8$\times$ for ILU(0) and ILU(1)), though this was dominated by smaller problems; on the largest ILU(1) problems all four methods give similar median speedups of 2.1-2.6$\times$. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2611.00552 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:05:07.187Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).