The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2020
DOI: 10.1137/18m1192093
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Convergence Using Two-Level Deflation Preconditioning for the Helmholtz Equation

Abstract: Recent research efforts aimed at iteratively solving the Helmholtz equation have focused on incorporating deflation techniques for accelerating the convergence of Krylov subpsace methods. The requisite for these efforts lies in the fact that the widely used and well-acknowledged complex shifted Laplacian preconditioner (CSLP) shifts the eigenvalues of the preconditioned system towards the origin as the wave number increases. The two-level-deflation preconditioner combined with CSLP showed encouraging results i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(18 citation statements)
references
References 60 publications
0
17
0
Order By: Relevance
“…While this improves the convergence significantly, the near-zero eigenvalues start reappearing for very large wave numbers . Consequently, it has been shown recently that the use of a quadratic interpolation scheme results in close to wave number independent convergence for the two-level deflation preconditioner 33 . In fact, the use of these higherorder deflation vectors results in a smaller projection error compared to the case where a linear interpolation schemes is used.…”
Section: Preconditioned Krylov Subspace Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…While this improves the convergence significantly, the near-zero eigenvalues start reappearing for very large wave numbers . Consequently, it has been shown recently that the use of a quadratic interpolation scheme results in close to wave number independent convergence for the two-level deflation preconditioner 33 . In fact, the use of these higherorder deflation vectors results in a smaller projection error compared to the case where a linear interpolation schemes is used.…”
Section: Preconditioned Krylov Subspace Methodsmentioning
confidence: 99%
“…As a consequence, recent developments have led to a broad range of preconditioners such as domain decomposition based preconditioners 19,20,21,22,23,24,25 , sweeping preconditioners 26,27,28,29,30 and (multilevel) deflation based preconditioners 31,32,33 . One of these new preconditioners is the Adapted Deflation Preconditioner (ADP), which uses higher-order Bezier curves to construct the deflation space.…”
Section: Introductionmentioning
confidence: 99%
“…An interesting observation is that increasing ppwl leads to a higher iteration count. The opposite effect has been observed when using a two-level deflation preconditioner [7,4]. There, a finer mesh leads to a smaller number of iterations as the mapping of the eigenvectors from the fine-and coarse-grid becomes more accurate.…”
Section: Direct Subdomain Solvesmentioning
confidence: 96%
“…The choice of strongly dictates the overall convergence behaviour. Here, we use quadratic rational Bézier curves, as they have been shown to provide satisfactory convergence [4]. Consequently, if we let ˜ represent the -th degree of freedom (DOF) on subdomain Ω , then in 1D maps these nodal approximations onto their coarse-grid counterpart as follows…”
Section: Model Problem Discretisation and Preconditioning Strategiesmentioning
confidence: 99%
See 1 more Smart Citation