Domain Decomposition for the Closest Point Method

07/31/2019
by   Ian May, et al.
0

The discretization of elliptic PDEs leads to large coupled systems of equations. Domain decomposition methods (DDMs) are one approach to the solution of these systems, and can split the problem in a way that allows for parallel computing. Herein, we extend two DDMs to elliptic PDEs posed intrinsic to surfaces as discretized by the Closest Point Method (CPM) SJR:CPM,CBM:ICPM. We consider the positive Helmholtz equation (c-Δ_S)u = f, where c∈R^+ is a constant and Δ_S is the Laplace-Beltrami operator associated with the surface S⊂R^d. The evolution of diffusion equations by implicit time-stepping schemes and Laplace-Beltrami eigenvalue problems CBM:Eig both give rise to equations of this form. The creation of efficient, parallel, solvers for this equation would ease the investigation of reaction-diffusion equations on surfaces CBM:RDonPC, and speed up shape classification Reuter:ShapeDNA, to name a couple applications.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset