A two-grid method with dispersion matching for finite-element Helmholtz problems

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Stolk, Christiaan C.
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914050531655680
author Stolk, Christiaan C.
author_facet Stolk, Christiaan C.
contents This work is about a new two-level solver for Helmholtz equations discretized by finite elements. The method is inspired by two-grid methods for finite-difference Helmholtz problems as well as by previous work on two-level domain-decomposition methods. For the coarse-level discretization, a compact-stencil finite-difference method is used that minimizes dispersion errors. The smoother involves a domain-decomposition solver applied to a complex-shifted Helmholtz operator. Local Fourier analysis shows the method is convergent if the number of degrees of freedom per wavelength is larger than some lower bound that depends on the order, e.g. more than 8 for order 4. In numerical tests, with problem sizes up to 80 wavelengths, convergence was fast, and almost independent of problem size unlike what is observed for conventional methods. Analysis and comparison with dispersion-error data shows that, for good convergence of a two-grid method for Helmholtz problems, it is essential that fine- and coarse-level dispersion relations closely match.
format Preprint
id arxiv_https___arxiv_org_abs_2509_17494
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A two-grid method with dispersion matching for finite-element Helmholtz problems
Stolk, Christiaan C.
Numerical Analysis
65N55, 65N30
This work is about a new two-level solver for Helmholtz equations discretized by finite elements. The method is inspired by two-grid methods for finite-difference Helmholtz problems as well as by previous work on two-level domain-decomposition methods. For the coarse-level discretization, a compact-stencil finite-difference method is used that minimizes dispersion errors. The smoother involves a domain-decomposition solver applied to a complex-shifted Helmholtz operator. Local Fourier analysis shows the method is convergent if the number of degrees of freedom per wavelength is larger than some lower bound that depends on the order, e.g. more than 8 for order 4. In numerical tests, with problem sizes up to 80 wavelengths, convergence was fast, and almost independent of problem size unlike what is observed for conventional methods. Analysis and comparison with dispersion-error data shows that, for good convergence of a two-grid method for Helmholtz problems, it is essential that fine- and coarse-level dispersion relations closely match.
title A two-grid method with dispersion matching for finite-element Helmholtz problems
topic Numerical Analysis
65N55, 65N30
url https://arxiv.org/abs/2509.17494