Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 82 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 18 tok/s
GPT-5 High 12 tok/s Pro
GPT-4o 96 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 217 tok/s Pro
2000 character limit reached

Full Gradient Stabilized Cut Finite Element Methods for Surface Partial Differential Equations (1602.01512v1)

Published 4 Feb 2016 in math.NA

Abstract: We propose and analyze a new stabilized cut finite element method for the Laplace-Beltrami operator on a closed surface. The new stabilization term provides control of the full $\mathbb{R}3$ gradient on the active mesh consisting of the elements that intersect the surface. Compared to face stabilization, based on controlling the jumps in the normal gradient across faces between elements in the active mesh, the full gradient stabilization is easier to implement and does not significantly increase the number of nonzero elements in the mass and stiffness matrices. The full gradient stabilization term may be combined with a variational formulation of the Laplace-Beltrami operator based on tangential or full gradients and we present a simple and unified analysis that covers both cases. The full gradient stabilization term gives rise to a consistency error which, however, is of optimal order for piecewise linear elements, and we obtain optimal order a priori error estimates in the energy and $L2$ norms as well as an optimal bound of the condition number. Finally, we present detailed numerical examples where we in particular study the sensitivity of the condition number and error on the stabilization parameter.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.