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 entries of these sparse matrices are derived analytically, e.g. from transformations or asymptotic expansions of solutions to the differential equation in the exterior domain. In contrast, in this paper we propose to `learn' the matrix entries from the DtN map in its separated form by solving an optimization problem as a preprocessing step. Theoretical considerations suggest that the approximation quality of learned infinite elements improves exponentially with increasing number of infinite element degrees of freedom, which is confirmed in numerical experiments. These numerical studies also show that learned infinite elements outperform state-of-the-art methods for the Helmholtz equation. At the same time, learned infinite elements are much more flexible than traditional methods as they, e.g., work similarly well for exterior domains involving strong reflections, for example, for the atmosphere of the Sun, which is strongly inhomogeneous and exhibits reflections at the corona.
翻译:我们研究在无约束域上的卡路里时间调和波波方程式的数值解决方案,这些方程式可以分割成一个主要兴趣的封闭的内部域和外部域,并带有可分离的几何。为了在内部域计算解决方案,外部域图近似Drichlet-to-Neumann(DtN)地图必须作为人工联结边界的透明边界条件强加于人。虽然DtN地图可以通过变量的分解来计算,但它是一个非本地的操作器,其矩阵显示密度很大,因此计算效率很低。因此,在文献中大量研究DtN地图以稀释基质(通常涉及更多程度的自由)接近DtN的内域。在文献中采用多种方法,包括不同种类的无限元素、当地非反射边界条件和完全匹配的层。这些稀释矩阵的条目是从分析角度,例如变异或对外部域差异方程式的扩展。相比之下,我们建议用“精细的矩阵矩阵”以稀释式矩阵矩阵矩阵的近似值输入,通常包含更多自由度自由度元素的近似度,在模型的模型分析中显示模型的模型的模型的模型的演化过程,其演化过程的演化过程的演化过程的演化过程,其演化过程的演化过程的演化过程的演化过程的演化过程的演化过程,其演化过程的演化过程的演化过程的演化过程。