WorksMathematics
Energy-Dissipative, High-Order BDF Schemes for Simulating Geometric Flows via Energy Increments
Abstract
We propose energy-dissipative backward differentiation formula (BDF) methods for geometric flows in the Barrett–Garcke–Nürnberg (BGN) parametric finite element framework. Starting from a Lagrange-multiplier formulation, we replace the multistep approximation of the energy derivative by an energy-increment equation while retaining the BDF geometric equations. The Simpson quadrature and two interleaved time grids provide third- and fourth-order constructions. The positive quadrature weights ensure stepwise decay of the original discrete geometric energy for every nondegenerate solution of the nonlinear system. We establish an explicit conditional consistency bound for the scalar energy equation and a regularity criterion for the Newton system of curve-shortening flows. Then, the proposed schemes extend to simulating curve diffusion, mean curvature flow, and surface diffusion. Finally, numerical experiments demonstrate geometric accuracy, energy decay, good mesh distribution, and high performance of the proposed schemes.
Introduction
Curvature-driven flows provide models for interface motion in materials science, biomembrane dynamics, and image processing [8, 9, 12]. Many of these models are gradient flows of a geometric energy and satisfy
where is the evolving curve or surface and is the dissipation rate. Curve shortening and curve diffusion flows, for example, decrease perimeter with dissipation rates and , respectively; analogous laws hold for mean curvature flow and surface diffusion [7]. A numerical method should reproduce this energy decrease while resolving the interface motion accurately. Combining higher-order time integration with discrete energy dissipation and a well-distributed moving mesh is the problem addressed here.
Parametric finite element methods (PFEMs) approximate the interface directly by a polygonal curve or a triangulated surface. Their performance depends on how the mesh evolves along with the geometry. The Barrett–Garcke–Nürnberg (BGN) formulation [4, 5, 6] couples the normal-velocity equation to a weak curvature relation. Higher-order BGN methods must approximate both the interface velocity and the geometry on which the discrete equations are evaluated. Jiang, Su, and Zhang developed a second-order method with interlaced perimeter decay [20] and backward differentiation formula (BDF) methods of high orders from the second to fourth [21]. In the latter, lower-order BGN solves supply the predicted integration geometry. A related predictor–corrector construction was developed for curve and surface diffusion [22]. These developments motivate retaining the BGN spatial structure while improving the treatment of its energy dissipation law.
Lagrange multipliers provide a direct way to impose geometric balance laws as additional equations. Garcke, Jiang, Su, and Zhang [16] used this approach to enforce energy dissipation and area or volume conservation in PFEMs for surface diffusion. Their BDF formulation applies the multistep difference operator to the energy itself. For BDF2, a nonincreasing starting step allows an induction argument for subsequent energy decay. At orders three and four, however, a nonpositive BDF approximation of the energy derivative does not by itself imply . The issue is the sign of the individual energy increments in the multistep recurrence, rather than the order of approximation of the derivative. Moreover, replacing this equation by a backward-Euler energy update would generally reduce the consistency order of the coupled method.
Several other approaches achieve high-order energy stability for phase-field gradient flow models. On fixed domains, scalar auxiliary variable (SAV) methods [19, 25, 26] and energy-diminishing Runge–Kutta methods [13, 14] provide important examples. For evolving interfaces, Guo and Li [17] combine BDF integration with minimal-deformation, SAV, and Lagrange-multiplier formulations for anisotropic surface diffusion. The dissipation theorem for their SAV variants concerns an auxiliary energy, which is distinct from monotonicity of the original discrete geometric energy. Duan, Li, and Zhang [11] obtained high-order energy-diminishing methods for curvature-dependent surface energies by averaged vector-field collocation. More recently, Ma and Rao [24] constructed algebraically stable implicit Runge–Kutta extensions of BGN-type methods for curves and genus-zero surfaces. Zhang, Andrews, and Farrell [27] developed continuous Petrov–Galerkin time discretizations of arbitrary order with auxiliary variables that preserve energy dissipation and, for surface diffusion, enclosed volume of the surface. These methods establish that high-order geometric energy dissipation is achievable. In this paper, our objective is its realization within the BDF3 and BDF4 Lagrange-multiplier formulations, with their geometric evolution and curvature equations retained.
We replace the multistep energy-derivative equation by an approximation of the integrated balance in (1). Writing and , the scalar update takes the form
where approximates the time-averaged dissipation rate by a quadrature rule with positive weights. For , Simpson’s rule combines endpoint and midpoint dissipation values. An auxiliary half-integer time grid supplies the midpoint states, and the two grids are advanced alternately. The energy in (2) is, respectively, the length for curve evolution, area for surface evolution, or anisotropic free energy for anisotropic geometric flows. Thus, every nondegenerate solution satisfying the scalar equation inherits the corresponding original energy decrease rate, separately on each time level. The construction only changes the scalar balance rather than the BDF approximation of the geometric evolution.
The analysis identifies the conditions needed to interpret this construction. We establish stepwise energy dissipation and quantify the scalar consistency defect in terms of the quadrature error and the errors in the nodal dissipation data. We also derive the Newton system for curve shortening flow (CSF), give a Schur-complement criterion for its local regularity, and relate the nonlinear energy residual to the computed energy balance. These results make explicit the roles of predicted geometry, midpoint accuracy, initialization, and nonlinear solution accuracy.
The rest of the paper is organized as follows. Section 2 introduces the energy-increment BDF schemes and their scalar analysis. Section 3 presents the interleaved implementation, and Section 4 develops the Newton solver. Extensions to other geometric flows are given in Section 5, followed by numerical experiments in Section 6 and conclusions in Section 7.
Energy-increment BDF discretization
We use curve-shortening flow to introduce the construction. After fixing the geometric conventions and spatial discretization, we examine the energy constraint in derivative-based BDF schemes and replace it by an integrated balance. The resulting scalar equation admits separate consistency and dissipation arguments.
Curve shortening flow and spatial semidiscretization
Let be a smooth, simple closed curve with initial configuration and regular parametrization
We orient the curve counterclockwise and choose the outward unit normal . The convention then assigns curvature to a circle of radius . All continuous identities are understood while the curve remains smooth and regular. The arc-length variable is , with derivative and measure , .
Write for the perimeter and for the normal velocity. The perimeter variation underlying the Lagrange-multiplier approach [16] is
Introducing a scalar multiplier in the curvature direction and imposing the perimeter dissipation law gives
Combining the perimeter variation with (3) and (5) yields . Thus whenever , and (2.1) recovers classical curve-shortening flow.
For the spatial discretization, partition uniformly into
Define the finite element space
where denotes the set of polynomials of degree at most one. For , let be the associated polygon, with edges . All polygons used to evaluate inner products or arc-length derivatives are assumed to have positive edge lengths. The discrete perimeter is
On , the discrete arc-length derivative is . We use the standard inner product and its mass-lumped counterpart
for scalar- or vector-valued piecewise continuous functions. The values at denote one-sided traces, with periodic extension at and .
Given compatible initial data, seek such that, for all ,
Here , and the elementwise outward unit normal is
with denoting counterclockwise rotation by . This sign is consistent with the counterclockwise orientation.
For a differentiable polygonal evolution, . Testing (8) with and (9) with therefore gives . Equation (10) then implies when . The scalar constraint is thus compatible with the semidiscrete BGN equations; its role becomes essential after time discretization.
Remark 2.1 (Compatibility of the initial polygon). Let , , and , with cyclic indices. Testing (9) with the vector-valued nodal basis functions at vertex gives . Taking its dot product with yields
Thus adjacent edges with different unit tangents must have equal lengths. When , the Euclidean least-squares approximation to the nodal curvature equation is
This value can be used to initialize the fully discrete curvature, but it does not enforce (9) on an incompatible polygon. Accordingly, the consistency analysis below assumes the existence of a smooth, compatible semidiscrete reference solution.
BDF discretization with an energy-derivative constraint
Following the BGN/BDF construction of [21] and the Lagrange-multiplier approach of [16], we first apply the BDF operator to both the position and the energy. Let , where and . The predicted polygon is constructed before assembling the equations and has the same nodal connectivity as the computed polygons. Functions on different polygons are identified by their coefficients on the common reference mesh. The normal and arc-length derivatives in the following equations are evaluated on . Given the required history, for seek such that, for all ,
The dimensionless BDF operators are
The same coefficients define , with . Thus approximates the time derivative. We call these schemes BGN-LM-BDF, . For , set ; for higher orders, use lower-order solves to predict the geometry. Section 3 specifies the predictors and start-up data.
Remark 2.2 (Derivative-based energy updates). Write and let denote the endpoint dissipation. The BDF2 energy equation reads
Consequently, stepwise decay follows by induction if . For BDF3 and BDF4, respectively,
Nonpositive history increments do not ensure a nonpositive right-hand side. For BDF3, , , and give . For BDF4, , , and give . These examples concern only the scalar recurrences and illustrate the limitation discussed in [16]; they are not counterexamples to a complete geometric scheme.
The Crank–Nicolson formulation in [16] already uses an energy increment, with midpoint dissipation. We instead couple an integrated energy balance to the BDF approximation of the geometric evolution, using quadrature consistent with the intended order.
Energy-increment formulation and scalar analysis
The proposed modification discretizes the scalar energy law in integral form. Integrating (5) over gives
We retain the geometric equations (2.7a)–(2.7b) and replace (15) by
where approximates the time-averaged dissipation rate. For , the right-endpoint rule gives
For , we use the trapezoidal rule,
For , we use Simpson’s rule,
The resulting schemes are denoted by ES-BDF. ES-BDF3 and ES-BDF4 share this quadrature rule but differ in their BDF operators, predictors, and accuracy requirements for the intermediate data. The endpoint dissipation is evaluated on the predicted geometry, whereas the history and midpoint terms use their computed geometries. We now examine consistency and energy dissipation for this scalar update.
For the consistency analysis, assume that (2.4) admits a sufficiently smooth, compatible reference solution and write
The semidiscrete energy law (10) gives
Denote by the computed dissipation at quadrature node for the interval . In the present curve-shortening formulation,
and, when Simpson’s rule is used,
The required accuracy of these data is expressed by
at all nodes of the selected rule, uniformly in time for fixed . This is an assumption on both curvature and geometry, since the latter determines the mass-lumped weights. In particular, need not equal : the same curvature coefficients are evaluated on when used as history, but on when used as an endpoint. For , the assumption also concerns the midpoint states supplied by the staggered construction in § 2.
Proposition 2.3 (Conditional scalar consistency). Let a compatible semidiscrete solution exist on , with . For the right-endpoint, trapezoidal, and Simpson rules, respectively, set
Define , with the maximum taken over the rule’s nodes. Then the defect in the energy-increment equation satisfies
Under (2.13), this defect is for , or after division by , with constants at fixed .
Proof. By (2.12), the defect is the difference between and the exact dissipation integral. Add and subtract the quadrature rule applied to the exact dissipation values. If are the normalized weights, the data error is bounded by
since and . The standard quadrature remainder gives the second term in (2.14). Finally, for each selected rule, which gives the stated orders when .
Proposition 2.3 concerns the scalar constraint with exact reference energies at the interval endpoints. A convergence result for the coupled algorithm would also require control of the geometry, curvature, initialization, predictors, and staggered histories; the diffusion extensions additionally involve discrete-gradient errors. The estimate is at fixed , with no assertion of uniform constants under spatial refinement or mesh degeneration.
Proposition 2.4 (Stepwise energy dissipation). Let , let all quadrature geometries be nondegenerate, and define by (2.9)–(2.11). Every solution satisfying the scalar equation (2.8) exactly obeys
For curve shortening flows, the inequality is strict if (2.7b) also holds and the updated polygon has at least one nonzero edge.
Proof. Each dissipation term is nonnegative, and each quadrature weight is positive. Hence , and (2.8) gives
Equality would force the endpoint dissipation to vanish. For curve shortening, positivity of the mass-lumped weights on then gives . Taking in (2.7b) would then give , so every edge of the updated polygon would vanish, a contradiction.
The proposition applies to every solved step, but does not establish solvability for arbitrary . In particular, the Simpson update and require
Thus the prescribed history and midpoint data can preclude a positive-energy solution; (23) is only a necessary condition. For successive solved steps on a single time grid, the scalar equations telescope to
This identity holds separately on the two grids used by the staggered implementation. For inexact nonlinear solves, the corresponding residual correction is discussed in § 3. The principal role of the increment constraint is at BDF orders three and four: BDF2 with a nonincreasing start, Crank–Nicolson, and the trapezoidal increment update already admit energy-decay arguments.
Boole’s rule has positive weights , but a higher-order extension would also require accurate intermediate states and a stable multistep coupling. Not all closed Newton–Cotes rules have positive weights. We focus here on design orders , with ES-BDF1 as a first-order reference. The remaining implementation task is to supply the midpoint geometry and curvature required by Simpson’s rule. § 2 describes the interleaved time grids and the associated accuracy requirements.
Staggered implementation
We now describe the implementation of the ES-BDF schemes for curve-shortening flow. For ES-BDF3 and ES-BDF4, Simpson’s rule requires geometric data at the midpoint of each time interval. We obtain these data by evolving an auxiliary sequence on the half-integer time grid.
Two ingredients follow the BGN/BDF methodology of [21]. First, the usual start-up target for an order- multistep method is an error in the position history. A first-order start-up integrator with substep over an interval of length has an accumulated error of order , provided the local error and stability constants remain bounded. This motivates . Choose with an integer so that every half-grid start-up time is reached exactly. This scaling does not by itself control the algebraic curvature variable or verify (21). A first-order scheme may have an curvature error even when its accumulated position error is . The effects of these distinct errors on the coupled start-up require separate analysis.
Second, each target geometry is predicted before the BGN equations are assembled. We use BGN1 for ES-BDF2 and an ES-BDF2 predictor for ES-BDF3. Here BGN1 means (13) and (14) with , , and no additional scalar energy equation; it is distinct from ES-BDF1. Each nested ES-BDF2 prediction uses its own BGN1 geometry. ES-BDF2 uses only endpoint data and requires one time grid. For the Simpson updates, Algorithm 3.1 advances integer and half-integer sequences, each with time step .
Algorithm 3.1 advances the integer and half-integer sequences alternately. The integer-level update at uses the previously computed midpoint data at . The subsequent half-integer update at then uses the newly computed state at as its midpoint data. The corresponding scalar energy equation on the half-
Algorithm 3.1 ES-BDF3 staggered update
Require: Initial data , time step , start-up step , terminal time with integer .
Ensure: Integer-level states and half-integer-level states .
Initialization.
Compute by (2.6).
Compute , , and by successive BGN1 start-up solves with step .
Compute on the integer grid by ES-BDF2.
Compute on the half-integer grid by ES-BDF2.
Time stepping.
for do
Construct the predicted geometry by an ES-BDF2 predictor on the integer grid.
Solve the ES-BDF3 system for .
if then
Construct the predicted geometry by an ES-BDF2 predictor on the half-integer grid.
Solve the ES-BDF3 system for .
end if
end for
integer grid is
where
After initialization, both sequences use BDF3. This matches their design orders but leaves (2.13) to be verified for the coupled evolution. Proposition 2.4 applies separately to the two sequences: it gives and , without ordering and .
The dependency structure of one staggered update is illustrated in Figure 1.
Figure 1. Dependency structure of one staggered ES-BDF3 update. Black arrows indicate data used for the integer-level update at , and blue arrows indicate data used for the subsequent half-integer-level update at . The arrows include both the BDF3 history and the midpoint data required by Simpson’s rule.
For ES-BDF4, take and retain four history values on each grid. The integer sequence is initialized through and the half-integer sequence through using lower-order solves refined sufficiently to target start-up errors. An unrefined ES-BDF2 macro step generally contributes an local error and is not by itself sufficient for this purpose. The ES-BDF3 predictor uses only the already available history and midpoint data and is discarded after construction of the predicted geometry. The histories are listed in Table 1. As for ES-BDF3, the integer solve uses the available half-integer midpoint, and the following half-integer solve uses the newly computed integer state. Each ES-BDF3 or ES-BDF4 macro step normally requires two nonlinear solves, together with its predictor solves. Newton iteration counts alone therefore do not measure total computational cost.
| ES-BDF3 | ES-BDF4 | |
| Integer-level history | ||
| Half-integer-level history | ||
| Predictor | ES-BDF2 | ES-BDF3 |
| Integer startup | through | through |
| Half-integer startup | through | through |
Table 1. Staggered implementation data for ES-BDF3 and ES-BDF4.
Newton solution of the ES-BDF3 system
At the target time , Newton’s method solves for . The predicted geometry, its normal and metric, and the midpoint data are fixed throughout the iteration. Initial curvature is obtained from (2.6), following [20 Remark 2.1]; this requires , which is stronger than nonzero individual edge lengths. The position and curvature histories are supplied by § 2.
For a polygonal curve and a perturbation , the first variation of the discrete perimeter is
Equivalently, . This derivative is evaluated on the current iterate , whereas the metric in the endpoint dissipation remains fixed on .
A natural initial guess is
Given , the Newton correction is determined by the following linearized system. Let and be the left-hand sides of (2.7a) and (2.7b), evaluated at the current iterate with , and let . Then
The factor in (29) is twice the endpoint Simpson weight ; no geometry derivative enters this quadratic term because the predicted metric is fixed.
Proposition 4.1 (Regularity of the CSF Newton system). At an iterate with a nondegenerate current polygon and , suppose that the predicted polygon has positive edge lengths and its nodal vectors span . Let be the coefficient matrix of {(xref}(4.2)–(28)} for , with . Then is invertible. Writing the full Jacobian as
where is the multiplier column and is the energy row, is invertible if and only if .
Proof. For a homogeneous solution of the first two equations, test with and . Eliminating their mixed term gives
where . Hence and is constant. The first equation and the spanning condition force this constant to vanish. The square matrix thus has trivial kernel. Block elimination then gives the scalar Schur complement in (30), proving the second assertion. ▫
At a nondegenerate root satisfying these conditions, the inverse function theorem gives local uniqueness of that root and standard Newton theory gives local quadratic convergence for sufficiently close initial guesses. This conditional statement proves neither existence of a root nor that stays away from zero along the computed evolution. The condition is sufficient for the block argument, not asserted for every iterate. These conclusions concern CSF, not the anisotropic matrix.
After solving {(xref}(4.2)–(29)}, the iterate is updated by
The increment-based stopping criterion used to describe the iteration is
A small correction alone does not certify a small nonlinear residual. In particular, if the accepted state has scalar energy residual , then
Consequently, a sufficient acceptance condition for dissipation is . For example, with gives . When , a positive absolute tolerance alone cannot guarantee nonincrease. More generally,
Thus a per-step energy residual contributes at most to the accumulated balance over a fixed time interval. This controls the balance error, not the geometric solution error. These estimates motivate monitoring the energy residual alongside the correction size, with residual scaling, tolerances, and iteration limits specified for each implementation. Control of the geometric solution error additionally requires bounds on the other residuals.
Extensions to other geometric flows
The construction extends by changing the geometric constitutive relation and the dissipation functional. To display the common structure, for a nonnegative functional define
The endpoint uses the predicted metric, whereas the history and midpoint use their computed geometries. The following ES-BDF3 systems share this quadrature and the staggered construction of § 2. Nondegenerate evaluation geometries are assumed.
Curve diffusion
We first consider curve diffusion, the -gradient flow of the perimeter . Its normal velocity is
where denotes the curvature. The corresponding Lagrange-multiplier formulation is
Using the perimeter variation and the first equation in (34) gives
Hence whenever , and the augmented formulation is equivalent to the classical curve-diffusion equation at the continuous level. Define . Given , the ES-BDF3 scheme seeks
such that, for all ,
Since , the last equation gives . Testing the first equation with yields
which is not an exact discrete enclosed-area conservation law. An additional area constraint, as in [16], is needed if exact conservation is required.
Anisotropic curve diffusion
We next consider anisotropic curve diffusion driven by the anisotropic perimeter
where is the angle of the outward normal measured counterclockwise from the positive first coordinate axis. We assume a positive, -periodic energy density . The unregularized smooth-flow setting below uses positive surface stiffness . The normal velocity and anisotropic chemical potential are
For , one has , and the formulation reduces to isotropic curve diffusion. With the sign convention used here, the first variation satisfies
For a polygonal curve , we define the corresponding discrete anisotropic energy by
where denotes the orientation angle of the outward unit normal on the th edge of .
For Newton iteration, the energy row must differentiate this anisotropic energy. At the current polygon,
Indeed, and . The energy derivative includes both edge-length and angle variations; the coefficients in the predicted-geometry equations remain fixed. Following [23], we use the conservative representation
The augmented continuous formulation is then
Combining the first-variation identity with (5.5) gives
and therefore whenever .
Using and the predicted geometry, the ES-BDF3 equations are, for every ,
Again, the positivity of the Simpson weights gives for any solution of (5.6).
Remark 5.1 (Strong anisotropic cases). The constitutive relation can also be expressed using the symmetrized matrix of [1, 22]. To distinguish the stabilization parameter from the BDF order, we write this matrix as in place of in (5.6b). The scalar energy-increment argument still applies to any solution with nonnegative dissipation. If becomes negative in some orientations, however, algebraic energy decay and matrix symmetrization alone do not establish well-posedness of the unregularized continuum flow or convergence to it. Such a regime requires a specified regularization or solution concept and is not discussed here.
Initialization. We extend the least-squares construction of [20 Remark 2.1] to the anisotropic chemical potential . For the initial polygon , the resulting normal equations are
where
and
Here is the standard Lagrange basis on , and denote the two components of , and and . Equivalently, minimizes . Uniqueness requires to have full column rank, or equivalently nonzero mass-weighted nodal normals. If the system is ill conditioned, a QR or singular-value decomposition avoids explicitly forming the normal equations. This supplies the initial chemical potential.
Surface evolution in three dimensions
We next consider closed surfaces in . The curvature relation is expressed in terms of the mean curvature , and surface gradients replace arc-length derivatives. We first introduce the discrete surface notation used below.
At time , the surface is approximated by a polyhedral surface
consisting of nondegenerate triangles without hanging vertices, with the vertices of each triangle ordered consistently so that their cross product points outward. The continuous piecewise linear finite element space on is
For scalar/vector piecewise continuous functions defined on , we denote
where denotes the limit taken from within the triangle . The outer unit normal on each triangle is given by
and the discrete surface gradient of is constant on each triangle and defined by
The discrete surface area of is denoted by
For a nondegenerate current polyhedral surface with vertex vector , its area variation in direction is
Here is identified with its field on the current surface. This is the surface analogue of (4.1) for the Newton energy row; the gradients in the dissipation term remain on the frozen predictor.
Mean curvature flow and surface diffusion. Let denote the sum of the two principal curvatures (rather than their average), with the sign convention
For mean curvature flow, , and the surface area satisfies
The augmented velocity is , with the same curvature relation and area-dissipation law. The first variation then gives , so the augmentation reduces to mean curvature flow whenever . For mean curvature flow, set in (5.1). All surfaces share a fixed mesh connectivity. The map and historical position fields are represented on the predicted surface by nodal identification; scalar test functions belong to its continuous piecewise affine space, and vector test functions to its three-component counterpart.
The nonnegativity of again gives .
For surface diffusion, the normal velocity and surface-area dissipation are
The corresponding augmented velocity equation is
Set . The ES-BDF3 surface-diffusion system follows from (5.3) by replacing with , with , and with , using the surface finite element spaces above.
Numerical experiments
We examine geometric accuracy, energy decay, mesh distribution, and nonlinear iteration counts for the numerical schemes presented in Sections 3 and 5. Shrinking circles and spheres provide exact smooth benchmarks.
Curve evolution
We consider CSF, curve diffusion (CDF), and anisotropic curve diffusion. Since tangential motion may lead to different parametrizations of the same geometric curve, we measure geometric differences using the manifold distance. For two simple closed curves and enclosing bounded regions and , respectively, the manifold distance is defined by [20]
When no exact solution is available, we use the Cauchy difference
Under an asymptotic expansion in which the successive geometric differences are proportional to , an observed order can be estimated, when a positive solution exists, from
For positive differences and , a positive root exists uniquely precisely when
The right-hand side of (47) is strictly increasing in , with the displayed threshold as its limit. Zero differences or failure of this condition make the positive-order estimate undefined. For a constant refinement ratio , this reduces to
In the experiments below, the spatial and temporal resolutions are generally refined simultaneously. The resulting values of should therefore be interpreted as observed orders along the specified coupled space–time refinement paths, rather than as estimates obtained with a fixed spatial discretization. In particular, along , a second-order spatial error is also ; a slope close to on this path does not isolate the temporal order. The symmetric-difference area measures geometric agreement, not an error in a particular parametrization.
At the continuous level, the Lagrange multiplier vanishes for the flows considered here under the nondegeneracy conditions stated in § 4. We therefore use
as a diagnostic of the discrete multiplier and its decay under refinement.
We also monitor the normalized energy , the number of Newton iterations, and the mesh ratio
These quantities respectively describe the discrete energy evolution, nonlinear iteration behavior, and mesh distribution.
Example 1 (Curve-shortening flow, CSF). The initial polygon has equally spaced vertices on the unit circle. The exact solution is
For this example, define the geometric and curvature errors by
For either error , the observed order between two resolutions is
Figure 2 shows the convergence results for the shrinking-circle benchmark. Under the refinements used in this experiment, the manifold-distance and curvature errors display the expected second-, third-, and fourth-order trends for ES-BDF2, ES-BDF3, and ES-BDF4, respectively. The multiplier magnitude also decreases at a high-order rate under refinement. The second row of Figure 2 gives the numerical performance of the scheme ES-BDF3. As shown in this figure, the perimeter decreases monotonically, consistent with Proposition 2.4; the multiplier remains close to zero, and the Newton iteration count always stays 3 during the evolution.

Figure 2. Convergence results and representative diagnostics for CSF with a unit-circle initial curve. (a)–(c): log-log plots of , , and at for the ES-BDF schemes; (d)–(f): evolution of the normalized perimeter, Lagrange multiplier, and Newton iteration count for ES-BDF3 with and .
Example 2 (Curve diffusion flow, CDF). We next consider CDF starting from a ellipse. Since no exact solution is available, convergence is assessed by Cauchy differences in the manifold distance along coupled space–time refinement paths. We set and use , , and for the second-, third-, and fourth-order schemes, respectively.
The first row of Figure 3 compares the observed convergence behavior. ES-BDF2 and BGN-LM-BDF2 exhibit comparable second-order trends. For the third-order schemes, ES-BDF3 and BGN/BDF3 display rates close to three along the reported refinement path. BGN-LM-BDF3 shows a lower observed rate on the coarser computations and approaches third-order behavior after the time-step coefficient is reduced from 0.05 to 0.01.

Figure 3. Convergence results and diagnostics for CDF starting from a ellipse. First row: Cauchy-type convergence tests for the reported BDF schemes at ; Second row: ES-BDF3 diagnostics with and up to : (d) normalized perimeter; (e) Lagrange multiplier; (f) Newton iteration count and mesh ratio .
The same experiment also compares two treatments of the midpoint data in ES-BDF3. Replacing the staggered half-integer solve by a first-order half-step predictor produces larger errors over the tested refinement range. This numerical comparison supports the use of a higher-order midpoint reconstruction in the Simpson energy update. ES-BDF4 displays an approximately fourth-order trend along its reported refinement path. The second row of Figure 3 shows representative ES-BDF3 diagnostics. The normalized perimeter decreases monotonically, the multiplier remains close to zero, and the Newton iteration count and mesh ratio remain bounded over the reported time interval.
Example 3 (Anisotropic curve diffusion). We next consider anisotropic curve diffusion using the formulation introduced in § 4. The initial curve is an ellipse with semi-major axis 2 and semi-minor axis 1, and the anisotropic energy density is
Since no exact solution is available, convergence is assessed by the generalized Cauchy procedure in (47). We take and use the coupled refinement paths , , and for ES-BDF2, ES-BDF3, and ES-BDF4, respectively. The convergence test is terminated at . Here , so the test lies in the weakly anisotropic regime.
Table 2 shows observed orders close to two and three for ES-BDF2 and ES-BDF3 over most of the reported refinement range. The ES-BDF4 results exhibit observed orders between approximately 3.5 and 3.7 over the tested range. The data therefore indicate convergence at a rate above three, but do not yet resolve a fourth-order asymptotic regime.
| ES-BDF2 | ES-BDF3 | ES-BDF4 | ||||||
| order | order | order | ||||||
| 1/320 | 1.555e−1 | – | 1/180 | 5.390e−2 | – | 1/200 | 3.071e−3 | – |
| 1/640 | 3.621e−2 | 2.10 | 1/320 | 8.684e−3 | 2.98 | 1/240 | 1.382e−3 | 3.72 |
| 1/1280 | 8.575e−3 | 2.08 | 1/500 | 2.083e−3 | 2.96 | 1/280 | 6.994e−4 | 3.71 |
| 1/2560 | 1.947e−3 | 2.14 | 1/720 | 6.282e−4 | 3.02 | 1/320 | 3.920e−4 | 3.59 |
| 1/5120 | 3.930e−4 | 2.31 | 1/980 | 2.465e−4 | 2.73 | 1/360 | 2.364e−4 | 3.52 |
Table 2. Convergence results for anisotropic curve diffusion with , , and . The coupled space–time refinement paths are for ES-BDF2, for ES-BDF3, and for ES-BDF4.
For the longer simulation up to , we use and . Figure 4 shows the evolution of the curve under the anisotropic flow. Figure 5 reports the normalized anisotropic energy and the Lagrange multiplier. The discrete anisotropic energy decreases monotonically, while the multiplier remains close to zero over the reported interval, consistent with the continuous relation.

Figure 4. Evolution of the curve under anisotropic curve diffusion at , , , and .

Figure 5. Evolution of the normalized anisotropic energy (left) and Lagrange multiplier (right) up to .
Surface evolution
To monitor the evolving triangulation, we use the two mesh-distribution indicators introduced in [21]. At , they are defined by
and
Thus is the ratio of the largest to the smallest edge length, while is the corresponding ratio of triangle areas. These quantities provide simple diagnostics of edge-length and element-area variation during the evolution.
Example 4 (Mean curvature flow, MCF). We first consider MCF starting from the unit sphere. The exact solution remains spherical with radius
We measure the geometric error by the maximal radial deviation
Following [21], the initial triangulation contains triangles and vertices. The fine spatial resolution is used to reduce the contribution of the spatial discretization error in this temporal-refinement test. Observed temporal slopes are informative only over the range where the spatial error and solver error are smaller than the time-discretization error.
For the three methods tested in Figure 6(a), ES-BDF1, ES-BDF2, and ES-BDF3 show approximately first-, second-, and third-order trends, respectively. The surface area decreases monotonically, and the mesh indicators and remain bounded over the reported evolution.

Figure 6. Results for MCF starting from the unit sphere, for ES-BDF1, ES-BDF2, and ES-BDF3. (a) Maximal radial deviation ; (b) Triangle-area ratio ; (c) Edge-length ratio ; (d) Surface area ; (e) Lagrange multiplier; (f) Newton iteration count.
Figure 6(d)–(Figure 6f) compare the surface-area, multiplier, and Newton-iteration histories. The surface-area curves produced by the three schemes are close. The Lagrange multipliers remain small, with smaller magnitudes observed for the higher-order schemes in this test. The Newton iteration counts are also of comparable size for the three discretizations.
We next consider the torus
using and . Figure 7 shows the numerical evolution toward the singular regime. The final pinch-off times for ES-BDF1, ES-BDF2, and ES-BDF3 are 0.145, 0.137, and 0.135, respectively, which are consistent with the numerical value 0.138 reported in [5].

Figure 7. Numerical evolution of the torus under MCF with and . First row: ES-BDF1 at , , , and ; second row: ES-BDF2 at , , and ; third row: ES-BDF3 at , , and .
Example 5 (Surface diffusion flow, SDF). Finally, we consider SDF of an cigar-like surface obtained by capping a cylinder of diameter 1 and length 7 with two hemispheres. The initial mesh contains elements and vertices, respectively, and we choose .
Figure 8 compares the evolutions produced by ES-BDF1, ES-BDF2, and ES-BDF3. The surface develops a progressively narrower neck and becomes nonconvex, and finally pinches off. The final pinch-off times are 0.257, 0.245, and 0.243 for ES-BDF1, ES-BDF2, and ES-BDF3, respectively. Compared to the pinch-off resolution, the

Figure 8. Numerical evolution of the cigar-like surface under surface diffusion with and . First row: ES-BDF1 at , , , and ; second row: ES-BDF2 at , , and ; third row: ES-BDF3 at , , and .
values produced by ES-BDF2 and ES-BDF3 are much closer than to the value by ES-BDF1.
Figure 9 shows monotone area decay for all three schemes. The ES-BDF2 and ES-BDF3 energy curves remain close, while their separation from ES-BDF1 grows near the pinch-off time. The multiplier evolution shows a similar pattern, and the Newton iteration counts are comparable. Since the continuous Lagrange multiplier vanishes, its discrete magnitude keeps very close to 0 during the evolution, but exhibit abruptly increasing when the evolution approaches the pinch-off time, shown in Figure 9(b). The pinch-off time produced by ES-BDF3, 0.243, is consistent with the numerical value 0.2431 reported in the literature [5].

Figure 9. Numerical diagnostics for ES-BDF, , applied to surface diffusion of the cigar-like surface: (a) Normalized surface area; (b) Lagrange multiplier; (c) Newton iteration count.
Conclusions
We have developed energy-increment BDF methods for geometric flows within the BGN parametric finite element framework. The formulation replaces the multistep energy-derivative equation by a quadrature approximation of the integrated energy balance while retaining the BDF geometric equations. For BDF3 and BDF4, positive Simpson weights ensure decay of the original discrete geometric energy separately on each interleaved time grid for every nondegenerate solution satisfying the scalar constraint exactly. The analysis establishes conditional scalar consistency, a regularity criterion for the ES-BDF3 Newton system in curve shortening flow, and residual-based bounds on energy-balance errors. The smooth benchmarks exhibit accuracy trends consistent with the design orders under the reported refinements. The curve-diffusion comparison supports the importance of accurate midpoint data, while representative curve and surface tests document energy decay and mesh evolution. A complete solvability and convergence analysis of the coupled scheme remains to be established, requiring joint control of initialization, predicted geometry, midpoint data, and nonlinear solution errors.
References
- [1]W. Bao, W. Jiang, and Y. Li, A symmetrized parametric finite element method for anisotropic surface diffusion of closed curves, SIAM J. Numer. Anal., 61 (2023), pp. 617–641, https://doi.org/10.1137/22M1500575.
- [4]J. W. Barrett, H. Garcke, and R. Nürnberg, A parametric finite element method for fourth order geometric evolution equations, J. Comput. Phys., 222 (2007), pp. 441–467, https://doi.org/10.1016/j.jcp.2006.07.026.
- [5]J. W. Barrett, H. Garcke, and R. Nürnberg, On the parametric finite element approximation of evolving hypersurfaces in R³, J. Comput. Phys., 227 (2008), pp. 4281–4307, https://doi.org/10.1016/j.jcp.2007.11.023.
- [6]J. W. Barrett, H. Garcke, and R. Nürnberg, Parametric approximation of Willmore flow and related geometric evolution equations, SIAM J. Sci. Comput., 31 (2008), pp. 225–253, https://doi.org/10.1137/070700231.
- [7]J. W. Barrett, H. Garcke, and R. Nürnberg, Parametric finite element approximations of curvature-driven interface evolutions, in Handbook of numerical analysis, vol. 21, Elsevier, 2020, pp. 275–423, https://doi.org/10.1016/bs.hna.2019.05.002.
- [8]F. Cao, Geometric curve evolution and image processing, Springer Science & Business Media, 2003.DOI
- [9]F. Davi and M. E. Gurtin, On the motion of a phase interface by surface diffusion, Z. Angew. Math. Phys., 41 (1990), pp. 782–811, https://doi.org/10.1007/BF00945835.
- [11]B. DUAN, B. LI, AND Z. ZHANG, High-order fully discrete energy diminishing evolving surface finite element methods for a class of geometric curvature flows, Ann. Appl. Math., 37 (2021), pp. 405–436, https://doi.org/10.4208/aam.OA-2021-0007.
- [12]C. M. ELLIOTT AND B. STINNER, Modeling and computation of two phase geometric biomembranes using surface finite elements, J. Comput. Phys., 229 (2010), pp. 6585–6612.DOI
- [13]Z. FU, J. SHEN, AND J. YANG, Higher-order energy-decreasing exponential time differencing Runge–Kutta methods for gradient flows, Sci. China Math., 68 (2025), pp. 1727–1746, https://doi.org/10.1007/s11425-024-2337-3.
- [14]Z. FU, T. TANG, AND J. YANG, Energy diminishing implicit-explicit Runge–Kutta methods for gradient flows, Math. Comp., 93 (2024), pp. 2745–2767, https://doi.org/10.1090/mcom/4021.
- [16]H. GARCKE, W. JIANG, C. SU, AND G. ZHANG, Structure-preserving parametric finite element method for surface diffusion based on Lagrange multiplier approaches, SIAM J. Sci. Comput., 47 (2025), pp. A1983–A2011, https://doi.org/10.1137/24M1687546.
- [17]Y. GUO AND M. LI, Structure-preserving parametric finite element methods for anisotropic surface diffusion flow with minimal deformation formulation, Comput. Phys. Commun., 313 (2025), p. 109620, https://doi.org/10.1016/j.cpc.2025.109620.
- [19]F. HUANG AND J. SHEN, A new class of implicit-explicit BDFk SAV schemes for general dissipative systems and their error analysis, Comput. Methods Appl. Mech. Engrg., 392 (2022), p. 114718, https://doi.org/10.1016/j.cma.2022.114718.
- [20]W. JIANG, C. SU, AND G. ZHANG, A second-order in time, BGN-based parametric finite element method for geometric flows of curves, J. Comput. Phys., 514 (2024), p. 113220, https://doi.org/10.1016/j.jcp.2024.113220.
- [21]W. JIANG, C. SU, AND G. ZHANG, Stable backward differentiation formula time discretization of BGN-based parametric finite element methods for geometric flows, SIAM J. Sci. Comput., 46 (2024), pp. A2874–A2898, https://doi.org/10.1137/23M1625597.
- [22]W. JIANG, C. SU, G. ZHANG, AND L. ZHANG, Predictor-corrector, BGN-based parametric finite element methods for surface diffusion, J. Comput. Phys., 530 (2025), p. 113901, https://doi.org/10.1016/j.jcp.2025.113901.
- [23]Y. LI AND W. BAO, An energy-stable parametric finite element method for anisotropic surface diffusion, J. Comput. Phys., 446 (2021), p. 110658, https://doi.org/10.1016/j.jcp.2021.110658.
- [24]S. MA AND Q. RAO, High-order energy-stable BGN parametric finite element methods for geometric flows, arXiv preprint arXiv:2608.29877, (2026), https://doi.org/10.48550/arXiv.2608.29877.
- [25]J. SHEN, J. XU, AND J. YANG, The scalar auxiliary variable (SAV) approach for gradient flows, J. Comput. Phys., 353 (2018), pp. 407–416, https://doi.org/10.1016/j.jcp.2017.10.021.
- [26]J. SHEN, J. XU, AND J. YANG, A new class of efficient and robust energy stable schemes for gradient flows, SIAM Rev., 61 (2019), pp. 474–506, https://doi.org/10.1137/17M1150153.
- [27]G. ZHANG, B. D. ANDREWS, AND P. E. FARRELL, Arbitrary-order structure-preserving discretizations for geometric curvature flows, arXiv:2605.20371, 2026, https://doi.org/10.48550/arXiv.2605.20371.
