Ying Wenjun, Henriquez Craig S
Departments of Mathematics and Biomedical Engineering, Duke University, Durham, NC 27708-0281, USA.
J Comput Phys. 2007 Dec 10;227(2):1046-1074. doi: 10.1016/j.jcp.2007.08.021. Epub 2007 Sep 5.
This paper presents a class of kernel-free boundary integral (KFBI) methods for general elliptic boundary value problems (BVPs). The boundary integral equations reformulated from the BVPs are solved iteratively with the GMRES method. During the iteration, the boundary and volume integrals involving Green's functions are approximated by structured grid-based numerical solutions, which avoids the need to know the analytical expressions of Green's functions. The KFBI method assumes that the larger regular domain, which embeds the original complex domain, can be easily partitioned into a hierarchy of structured grids so that fast elliptic solvers such as the fast Fourier transform (FFT) based Poisson/Helmholtz solvers or those based on geometric multigrid iterations are applicable. The structured grid-based solutions are obtained with standard finite difference method (FDM) or finite element method (FEM), where the right hand side of the resulting linear system is appropriately modified at irregular grid nodes to recover the formal accuracy of the underlying numerical scheme. Numerical results demonstrating the efficiency and accuracy of the KFBI methods are presented. It is observed that the number of GM-RES iterations used by the method for solving isotropic and moderately anisotropic BVPs is independent of the sizes of the grids that are employed to approximate the boundary and volume integrals. With the standard second-order FEMs and FDMs, the KFBI method shows a second-order convergence rate in accuracy for all of the tested Dirichlet/Neumann BVPs when the anisotropy of the diffusion tensor is not too strong.
本文针对一般椭圆型边值问题(BVP)提出了一类无核边界积分(KFBI)方法。由BVP重新表述得到的边界积分方程采用广义最小残差法(GMRES)进行迭代求解。在迭代过程中,涉及格林函数的边界积分和体积积分通过基于结构化网格的数值解进行近似,这避免了需要知道格林函数的解析表达式。KFBI方法假定,嵌入原始复杂区域的较大规则区域能够容易地划分为结构化网格层次,从而使得诸如基于快速傅里叶变换(FFT)的泊松/亥姆霍兹求解器或基于几何多重网格迭代的快速椭圆求解器适用。基于结构化网格的解通过标准有限差分法(FDM)或有限元法(FEM)获得,其中在不规则网格节点处对所得线性系统的右侧进行适当修改,以恢复基础数值格式的形式精度。给出了证明KFBI方法效率和准确性的数值结果。可以观察到,该方法用于求解各向同性和中等各向异性BVP时,GMRES迭代次数与用于近似边界积分和体积积分的网格大小无关。对于所有测试的狄利克雷/诺伊曼BVP,当扩散张量的各向异性不太强时,采用标准二阶有限元法和有限差分法,KFBI方法在精度上显示出二阶收敛速率。