NANAMay 23, 2018

Numerically stable computation of embedding formulae for scattering by polygons

arXiv:1805.089882 citationsh-index: 20
Originality Incremental advance
AI Analysis

For researchers in computational wave scattering, this work provides a practical solution to numerical stability issues in embedding formulae, though it is incremental in nature.

The paper addresses numerical instabilities in embedding formulae for scattering by polygons, presenting an approach to identify and regulate these instabilities, and extends the method to Herglotz wave functions to potentially remove frequency dependence in T-matrix methods.

For problems of time-harmonic scattering by polygonal obstacles, embedding formulae provide a useful means of computing the far-field coefficient induced by any incident plane wave, given the far-field coefficient of a relatively small set of canonical problems. The number of such problems to be solved depends only on the geometry of the scatterer. Whilst the formulae themselves are exact in theory, any implementation will inherit numerical error from the method used to solve the canonical problems. This error can lead to numerical instabilities. Here, we present an effective approach to identify and regulate these instabilities. This approach is subsequently extended to the case where the incident wave is a Herglotz wave function, and we suggest how this could potentially remove frequency dependence of a T-matrix method.

Foundations

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

Your Notes