English

Domain Decomposition for the Closest Point Method

Numerical Analysis 2019-08-01 v1 Numerical Analysis

Abstract

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) \cite{SJR:CPM,CBM:ICPM}. We consider the positive Helmholtz equation (cΔS)u=f\left(c-\Delta_\mathcal{S}\right)u = f, where cR+c\in\mathbb{R}^+ is a constant and ΔS\Delta_\mathcal{S} is the Laplace-Beltrami operator associated with the surface SRd\mathcal{S}\subset\mathbb{R}^d. The evolution of diffusion equations by implicit time-stepping schemes and Laplace-Beltrami eigenvalue problems \cite{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 \cite{CBM:RDonPC}, and speed up shape classification \cite{Reuter:ShapeDNA}, to name a couple applications.

Keywords

Cite

@article{arxiv.1907.13606,
  title  = {Domain Decomposition for the Closest Point Method},
  author = {Ian May and Ronald D. Haynes and Steven J. Ruuth},
  journal= {arXiv preprint arXiv:1907.13606},
  year   = {2019}
}

Comments

To appear in the proceedings of the 25th Domain Decomposition meeting in Saint John's Newfoundland

R2 v1 2026-06-23T10:36:24.495Z