NANAMar 7, 2019

Variable Order, Directional H2-Matrices for Helmholtz Problems with Complex Frequency

arXiv:1903.028038 citationsh-index: 34
Originality Incremental advance
AI Analysis

For researchers working on sparse approximation of high-frequency Helmholtz-type integral operators in wave propagation and scattering, this work extends existing methods to complex frequencies with explicit error bounds and complexity analysis.

The paper generalizes directional H2-matrix techniques for Helmholtz operators from purely imaginary to complex frequencies, developing a new admissibility condition and frequency-dependent directional expansion functions. It provides explicit error and complexity analysis, showing that higher real parts of the frequency reduce complexity, and in some cases the discrete matrix can be replaced by its nearfield part.

The sparse approximation of high-frequency Helmholtz-type integral operators has many important physical applications such as problems in wave propagation and wave scattering. The discrete system matrices are huge and densely populated; hence their sparse approximation is of outstanding importance. In our paper we will generalize the directional $\mathcal{H}^{2}$-matrix techniques from the \textquotedblleft pure\textquotedblright\ Helmholtz operator $\mathcal{L}u=-Δu+ζ^{2}u$ with $ζ=-\operatorname*{i}k$, $k\in\mathbb{R}$, to general complex frequencies $ζ\in\mathbb{C}$ with $\operatorname{Re}ζ>0$. In this case, the fundamental solution decreases exponentially for large arguments. We will develop a new admissibility condition which contains $\operatorname{Re}ζ$ in an explicit way and introduce the approximation of the integral kernel function on admissible blocks in terms of frequency-dependent \textit{directional expansion functions}. We develop an error analysis which is explicit with respect to the expansion order and with respect to $\operatorname{Re}ζ$ and $\operatorname{Im}ζ$. This allows to choose the \textit{variable }expansion order in a quasi-optimal way depending on $\operatorname{Re}ζ$ but independent of, possibly large, $\operatorname{Im}ζ$. The complexity analysis is explicit with respect to $\operatorname{Re}ζ$ and $\operatorname{Im}ζ$ and shows how higher values of $\operatorname{Re}% ζ$ reduce the complexity. In certain cases, it even turns out that the discrete matrix can be replaced by its nearfield part. Numerical experiments illustrate the sharpness of the derived estimates and the efficiency of our sparse approximation.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes