Convergence analysis of variational and non-variational multigrid algorithms for the Laplace-Beltrami operator

Andrea Bonito, Joseph E. Pasciak

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

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.
Original languageEnglish (US)
Pages (from-to)1263-1288
Number of pages26
JournalMathematics of Computation
Volume81
Issue number279
DOIs
StatePublished - Sep 1 2012
Externally publishedYes

Bibliographical note

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.

Fingerprint

Dive into the research topics of 'Convergence analysis of variational and non-variational multigrid algorithms for the Laplace-Beltrami operator'. Together they form a unique fingerprint.

Cite this