English

High-order algorithms for solving eigenproblems over discrete surfaces

Numerical Analysis 2013-10-18 v1 Numerical Analysis Computational Physics

Abstract

The eigenvalue problem of the Laplace-Beltrami operators on curved surfaces plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial differential equations which involve this operator. In this note we shall combine the local tangential lifting (LTL) method with the configuration equation to develop a new effective and convergent algorithm to solve the eigenvalue problems of the Laplace-Beltrami operators acting on functions over discrete surfaces. The convergence rates of our algorithms of discrete Laplace-Beltrami operators over surfaces is O(rn)O(r^n), n1n \geq 1, where rr represents the size of the mesh of discretization of the surface. The problem of high-order accuracies will also be discussed and used to compute geometric invariants of the underlying surfaces. Some convergence tests and eigenvalue computations on the sphere, tori and a dumbbell are presented.

Keywords

Cite

@article{arxiv.1310.4807,
  title  = {High-order algorithms for solving eigenproblems over discrete surfaces},
  author = {Sheng-Gwo Chen and Mei-Hsiu Chi and Jyh-Yang Wu},
  journal= {arXiv preprint arXiv:1310.4807},
  year   = {2013}
}

Comments

29pages, 19figures, 2tables. arXiv admin note: text overlap with arXiv:1004.3486

R2 v1 2026-06-22T01:49:09.047Z