A Fast Cartesian Grid-Based Integral Equation Method for Unbounded Interface Problems with Non-Homogeneous Source Terms
Year: 2023
Author: Jiahe Yang, Wenjun Ying
Communications in Computational Physics, Vol. 34 (2023), Iss. 1 : pp. 208–234
Abstract
This work presents a fast Cartesian grid-based integral equation method for unbounded interface problems with non-homogeneous source terms. The unbounded interface problem is solved with boundary integral equation methods such that infinite boundary conditions are satisfied naturally. This work overcomes two difficulties. The first difficulty is the evaluation of singular integrals. Boundary and volume integrals are transformed into equivalent but much simpler bounded interface problems on rectangular domains, which are solved with FFT-based finite difference solvers. The second one is the expensive computational cost for volume integrals. Despite the use of efficient interface problem solvers, the evaluation for volume integrals is still expensive due to the evaluation of boundary conditions for the simple interface problem. The problem is alleviated by introducing an auxiliary circle as a bridge to indirectly evaluate boundary conditions. Since solving boundary integral equations on a circular boundary is so accurate, one only needs to select a fixed number of points for the discretization of the circle to reduce the computational cost. Numerical examples are presented to demonstrate the efficiency and the second-order accuracy of the proposed numerical method.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/cicp.OA-2023-0050
Communications in Computational Physics, Vol. 34 (2023), Iss. 1 : pp. 208–234
Published online: 2023-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 27
Keywords: Interface problem unbounded domain boundary integral equation kernel-free method auxiliary circle Cartesian grid method fast algorithm.