Domain decomposition for the closest point method
Domain Decomposition Methods in Science and Engineering XXV 25, 2020•Springer
Domain Decomposition for the Closest Point Method Page 1 Domain Decomposition for the
Closest Point Method Ian May, Ronald D. Haynes, and Steven J. Ruuth 1 Introduction 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) [19 …
Closest Point Method Ian May, Ronald D. Haynes, and Steven J. Ruuth 1 Introduction 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) [19 …
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 away that allows for parallel computing.
Springer