Complex additive geometric multilevel solvers for Helmholtz equations on spacetrees

DOI10.1145/3054946MaRDI QIDQ3133593zbMATH OpenOpenAlexWikidataFDO

Authors Bram Reps, Tobias Weinzierl

Publication date 5 February 2018

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.03954, http://dro.dur.ac.uk/19814/1/19814.pdf

zbMATH Keywords

vectorizationHelmholtzAMRBPXadditive multigrid

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)

Abstract: We introduce a family of implementations of low order, additive, geometric multilevel solvers for systems of Helmholtz equations. Both grid spacing and arithmetics may comprise complex numbers and we thus can apply complex scaling techniques to the indefinite Helmholtz operator. Our implementations are based upon the notion of a spacetree and work exclusively with a finite number of precomputed local element matrices. They are globally matrix-free. Combining various relaxation factors with two grid transfer operators allows us to switch from pure additive multigrid over a hierarchical basis method into BPX with several multiscale smoothing variants within one code base. Pipelining allows us to realise a full approximation storage (FAS) scheme within the additive environment where, amortised, each grid vertex carrying degrees of freedom is read/written only once per iteration. The codes thus realise a single-touch policy. Among the features facilitated by matrix-free FAS is arbitrary dynamic mesh refinement (AMR) for all solver variants. AMR as enabler for full multigrid (FMG) cycling---the grid unfolds throughout the computation---allows us to reduce the cost per unknown per order of accuracy. The present paper primary contributes towards software realisation and design questions. Our experiments show that the consolidation of single-touch FAS, dynamic AMR and vectorisation-friendly, complex scaled, matrix-free FMG cycles delivers a mature implementation blueprint for solvers for a non-trivial class of problems such as Helmholtz equations. Besides this validation, we put particular emphasis on a strict implementation formalism as well as some implementation correctness proofs.

Recommendations

• Quasi-matrix-free hybrid multigrid on dynamically adaptive Cartesian grids
• A scalable multigrid method for solving indefinite Helmholtz equations with constant wave numbers
• Augmented AMG-shifted Laplacian preconditioners for indefinite Helmholtz problems.
• Iterative solution applied to the Helmholtz equation: complex deflation on unstructured grids
• Multiple Galerkin adaptive algebraic multigrid algorithm for the Helmholtz equations

Cited in

(8)

• Multigrid-augmented deep learning preconditioners for the Helmholtz equation using compact implicit layers
• ExaHyPE: an engine for parallel dynamically adaptive simulations of wave problems
• Nonconforming Mesh Refinement for High-Order Finite Elements
• Multigrid-Augmented Deep Learning Preconditioners for the Helmholtz Equation
• Quasi-matrix-free hybrid multigrid on dynamically adaptive Cartesian grids
• Full waveform inversion guided by travel time tomography
• A diagonal sweeping domain decomposition method with source transfer for the Helmholtz equation
• A hybrid shifted Laplacian multigrid and domain decomposition preconditioner for the elastic Helmholtz equations

Describes a project that uses

Uses Software

• Peano

This page was built for publication: Complex additive geometric multilevel solvers for Helmholtz equations on spacetrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133593)