Mathematics > Numerical Analysis
[Submitted on 10 Jun 2018 (v1), last revised 19 May 2020 (this version, v4)]
Title:Domain Decomposition with local impedance conditions for the Helmholtz equation with absorption
View PDFAbstract:We consider one-level additive Schwarz preconditioners for a family of Helmholtz problems with absorption and increasing wavenumber $k$. These problems are discretized using the Galerkin method with nodal conforming finite elements of any (fixed) order on meshes with diameter $h = h(k)$, chosen to maintain accuracy as $k$ increases. The action of the preconditioner requires solution of independent (parallel) subproblems (with impedance boundary conditions) on overlapping subdomains of diameter $H$ and overlap $\delta\leq H$. The solutions of these subproblems are linked together using prolongation/restriction operators defined using a partition of unity. In numerical experiments (with $\delta \sim H$) for a model interior impedance problem, we observe robust (i.e. $k-$independent) GMRES convergence as $k$ increases. This provides a highly-parallel, $k-$robust one-level domain decomposition method. We provide supporting theory by studying the preconditioner applied to a range of absorptive problems, $k^2\mapsto k^2+ \mathrm{i} \varepsilon$, with absorption parameter $\varepsilon$. Working in the Helmholtz ``energy'' inner product, and using the underlying theory of Helmholtz boundary-value problems, we prove a $k-$independent upper bound on the norm of the preconditioned matrix, valid for all $\vert \varepsilon\vert \lesssim k^2$. We also prove a strictly-positive lower bound on the distance of the field of values of the preconditioned matrix from the origin which holds when $\varepsilon/k$ is constant or growing arbitrarily slowly with $k$. These results imply robustness of the preconditioner for the corresponding absorptive problem as k increases and give theoretical support for the observed robustness of the preconditioner for the pure Helmholtz problem.
Submission history
From: Ivan Graham [view email][v1] Sun, 10 Jun 2018 21:48:56 UTC (77 KB)
[v2] Tue, 12 Jun 2018 07:02:49 UTC (77 KB)
[v3] Wed, 3 Jul 2019 17:23:53 UTC (58 KB)
[v4] Tue, 19 May 2020 12:24:00 UTC (116 KB)
Current browse context:
math.NA
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.