Search arXiv⌕ Search

arXiv · 2610.30454

Energy-rate equidistribution for adaptive SSAV--BDF2 integration of gradient flows

Abstract

We develop an adaptive time-stepping strategy for scalar auxiliary variable (SAV) schemes combined with variable-step BDF2 discretization for gradient flows. The strategy selects step sizes based on the instantaneous energy dissipation rate and enforces monotonicity of a computable symmetric energy through a step rejection mechanism. We show that the step-size rules used in practice correspond to equidistributing a monitor function along the energy curve, connecting energy-adaptive time stepping to the classical theory of r-adaptive mesh methods. The monitor $g = |\dot{E}|$ is asymptotically optimal as it minimises the leading-order maximum symmetric-energy discrepancy for a given number of steps. A combined monitor that switches to $g = \sqrt{|\dot{E}|}$ near equilibrium caps step growth without degrading this error bound. The arclength parameter $β$ used in prior work is shown to be the ratio of the largest permitted step to the energy-error tolerance. The controller is paired with the SSAV--BDF2 discretization. Accepted steps satisfy monotonicity of the symmetric energy, from which we deduce a bound on the physical energy that is uniform in the number of steps, $\sup_n E(u^n) \le E(u^{0}) + τ_1 + O(Δt_{\max}^2)$, and the scheme achieves second-order global accuracy under standard step-ratio restrictions. Numerical experiments on Cahn--Hilliard, Ohta--Kawasaki, Phase--Field Crystal, and functionalized Cahn--Hilliard models confirm the theory and demonstrate the method's efficiency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Suki Shergill, JF Williams. 2026-10-21. Energy-rate equidistribution for adaptive SSAV--BDF2 integration of gradient flows. https://arxiv.org/abs/2610.30454

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Puzzle Game: Prediction and Classification of Wordle Solution Words

Wordle result prediction involves both daily participation and the difficulty of the solution word. We model these quantities with ARIMA forecasts of report counts, XGBoost regressors using word frequency, letter entropy, and repetition, and a decision tree trained on K-means difficulty tiers. Experiments use 355 daily outcome distributions, with a 107-word chronological holdout and four expanding-window tests. XGBoost reduces holdout mean absolute error from 4.08 to 3.84 percentage points and improves over the training mean in every temporal window. Ridge and random forests remain competitive. XGBoost systematically underestimates failure rates on difficult words. The lexical decision tree achieves 54.2% tier accuracy, compared with 40.2% when predicted histograms are assigned to the same training centroids. Bootstrap analysis shows that cluster stability does not imply that tiers are predictable from lexical attributes. For report counts, comparisons at matched horizons reveal substantial overdispersion in full-history ARIMA intervals. These results characterize the predictive value and limitations of a compact lexical model of reported Wordle performance.

math.NA↗

Optimal Convergence of Quadratic Not-a-Knot Spline Interpolation on Arbitrary Partitions

The not-a-knot condition provides a simple spline interpolation scheme that requires no derivative data at the endpoints. Whereas the classical not-a-knot scheme using odd-degree splines selects knots that coincide with the data points, this approach does not extend to the even-degree case. In this paper we establish the well-posedness of the not-a-knot interpolation problem for even-degree splines, where knots are selected at midpoints of data values. We then show that the quadratic case, introduced in [M. J. D. Powell, Approximation Theory and Methods, Cambridge University Press, 1981], achieves $\mathcal{O}(h^3)$ convergence for $C^3$ functions on arbitrary partitions without mesh-ratio restrictions. The proof derives a linear system defining the interpolating spline, normalizes the system to bound the matrix norm of its inverse using a Neumann-series argument, and establishes global error bounds.

math.NA↗

Piecewise $P_2$ finite element space on rectangular meshes in arbitrary dimensions for the biharmonic equation

This paper develops a piecewise $P_2$ finite element space on rectangular meshes in arbitrary dimensions for the biharmonic equation. The discrete space imposes continuity of vertex sums on $(d-2)$-faces and of averaged normal derivatives across interior $(d-1)$-faces. A local algebraic characterization of $P_2$ is first established through the unisolvence of an enriched polynomial space and the resulting compatibility conditions. For each interior element, a $3^d$-element patch is then introduced, and the associated homogeneous patch space is shown to be one-dimensional. The corresponding patch functions, extended by zero, form a basis of the global homogeneous discrete space. A local quadratic interpolation operator is further constructed in arbitrary dimensions. Its approximation properties, together with a consistency estimate derived from the weak continuity conditions, lead to the optimal broken $H^2$ error estimate for the biharmonic problem.

math.NA↗