Domain decomposition for the closest point method

DOI10.1007/978-3-030-56750-7_53MaRDI QIDQ2100389zbMATH OpenOpenAlexFDO

Authors Ian May, Ronald D. Haynes, Steven J. Ruuth

Publication date 21 November 2022

Full work available at URL https://arxiv.org/abs/1907.13606

domain decomposition parallel computing closest point method

Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) PDEs on manifolds (35R01) Finite difference methods for boundary value problems involving PDEs (65N06)

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

l e f t (c - D e l t a_{m} a t h c a l S i g h t) u = f

, where

c i n m a t h b b R^{+}

is a constant and

D e l t a_{m} a t h c a l S

is the Laplace-Beltrami operator associated with the surface

m a t h c a l S s u b s e t m a t h b b 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.

Cited in

(3)

This page was built for publication: Domain decomposition for the closest point method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2100389)