Numerically stable computation of embedding formulae for scattering by polygons
Andrew Gibbs, Stephen Langdon, and Andrea Moiola

TL;DR
This paper develops a numerically stable method for computing embedding formulae in scattering problems involving polygons, improving accuracy and stability in practical implementations for various incident waves.
Contribution
It introduces a novel approach to identify and control numerical instabilities in embedding formulae for polygon scattering, extending to Herglotz wave functions and T-matrix methods.
Findings
Enhanced numerical stability in embedding formula computations
Extension to Herglotz wave functions
Potential removal of frequency dependence in T-matrix methods
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMicrowave Imaging and Scattering Analysis · Numerical methods in inverse problems · Electromagnetic Simulation and Numerical Methods
