TY - JOUR
T1 - Convergence analysis of variational and non-variational multigrid algorithms for the Laplace-Beltrami operator
AU - Bonito, Andrea
AU - Pasciak, Joseph E.
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): KUS-C1-016-04
Acknowledgements: This work was supported in part by award number KUS-C1-016-04 made by KingAbdulla University of Science and Technology (KAUST). The first author was alsosupported in part by the National Science Foundation through Grant DMS-0914977while the second was also supported in part by the National Science Foundationthrough Grant DMS-0609544.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2012/9/1
Y1 - 2012/9/1
N2 - We design and analyze variational and non-variational multigrid algorithms for the Laplace-Beltrami operator on a smooth and closed surface. In both cases, a uniform convergence for the V -cycle algorithm is obtained provided the surface geometry is captured well enough by the coarsest grid. The main argument hinges on a perturbation analysis from an auxiliary variational algorithm defined directly on the smooth surface. In addition, the vanishing mean value constraint is imposed on each level, thereby avoiding singular quadratic forms without adding additional computational cost. Numerical results supporting our analysis are reported. In particular, the algorithms perform well even when applied to surfaces with a large aspect ratio. © 2011 American Mathematical Society.
AB - We design and analyze variational and non-variational multigrid algorithms for the Laplace-Beltrami operator on a smooth and closed surface. In both cases, a uniform convergence for the V -cycle algorithm is obtained provided the surface geometry is captured well enough by the coarsest grid. The main argument hinges on a perturbation analysis from an auxiliary variational algorithm defined directly on the smooth surface. In addition, the vanishing mean value constraint is imposed on each level, thereby avoiding singular quadratic forms without adding additional computational cost. Numerical results supporting our analysis are reported. In particular, the algorithms perform well even when applied to surfaces with a large aspect ratio. © 2011 American Mathematical Society.
UR - http://hdl.handle.net/10754/597872
UR - http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-2011-02551-2
UR - http://www.scopus.com/inward/record.url?scp=84870789522&partnerID=8YFLogxK
U2 - 10.1090/s0025-5718-2011-02551-2
DO - 10.1090/s0025-5718-2011-02551-2
M3 - Article
SN - 0025-5718
VL - 81
SP - 1263
EP - 1288
JO - Mathematics of Computation
JF - Mathematics of Computation
IS - 279
ER -