TL;DR
This paper introduces a novel approach to approximate the Dirichlet-to-Neumann map for unbounded domain wave equations by learning matrix entries through optimization, leading to more efficient and flexible solutions than traditional methods.
Contribution
The paper proposes a data-driven method to learn sparse matrix approximations of the DtN map, improving efficiency and flexibility over existing analytical approaches.
Findings
Learned infinite elements outperform traditional methods for Helmholtz equation.
Approximation quality improves exponentially with more degrees of freedom.
Method effectively handles complex, inhomogeneous exterior domains.
Abstract
We study the numerical solution of scalar time-harmonic wave equations on unbounded domains which can be split into a bounded interior domain of primary interest and an exterior domain with separable geometry. To compute the solution in the interior domain, approximations to the Dirichlet-to-Neumann (DtN) map of the exterior domain have to be imposed as transparent boundary conditions on the artificial coupling boundary. Although the DtN map can be computed by separation of variables, it is a nonlocal operator with dense matrix representations, and hence computationally inefficient. Therefore, approximations of DtN maps by sparse matrices, usually involving additional degrees of freedom, have been studied intensively in the literature using a variety of approaches including different types of infinite elements, local non-reflecting boundary conditions, and perfectly matched layers. The…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
