The Closest Point Method and Multigrid Solvers for Elliptic Equations on Surfaces
Type
ArticleAuthors
Chen, YujiaMacdonald, Colin B.
KAUST Grant Number
KUK-C1-013-04Date
2015-01Permanent link to this record
http://hdl.handle.net/10754/599886
Metadata
Show full item recordAbstract
© 2015 Society for Industrial and Applied Mathematics. Elliptic partial differential equations are important from both application and analysis points of view. In this paper we apply the closest point method to solve elliptic equations on general curved surfaces. Based on the closest point representation of the underlying surface, we formulate an embedding equation for the surface elliptic problem, then discretize it using standard finite differences and interpolation schemes on banded but uniform Cartesian grids. We prove the convergence of the difference scheme for the Poisson's equation on a smooth closed curve. In order to solve the resulting large sparse linear systems, we propose a specific geometric multigrid method in the setting of the closest point method. Convergence studies in both the accuracy of the difference scheme and the speed of the multigrid algorithm show that our approaches are effective.Citation
Chen Y, Macdonald CB (2015) The Closest Point Method and Multigrid Solvers for Elliptic Equations on Surfaces. SIAM Journal on Scientific Computing 37: A134–A155. Available: http://dx.doi.org/10.1137/130929497.Sponsors
This work was supported by award KUK-C1-013-04, made by King Abdullah University of Science and Technology (KAUST).ae974a485f413a2113503eed53cd6c53
10.1137/130929497