2017
DOI: 10.1007/978-3-319-28832-1_1
|View full text |Cite
|
Sign up to set email alerts
|

Recent Results on Domain Decomposition Preconditioning for the High-Frequency Helmholtz Equation Using Absorption

Abstract: In this paper we present an overview of recent progress on the development and analysis of domain decomposition preconditioners for discretised Helmholtz problems, where the preconditioner is constructed from the corresponding problem with added absorption. Our preconditioners incorporate local subproblems that can have various boundary conditions, and include the possibility of a global coarse mesh. While the rigorous analysis describes preconditioners for the Helmholtz problem with added absorption, this the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
37
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 27 publications
(37 citation statements)
references
References 30 publications
0
37
0
Order By: Relevance
“…There is considerable current interest in linear algebra problems arising from the discretization of heterogeneous wave problems (e.g. [20], [27]). The stability theory of the underlying PDE turned out to be key to rigorously understanding the performance of iterative methods in the homogeneous case (e.g.…”
Section: 2mentioning
confidence: 99%
“…There is considerable current interest in linear algebra problems arising from the discretization of heterogeneous wave problems (e.g. [20], [27]). The stability theory of the underlying PDE turned out to be key to rigorously understanding the performance of iterative methods in the homogeneous case (e.g.…”
Section: 2mentioning
confidence: 99%
“…One advantage of DD over multigrid in this context is that "wave-based" components such as impedance or PML boundary conditions on the subdomains can more-easily be incorporated into DD preconditioners (see §1.5 below). The numerical experiments in [41] and [42] (following earlier experiments in [52] and [53]) show that additive Schwarz DD preconditioners for A can perform well for k ξ k 2 if impedance boundary conditions are used on the subdomain problems, instead of Dirichlet ones, and these experiments are backed up by analysis in [43] that shows that Property (ii) can be satisfied in some situations with |ξ| ∼ k 1+β for β small. 1.4.…”
Section: 2mentioning
confidence: 87%
“…Let D j ∈ R nj ×nj be a diagonal matrix corresponding to a partition of unity in the sense that N sub i=1R T i R i = I, whereR j := D j R j . Then the one-level ORAS preconditioner (which is also the one-level ImpRAS of Graham et al [2017b]) reads…”
Section: Two-level Domain Decomposition Preconditionersmentioning
confidence: 99%
“…where * denotes the conjugate transpose, M −1 1,ε is the one-level preconditioner (3), Z is a rectangular matrix with full column rank, E = Z * A ε Z is the so-called coarse grid matrix, Ξ = ZE −1 Z * is the so-called coarse grid correction matrix. If P = Q = I this is an additive two-level preconditioner (which would be called two-level ImpRAS in Graham et al [2017b]). If P = I − A ε Ξ and Q = I − ΞA ε , this is a hybrid two-level preconditioner (ImpHRAS in Graham et al [2017b]), also called the Balancing Neumann Neumann (BNN) preconditioner.…”
Section: Two-level Domain Decomposition Preconditionersmentioning
confidence: 99%