Papers
Topics
Authors
Recent
Search
2000 character limit reached

The hphp-FEM applied to the Helmholtz equation with PML truncation does not suffer from the pollution effect

Published 12 Jul 2022 in math.AP, cs.NA, and math.NA | (2207.05542v5)

Abstract: We consider approximation of the variable-coefficient Helmholtz equation in the exterior of a Dirichlet obstacle using perfectly-matched-layer (PML) truncation; it is well known that this approximation is exponentially accurate in the PML width and the scaling angle, and the approximation was recently proved to be exponentially accurate in the wavenumber kk in [Galkowski, Lafontaine, Spence, 2021]. We show that the hphp-FEM applied to this problem does not suffer from the pollution effect, in that there exist $C_1,C_2>0$ such that if hk/pC1hk/p\leq C_1 and pC2logkp \geq C_2 \log k then the Galerkin solutions are quasioptimal (with constant independent of kk), under the following two conditions (i) the solution operator of the original Helmholtz problem is polynomially bounded in kk (which occurs for "most" kk by [Lafontaine, Spence, Wunsch, 2021]), and (ii) either there is no obstacle and the coefficients are smooth or the obstacle is analytic and the coefficients are analytic in a neighbourhood of the obstacle and smooth elsewhere. This hphp-FEM result is obtained via a decomposition of the PML solution into "high-" and "low-frequency" components, analogous to the decomposition for the original Helmholtz solution recently proved in [Galkowski, Lafontaine, Spence, Wunsch, 2022]. The decomposition is obtained using tools from semiclassical analysis (i.e., the PDE techniques specifically designed for studying Helmholtz problems with large kk).

Citations (11)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.