FFT-accelerated computation of the Dirichlet-to-Neumann map for inhomogeneous exterior Helmholtz problems using the method of fundamental solutions
math.NA, cs.NA
Submitted: 2026-03-16
Updated: 2026-10-12
Comments: 36 pages, 21 figures. Accepted for publication in Mathematics and Computers in Simulation
Journal ref: Mathematics and Computers in Simulation, 252 (2027) pp. 1141-1162
DOI: 10.1016/j.matcom.2026.10.013
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: An efficient numerical method is proposed for computing the Dirichlet-to-Neumann (DtN) map associated with the exterior Dirichlet problem for the two-dimensional Helmholtz equation with an…
Terminology
Abstract
An efficient numerical method is proposed for computing the Dirichlet-to-Neumann (DtN) map associated with the exterior Dirichlet problem for the two-dimensional Helmholtz equation with an inhomogeneous term. The solution in the subdomain exterior to a circular artificial boundary is approximated by the method of fundamental solutions (MFS). When the source and collocation points are equally spaced on concentric circles, the coefficient matrices arising in the discretization become circulant, which enables the efficient evaluation of the discrete DtN map by the fast Fourier transform (FFT). By incorporating the transparent boundary condition (TBC) defined by the DtN map into a finite element formulation, the original exterior problem posed in an unbounded domain is reduced to an equivalent problem in a bounded computational domain, which can then be solved by the finite element method (FEM). Numerical examples show that the proposed MFS-based approach provides a highly accurate approximation of the DtN map, that the FFT-based algorithm enables the efficient computation of the resulting discrete DtN map, and that the FEM incorporating the TBC defined by the DtN map yields accurate solutions for exterior Helmholtz problems posed in unbounded domains with an inhomogeneous term.
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers