Evolving Generalizable Multigrid-Based Helmholtz Preconditioners with Grammar-Guided Genetic Programming
Not on the map. Why?
Abstract (arXiv)
Solving the indefinite Helmholtz equation is not only crucial for the understanding of many physical phenomena but also represents an outstandingly-difficult benchmark problem for the successful application of numerical methods. Here we introduce a new approach for evolving efficient preconditioned iterative solvers for Helmholtz problems with multi-objective grammar-guided genetic programming. Our approach is based on a novel context-free grammar, which enables the construction of multigrid preconditioners that employ a tailored sequence of operations on each discretization level. To find solvers that generalize well over the given domain, we propose a custom method of successive problem difficulty adaption, in which we evaluate a preconditioner's efficiency on increasingly ill-conditioned problem instances. We demonstrate our approach's effectiveness by evolving multigrid-based preconditioners for a two-dimensional indefinite Helmholtz problem that outperform several human-designed methods for different wavenumbers up to systems of linear equations with more than a million unknowns.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 57 references that are in the map. First posted on arXiv 27 Apr 2022.
Builds on
7 of 57 references.
References · 7
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
- 2021Physics-Informed Neural Operator for Learning Partial Differential Equationscited by 516
- 2021Neural Operator: Learning Maps Between Function Spacescited by 413
- 2019Learning to Optimize Multigrid PDE Solverscited by 79
- 2020Learning Algebraic Multigrid Using Graph Neural Networkscited by 54
- 2021Optimization-Based Algebraic Multigrid Coarsening Using Reinforcement Learningcited by 21
- 2021Learning optimal multigrid smoothers via neural networkscited by 17
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.