arXiv subjects
Publications and source records attributed to Martin Averseng.
For a wide class of Helmholtz scattering problems (namely, those fitting in the black-box framework of Sj\"ostrand--Zworski) we prove that the error incurred by approximating the radiation condition by a Cartesian perfectly-matched layer (PML) decreases exponentially in the width of the PML, the strength of the PML scaling, and the frequency.
We consider a non-self adjoint operator of the form $-h^2 \Delta + i(V(x) + \alpha(x)y)$ on the upper half plane $y > 0$ with Dirichlet boundary conditions on $\{y = 0\}$ with $V \geq 0$, $V$ admitting a non-degenerate minimum at $x = 0$ and $\alpha'(0) = 0$. We study its eigenfunctions associated to the smallest eigenvalues in magnitude in the semiclassical limit $h \to 0$. Elementary variational estimates show that these eigenfunctions are localized near the point $(0,0)$ at the scales $O(h^{1/3})$ in $x$ and $O(h^{2/3})$ in $y$. In this paper, we show that the $O(h^{1/3})$ localization in $x$ is not optimal; more precisely, we establish that the eigenfunctions are concentrated in a neighborhood of size $O(h^{1/2})$ of the axis $\{x = 0\}$, and this scale is shown to be sharp. The proof relies on the symbolic calculus of operator-valued pseudodifferential operators.
We consider the non-selfadjoint, semiclassical Schr\"odinger operator $\mathscr{L}(h) := -h^2\partial_x^2+e^{i\alpha}V$, where $\alpha \in (-\pi,\pi)$ and $V: \mathbb{R}\to \mathbb{R}_+$ is even and vanishes at exactly two (symmetric) non-degenerate minima. We establish a semiclassical tunneling result: the spectrum of $\mathscr{L}(h)$ near the origin is given by a sequence of algebraically simple eigenvalues which come in exponentially close pairs (within a $\mathscr{O}(e^{-S/h})$ distance where $S > 0$ is explicit), each pair being separated from the others by a distance $\mathscr{O}(h)$. A one-term estimate of the gap between the two smallest eigenvalues in magnitude is derived; it reveals that, when $\alpha \neq 0$, they quickly rotate around each other as $h$ goes to $0$.
The $h$-version of the finite-element method ($h$-FEM) applied to the high-frequency Helmholtz equation has been a classic topic in numerical analysis since the 1990s. It is now rigorously understood that (using piecewise polynomials of degree $p$ on a mesh of a maximal width $h$) the conditions "$(hk)^p \rho$ sufficiently small" and "$(hk)^{2p} \rho$ sufficiently small" guarantee, respectively, $k$-uniform quasioptimality (QO) and bounded relative error (BRE), where $\rho$ is the norm of the solution operator with $\rho\sim k$ for non-trapping problems. Empirically, these conditions are observed to be optimal in the context of $h$-FEM with a uniform mesh. This paper demonstrates that QO and BRE can be achieved using certain non-uniform meshes that violate the conditions above on $h$ and involve coarser meshes away from trapping and in the perfectly matched layer (PML). The main theorem details how varying the meshwidth in one region affects errors both in that region and elsewhere. One notable consequence is that, for any scattering problem (trapping or nontrapping), in the PML one only needs $hk$ to be sufficiently small; i.e. there is no pollution in the PML. The motivating idea for the analysis is that the Helmholtz data-to-solution map behaves differently depending on the locations of both the measurement and data, in particular, on the properties of billiards trajectories (i.e. rays) through these sets. Because of this, it is natural that the approximation requirements for finite-element spaces in a subset should depend on the properties of billiard rays through that set. Inserting this behaviour into the latest duality arguments for the FEM applied to the high-frequency Helmholtz equation allows us to retain detailed information about the influence of $\textit{both}$ the mesh structure $\textit{and}$ the behaviour of the true solution on local errors in FEM.
We present a preconditioning method for the linear systems arising from the boundary element discretization of the Laplace hypersingular equation on a $2$-dimensional triangulated surface $\Gamma$ in $\mathbb{R}^3$. We allow $\Gamma$ to belong to a large class of geometries that we call polygonal multiscreens, which can be non-manifold. After introducing a new, simple conforming Galerkin discretization, we analyze a substructuring domain-decomposition preconditioner based on ideas originally developed for the Finite Element Method. The surface $\Gamma$ is subdivided into non-overlapping regions, and the application of the preconditioner is obtained via the solution of the hypersingular equation on each patch, plus a coarse subspace correction. We prove that the condition number of the preconditioned linear system grows poly-logarithmically with $H/h$, the ratio of the coarse mesh and fine mesh size, and our numerical results indicate that this bound is sharp. This domain-decomposition algorithm therefore guarantees significant speedups for iterative solvers, even when a large number of subdomains is used.
For $h$-FEM discretisations of the Helmholtz equation with wavenumber $k$, we obtain $k$-explicit analogues of the classic local FEM error bounds of [Nitsche, Schatz 1974], [Wahlbin 1991], [Demlow, Guzm\'an, Schatz 2011], showing that these bounds hold with constants independent of $k$, provided one works in Sobolev norms weighted with $k$ in the natural way. We prove two main results: (i) a bound on the local $H^1$ error by the best approximation error plus the $L^2$ error, both on a slightly larger set, and (ii) the bound in (i) but now with the $L^2$ error replaced by the error in a negative Sobolev norm. The result (i) is valid for shape-regular triangulations, and is the $k$-explicit analogue of the main result of [Demlow, Guzm\'an, Schatz, 2011]. The result (ii) is valid when the mesh is locally quasi-uniform on the scale of the wavelength (i.e., on the scale of $k^{-1}$) and is the $k$-explicit analogue of the results of [Nitsche, Schatz 1974], [Wahlbin 1991]. Since our Sobolev spaces are weighted with $k$ in the natural way, the result (ii) indicates that the Helmholtz FEM solution is locally quasi-optimal modulo low frequencies (i.e., frequencies $\lesssim k$). Numerical experiments confirm this property, and also highlight interesting propagation phenomena in the Helmholtz FEM error.
This work introduces ``generalized meshes", a type of meshes suited for the discretization of partial differential equations in non-regular geometries. Generalized meshes extend regular simplicial meshes by allowing for overlapping elements and more flexible adjacency relations. They can have several distinct ``generalized" vertices (or edges, faces) that occupy the same geometric position. These generalized facets are the natural degrees of freedom for classical conforming spaces of discrete differential forms appearing in finite and boundary element applications. Special attention is devoted to the representation of fractured domains and their boundaries. An algorithm is proposed to construct the so-called {\em virtually inflated mesh}, which correspond to a ``two-sided" mesh of a fracture. Discrete $d$-differential forms on the virtually inflated mesh are characterized as the trace space of discrete $d$-differential forms in the surrounding volume.
We construct a piecewise-polynomial interpolant $u \mapsto \Pi u$ for functions $u:\Omega \setminus \Gamma \to \mathbb{R}$, where $\Omega \subset \mathbb{R}^d$ is a Lipschitz polyhedron and $\Gamma \subset \Omega$ is a possibly non-manifold $(d-1)$-dimensional hypersurface. This interpolant enjoys approximation properties in relevant Sobolev norms, as well as a set of additional algebraic properties, namely, $\Pi^2 = \Pi$, and $\Pi$ preserves homogeneous boundary values and jumps of its argument on $\Gamma$. As an application, we obtain a bounded discrete right-inverse of the "jump" operator across $\Gamma$, and an error estimate for a Galerkin scheme to solve a second-order elliptic PDE in $\Omega$ with a prescribed jump across $\Gamma$.
The Helmholtz wave scattering problem by screens in 2D can be recast into first-kind integral equations which lead to ill-conditioned linear systems after discretization. We introduce two new preconditioners, in the form of square-roots of local operators respectively for the corresponding problems with Dirichlet and Neumann conditions on the arc. They generalize the so-called "analytical" preconditioners available for Lipschitz scatterers. We introduce a functional setting adapted to the singularity of the problem and enabling the analysis of those preconditioners. The efficiency of the method is demonstrated on several numerical examples.
We introduce two new classes of pseudo-differential operators on open curves. They correspond via a change of variables to subclasses of the periodic pseudo-differential operators, which respectively stabilize even and odd functions. The resulting symbolic calculus can be applied to the analysis of the Helmholtz weighted layer potentials on open curves. In particular, we build some low order parametrices of the layer potentials which take the form of square roots of tangential operators. This gives some foundation for the construction of efficient preconditioners for the Helmholtz scattering problem by a screen in 2D.
We describe an efficient algorithm for computing the matrix vector products that appear in the numerical resolution of boundary integral equations in 2 space dimension. This work is an extension of the so-called Sparse Cardinal Sine Decomposition algorithm by Alouges et al., which is restricted to three-dimensional setups. Although the approach is similar, significant differences appear throughout the analysis of the method. Bessel decomposition, in particular, yield longer series for the same accuracy. We propose a careful study of the method that leads to a precise estimation of the complexity in terms of the number of points and chosen accuracy. We also provide numerical tests to demonstrate the efficiency of this approach. We give the compression performance for a $N \times N$ linear system for several values $N$ up to $10^7$ and report the computation time for the off-line and on-line parts of our algorithm. We also include a toy application to sound canceling to further illustrate the efficiency of our method.