Martin Averseng

h-index1
2papers
7citations

2 Papers

8.5NAMay 22
Non-uniform finite-element meshes defined by ray dynamics for Helmholtz problems

Martin Averseng, Jeffrey Galkowski, Euan A. Spence

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 ρ$ sufficiently small" and "$(hk)^{2p} ρ$ sufficiently small" guarantee, respectively, $k$-uniform quasioptimality (QO) and bounded relative error (BRE), where $ρ$ is the norm of the solution operator with $ρ\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.

1.2NANov 21, 2017
Fast discrete convolution in $\mathbb{R}^2$ using Sparse Bessel Decomposition

Martin Averseng

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.