A Generalized Finite Difference Method for Solving Elliptic Interface Problems
In this article a generalized finite difference method (GFDM), which is a meshless method based on Taylor series expansions and weighted moving least squares, is proposed to solve the elliptic interface problem. This method turns the original elliptic interface problem to be two coupled elliptic non-interface subproblems. The solutions are found by solving coupled elliptic subproblems with sparse coefficient matrix, which significantly improves the efficiency for the interface problem, especially for the complex geometric interface. Furthermore, based on the key idea of GFDM which can approximate the derivatives of unknown variables by linear summation of nearby nodal values, we further develop the GFDM to deal with the elliptic problem with the jump interface condition which is related to the derivative of solution on the interface boundary. Four numerical examples are provided to illustrate the features of the proposed method, including the acceptable accuracy and the efficiency.
Y. Xing et al., "A Generalized Finite Difference Method for Solving Elliptic Interface Problems," Mathematics and Computers in Simulation, vol. 178, pp. 109-124, Elsevier, Dec 2020.
The definitive version is available at https://doi.org/10.1016/j.matcom.2020.06.006
Mathematics and Statistics
Center for High Performance Computing Research
Keywords and Phrases
Elliptic interface problems; Generalized finite difference method; Meshless method
International Standard Serial Number (ISSN)
Article - Journal
© 2021 Elsevier, All rights reserved.
01 Dec 2020