Work

Adaptive selection of Krylov subspace methods and preconditioners for solving sparse linear systems

Year: 2026
Type: article
Abstract: Solution of sparse linear systems of equations is often the most time-consuming operation in many large-scale science and engineering applications. For such problems, usually classical single-level preconditioned or multilevel (inner-outer) iterative methods are preferred. Fine-tuning inner-outer Krylov subspace methods, however, still remains as a challenge due to the problem-dependent nature of optimal solver and preconditioner configurations. Parameters such as solver stopping tolerances and preconditioner settings are often chosen by trial and error. In this work, we introduce a machine learning framework coupled with an optimization process to predict a good combination of Krylov subspace solver(s), preconditioner, and associated tolerance settings. Our approach predicts the algebraic surrogate cost of various solver-preconditioner pairs across a range of tolerance thresholds, enabling the selection of the most cost-effective configuration for a given problem instance.
Language: English
Open Access status: diamond
OpenAlex ID: W7235389596
FWCI:
Cites: 32
Cited by:
Related to: 10