2009
DOI: 10.1002/nla.634
|View full text |Cite
|
Sign up to set email alerts
|

A multigrid‐based shifted Laplacian preconditioner for a fourth‐order Helmholtz discretization

Abstract: Abstract. In this paper, an iterative solution method for a fourth-order accurate discretization of the Helmholtz equation is presented. The method is a generalization of that presented in [10], where multigrid was employed as a preconditioner for a Krylov subspace iterative method. This multigrid preconditioner is based on the solution of a second Helmholtz operator with a complexvalued shift. In particular, we compare preconditioners based on a point-wise Jacobi smoother with those using an ILU(0) smoother, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

1
35
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 44 publications
(36 citation statements)
references
References 37 publications
1
35
0
Order By: Relevance
“…However, our tests show only slight variation (by an iteration or two) over different realizations. For the upwind discretization, these results are qualitatively similar to those seen for the shifted-Laplace preconditioners considered in [7,18,21], where results degrade as xh increases and, for fixed xh, scale like 1/h. However, the h-ellipticity bounds discussed above suggest that better performance is possible, with iteration counts that are independent of h for fixed xh, and only slight dependence on xh, at least in the upwind-discretization case.…”
supporting
confidence: 71%
See 2 more Smart Citations
“…However, our tests show only slight variation (by an iteration or two) over different realizations. For the upwind discretization, these results are qualitatively similar to those seen for the shifted-Laplace preconditioners considered in [7,18,21], where results degrade as xh increases and, for fixed xh, scale like 1/h. However, the h-ellipticity bounds discussed above suggest that better performance is possible, with iteration counts that are independent of h for fixed xh, and only slight dependence on xh, at least in the upwind-discretization case.…”
supporting
confidence: 71%
“…In recent years, there has been a substantial interest in developing fast solvers for the Helmholtz equation [3,4,[6][7][8][9]18,21]. This interest is motivated primarily by geophysical applications [13], although it also serves as an important model problem for many fields where fully indefinite partial differential equations arise.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…One of the advantages of the shifted Laplacian preconditioner is that it can be applied when the wavenumber k is variable (i.e., the medium being modelled is inhomogeneous) as was done, for example, in [15,42], and [54] (with the last paper considering the higher-order case). In the present paper, however, all the theory is for constant k (although Example 5.5 contains an experiment where k is variable).…”
Section: Introductionmentioning
confidence: 99%
“…In particular, G. Wittum [36] was the first to rigorously prove the robustness of this smoother for an anisotropic model problem, and R. Stevenson [23] generalized the results in [36]. More recently, in [27], a fast preconditioner solver based on multigrid with an ILU smoother was proposed for solving heterogeneous high-wavenumber Helmholtz problems, and in [21], a new relaxation methodology based on a truncated ILU smoother is presented for multigrid preconditioning of discrete convection-diffusion problems.…”
Section: Introductionmentioning
confidence: 96%