pith. sign in

arxiv: 2605.21445 · v1 · pith:QYKLYF3Rnew · submitted 2026-05-20 · 🧮 math.NA · cs.NA· math.AP

Error analysis of a finite element scheme for parametric mean curvature flow based on the DeTurck trick

Klaus Deckelnick , Vanessa Styles This is my paper

Pith reviewed 2026-05-21 02:57 UTC · model grok-4.3

classification 🧮 math.NA cs.NAmath.AP MSC 65M1565M60
keywords mean curvature flowfinite element methodDeTurck trickerror estimatesparametric surfacessemidiscrete schemeH1 error analysisgeometric evolution
0
0 comments X

The pith

Semidiscrete finite element scheme for parametric mean curvature flow via the DeTurck trick achieves optimal H1 error estimate of order k for polynomial degree k at least 2.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves an error bound for a numerical scheme approximating surfaces that evolve by mean curvature flow while keeping the mesh points from degenerating. It applies the DeTurck trick to add a tangential velocity term that stabilizes the parametrization of the surface. In the semidiscrete setting, where space is discretized by finite elements but time remains continuous, the analysis establishes that the H1-norm error in the position vector is of optimal order k whenever the element degree is k or higher. A reader would care because this supplies a rigorous rate of convergence for the computed surface to the true one as the mesh is refined, together with the observed preservation of mesh quality.

Core claim

For the semidiscrete finite element discretization of order k greater than or equal to 2 of the parametric mean curvature flow problem after reparametrization by the DeTurck trick, the position vector satisfies an optimal error estimate in the H1 norm of order k in the mesh size.

What carries the argument

The DeTurck trick reparametrization, which augments the mean curvature velocity by a tangential term chosen from the evolving metric to control the parametrization and enable stable finite element approximation of the position vector.

If this is right

  • The position vector error decreases at the optimal rate k when the mesh size is reduced for elements of degree k at least 2.
  • The scheme produces meshes whose points remain reasonably distributed throughout the evolution.
  • Numerical experiments on test surfaces reproduce the predicted convergence rates and confirm the mesh quality property.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same error analysis technique might extend to fully discrete schemes that also discretize time.
  • The DeTurck stabilization could be combined with adaptive mesh refinement to handle surfaces that develop singularities.
  • Similar reparametrization ideas may yield error bounds for related geometric flows such as surface diffusion.

Load-bearing premise

The exact solution of the continuous parametric mean curvature flow problem is assumed to be sufficiently smooth so that the error estimates can be closed.

What would settle it

Compute the H1 error between the exact position and the finite element solution on a sequence of uniformly refined meshes for a problem whose exact solution is known to be smooth and check whether the observed rate equals the polynomial degree k.

Figures

Figures reproduced from arXiv: 2605.21445 by Klaus Deckelnick, Vanessa Styles.

Figure 1
Figure 1. Figure 1: Reference hypersurface Mh (left), initial dumbbell shaped triangulation T 0 h (right). 20 [PITH_FULL_IMAGE:figures/full_fig_p020_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Dumbbell simulation: the triangulation T m h at t = 0.01 (first row), t = 0.03 (second row) and t = 0.05 (third row) for α = 1.0 (left) α = 0.04 (right). 5.2.3 Computational efficiency of the second order scheme (5.5), (5.6) In [PITH_FULL_IMAGE:figures/full_fig_p021_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Dumbbell simulation: the triangulations T m h at t m = 0.04 (first row) and t = 0.06 (second row) for α = 1.0 (left) α = 0.04 (right). (5.4) (5.5), (5.6) τ max 0≤m≤M ∥x m h − x(t m)∥ 2 ∥x(tm)∥ 2 CPU time [s] max 0≤m≤M ∥x m h − x(t m)∥ 2 ∥x(tm)∥ 2 CPU time [s] 0.05 1.128 × 10−5 38 3.720 × 10−9 69 0.01 9.250 × 10−7 144 1.300 × 10−11 238 0.005 2.516 × 10−7 236 1.204 × 10−12 379 0.001 1.076 × 10−8 743 3.844 × … view at source ↗
Figure 4
Figure 4. Figure 4: Dumbbell simulation. The effect of α on (i) σmax (left) and (ii) the surface area of T m h (centre and right). A Appendix Proof of Lemma 2.2: Let φ : U → R 3 be a local parametrization of M with µ = φθ1 ∧ φθ2 . Abbreviating X = x ◦ φ we deduce with the help of (2.2) that vj ◦ φ = (Dj+1x ∧ Dj+2x) ◦ φ = h rsh pqφ j+1 θr φ j+2 θp Xθs ∧ Xθq = [PITH_FULL_IMAGE:figures/full_fig_p023_4.png] view at source ↗
read the original abstract

The paper is concerned with the error analysis of a numerical scheme for the approximation of parametric mean curvature flow. The scheme we study is based on a reparametrization using the DeTurck trick and was proposed by Elliott and Fritz in [15]. In the semidiscrete case, for a spatial discretization by finite elements of order $k \geq 2$ we prove an optimal $H^1$-error estimate for the position vector. We present numerical experiments that confirm this error bound and demonstrate that the scheme has good properties with respect to the distribution of mesh points as already observed in [15].

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript analyzes the error of a semidiscrete finite-element scheme for parametric mean curvature flow that employs the DeTurck trick for reparametrization (originally proposed by Elliott and Fritz). For spatial discretizations of polynomial degree k ≥ 2 the authors derive an optimal H¹-error bound on the position vector; numerical experiments are presented to confirm the predicted rates and to illustrate the scheme’s mesh-quality properties.

Significance. If the central estimate is valid, the work supplies a rigorous a-priori error analysis for a geometrically motivated discretization that controls tangential motion, a practically important feature for long-time simulations of mean-curvature flow. The result aligns with standard targets in finite-element theory for nonlinear geometric PDEs and is supported by computational verification. Its impact is nevertheless moderated by the strong smoothness hypotheses placed on the exact solution, which are invoked but not justified within the manuscript.

major comments (2)
  1. [§3] §3 (error analysis, around Theorem 3.1 and the consistency estimates): the derivation of the optimal H¹ bound closes only after invoking C^{3,1} (or higher) space-time regularity of the exact parametric solution to control the nonlinear mean-curvature terms, the DeTurck velocity, and the interpolation remainder. No local existence result, continuation argument, or a-priori regularity estimate is supplied to guarantee that this smoothness persists on the time interval of interest; without it the Gronwall closure and the claimed error bound are not justified.
  2. [§2.2] §2.2 (weak formulation and assumptions): the mesh-regularity hypotheses (quasi-uniformity, inverse inequalities) used to absorb the nonlinear terms are stated but never verified to be compatible with the evolving surface produced by the scheme itself; this compatibility is load-bearing for the stability step that precedes the error estimate.
minor comments (2)
  1. [§4] The numerical section reports observed rates but does not tabulate the precise mesh-size sequence or the measured H¹ seminorm errors; adding these data would allow direct comparison with the theoretical constant.
  2. [§2] Notation for the tangential velocity term arising from the DeTurck trick is introduced without a short self-contained recap; a one-paragraph reminder in §2 would aid readers who have not consulted the original Elliott–Fritz paper.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for the constructive major comments. We address each point below, indicating the revisions we intend to incorporate.

read point-by-point responses

  1. Referee: [§3] §3 (error analysis, around Theorem 3.1 and the consistency estimates): the derivation of the optimal H¹ bound closes only after invoking C^{3,1} (or higher) space-time regularity of the exact parametric solution to control the nonlinear mean-curvature terms, the DeTurck velocity, and the interpolation remainder. No local existence result, continuation argument, or a-priori regularity estimate is supplied to guarantee that this smoothness persists on the time interval of interest; without it the Gronwall closure and the claimed error bound are not justified.

    Authors: We agree that the C^{3,1} regularity assumption on the exact solution is essential for closing the estimates on the nonlinear terms and interpolation errors. The analysis in Theorem 3.1 is conditional on the existence of a sufficiently regular solution on [0,T]. Such local-in-time existence and regularity follow from standard parabolic theory for mean-curvature flow with smooth initial data; global regularity may of course fail when singularities form. We will revise the statement of Theorem 3.1 and add a short clarifying paragraph in the introduction (and at the beginning of §3) that explicitly records this standing assumption and references the relevant local existence results for the continuous problem. This makes the conditional nature of the error bound transparent without altering the core analysis. revision: yes

  2. Referee: [§2.2] §2.2 (weak formulation and assumptions): the mesh-regularity hypotheses (quasi-uniformity, inverse inequalities) used to absorb the nonlinear terms are stated but never verified to be compatible with the evolving surface produced by the scheme itself; this compatibility is load-bearing for the stability step that precedes the error estimate.

    Authors: The quasi-uniformity and inverse-inequality assumptions in §2.2 are indeed used to absorb the nonlinear contributions during the stability argument. These hypotheses are imposed directly on the discrete surfaces generated by the semidiscrete scheme. The DeTurck reparametrization is introduced precisely to control tangential motion and thereby help preserve mesh quality, a property already observed numerically in the original work of Elliott and Fritz and confirmed by our own experiments. A complete a-priori proof that the discrete surfaces remain quasi-uniform for arbitrary times would require additional estimates on the discrete tangential velocity and is outside the scope of the present error analysis. We will insert a remark in §2.2 acknowledging that the mesh-regularity assumptions are made on the discrete solution and are supported by the computational results; we will also note that the error estimate can be understood to hold on time intervals short enough that the discrete mesh remains regular by continuity from the initial triangulation. revision: partial

Circularity Check

0 steps flagged

Error analysis is self-contained via standard FE theory and assumed regularity; no reduction to inputs or self-citation loop

full rationale

The paper derives an a-priori H¹-error bound for the semidiscrete scheme by applying standard interpolation estimates, consistency analysis for the DeTurck-reparametrized mean-curvature equation, and Gronwall's inequality to the error equation. All steps rest on external finite-element approximation theory and the assumed C^{3,1} regularity of the exact solution (invoked explicitly to bound nonlinear terms), none of which is constructed from the target error estimate itself. The reference to the original scheme in [15] merely identifies the discretization under study and carries no load-bearing justification for the error bound. No fitted parameters, self-definitional relations, or author-overlapping uniqueness theorems appear in the derivation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof relies on standard Sobolev-space estimates and finite-element interpolation theory; no new free parameters or invented entities are introduced. The main modeling choice is the DeTurck reparametrization already present in the referenced scheme.

axioms (2)
  • domain assumption The exact solution to the continuous parametric mean curvature flow possesses sufficient regularity (typically H^{k+1} or higher) to justify the error estimates.
    Invoked to close the a-priori estimates for the semidiscrete scheme.
  • standard math Standard finite-element interpolation and inverse inequalities hold on the reference domain.
    Background result from approximation theory used throughout the analysis.

pith-pipeline@v0.9.0 · 5631 in / 1364 out tokens · 29183 ms · 2026-05-21T02:57:28.170941+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Bai, G., Li, B.:Erratum: Convergence of Dziuk’s semidiscrete finite element method for mean curvature flow of closed surfaces with high order finite elements. SIAM J. Numer. Anal.61, 1609–1612 (2023)

    work page 2023

  2. [2]

    Bai, G., Li, B.:A new approach to the analysis of parametric finite element approximations to mean curvature flow. Found. Comput. Math.24, 1673–1737 (2024)

    work page 2024

  3. [3]

    Barrett, J.W., Garcke, H., N¨ urnberg, R.:On the parametric finite element approximation of evolving hypersurfaces inR 3. J. Comput. Phys.222, 4281–4307 (2008)

    work page 2008

  4. [4]

    Barrett, J.W., Garcke, H., N¨ urnberg, R.:Parametric approximation of Willmore flow and related geometric evolution equations. SIAM J. Sci. Comput.31, 225–253 (2008)

    work page 2008

  5. [5]

    In: Handbook of Numerical Analysis, vol.21, 275– 423; Elsevier, Amsterdam, 2020

    Barrett, J.W., Garcke, H., N¨ urnberg, R.:Parametric finite element approximations of curvature–driven interface evolutions. In: Handbook of Numerical Analysis, vol.21, 275– 423; Elsevier, Amsterdam, 2020

    work page 2020

  6. [6]

    Acta Numer.14, 139–232 (2005)

    Deckelnick, K., Dziuk, G., Elliott, C.M.:Computation of geometric partial differential equations and mean curvature flow. Acta Numer.14, 139–232 (2005)

    work page 2005

  7. [7]

    SIAM Journal on Numerical Analysis,64, 103–124, (2026)

    Deckelnick, K., N¨ urnberg, R.:Second Order in Time Finite Element Schemes for Curve Shortening Flow and Curve Diffusion. SIAM Journal on Numerical Analysis,64, 103–124, (2026)

    work page 2026

  8. [8]

    Demlow, A.:Higher–order finite element methods and pointwise error estimates for elliptic problems on surfaces.SIAM J. Numer. Anal.47, 805–827 (2009)

    work page 2009

  9. [9]

    Duan, B.:Energy–stable and mesh–preserving parametric FEM for mean curvature flow of surfaces. SIAM J. Sci. Comput.46, A3873–3896 (2024). 24

    work page 2024

  10. [10]

    Duan, B., Li, B.:New artificial tangential motions for parametric finite element approxi- mation of surface evolution. SIAM J. Sci. Comput.46, A587–A608 (2024)

    work page 2024

  11. [11]

    Duan, B.:Mesh–preserving and energy–stable parametric FEM for geometric flows of sur- faces. SIAM J. Numer. Anal.63, 619–640 (2025)

    work page 2025

  12. [12]

    Dziuk, G.:An algorithm for evolutionary surfaces. Numer. Math.58, 603–611 (1990)

    work page 1990

  13. [13]

    Dziuk, G., Elliott, C.M.:Finite elements on evolving surfaces. IMA J. Numer. Anal.27, 262–292 (2007)

    work page 2007

  14. [14]

    Progress in Nonlinear Differential Equations and Their Applications, vol57, Birkh¨ auser, Boston, 2004

    Ecker, K.:Regularity Theory for Mean Curvature Flow. Progress in Nonlinear Differential Equations and Their Applications, vol57, Birkh¨ auser, Boston, 2004

    work page 2004

  15. [15]

    Elliott, C.M., Fritz, H.:On approximations of the curve shortening flow and of the mean curvature flow based on the DeTurck trick.IMA Journal of Numerical Analysis,37, 543–603 (2017)

    work page 2017

  16. [16]

    Fritz, H.:Numerical Ricci–De–Turck flow. Numer. Math.131, 241–271 (2015)

    work page 2015

  17. [17]

    Gao, G., Li, B.:Geometric–structure preserving methods for surface evolutions in curvature flows with minimal deformation formulations. J. Comput. Phys., article 113718 (2025)

    work page 2025

  18. [18]

    Hu, J, Li, B.:Evolving finite element methods with an artificial tangential velocity for mean curvature flow and Willmore flow. Numer. Math.152, 127–181 (2022)

    work page 2022

  19. [19]

    Kov´ acs, B., Li, B., Lubich, C.:A convergent evolving finite element algorithm for mean curvature flow of closed surfaces. Numer. Math.149, 797–853 (2019)

    work page 2019

  20. [20]

    Li, B.:Convergence of Dziuk’s semidiscrete finite element method for mean curvature flow of closed surfaces with high order finite elements. SIAM J. Numer. Anal.59, 1592–1617 (2021)

    work page 2021

  21. [21]

    Li, B., Tang, R.:Dynamic Ritz projection of mean curvature flow and optimalL 2– convergence of parametric FEM. SIAM J. Numer. Anal.63, 1454–1481 (2025)

    work page 2025

  22. [22]

    Progress in Mathematics, vol

    Mantegazza, C.:Lecture Notes on Mean Curvature Flow. Progress in Mathematics, vol. 290, Birkh¨ auser/Springer, Basel, 2011

    work page 2011

  23. [23]

    PhD thesis, University of Magdeburg, 2020

    Mierswa, A.:Error estimates for a finite difference approximation of mean curvature flow for surfaces of torus type. PhD thesis, University of Magdeburg, 2020

    work page 2020

  24. [24]

    Mikula, K., Remeˇ s´ ıkov´ a, M., Sarkoci, P.,ˇSevˇ coviˇ c, D.:Manifold evolution with tangential redistribution of points. SIAM J. Sci. Comput.36, A1384–A1414 (2014)

    work page 2014

  25. [25]

    G.:Design of Adaptive Finite Element Software, Lecture Notes in Computational Science and Engineering 42, Springer (2005)

    Schmidt A, Siebert K. G.:Design of Adaptive Finite Element Software, Lecture Notes in Computational Science and Engineering 42, Springer (2005). 25

    work page 2005