pith. sign in

arxiv: 1106.4351 · v1 · pith:B3U7CDMLnew · submitted 2011-06-21 · 🧮 math.NA

Solving eigenvalue problems on curved surfaces using the Closest Point Method

classification 🧮 math.NA
keywords surfacesalgorithmclosestcurvedeigenvalueembeddingmethodpoint
0
0 comments X
read the original abstract

Eigenvalue problems are fundamental to mathematics and science. We present a simple algorithm for determining eigenvalues and eigenfunctions of the Laplace--Beltrami operator on rather general curved surfaces. Our algorithm, which is based on the Closest Point Method, relies on an embedding of the surface in a higher-dimensional space, where standard Cartesian finite difference and interpolation schemes can be easily applied. We show that there is a one-to-one correspondence between a problem defined in the embedding space and the original surface problem. For open surfaces, we present a simple way to impose Dirichlet and Neumann boundary conditions while maintaining second-order accuracy. Convergence studies and a series of examples demonstrate the effectiveness and generality of our approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.