Search arXiv⌕ Search

arXiv · 2610.01063

Positivity-preserving scalar auxiliary variable schemes for gradient flows via a quadratic reformulation

Abstract

The scalar auxiliary variable (SAV) method replaces the nonlinear part of the free energy by a positive scalar $r(t)=\sqrt{\mathcal{E}_{_\mathcal{N}}[ϕ]+C}>0$, thereby yielding linear, unconditionally energy-stable schemes for gradient flows. At the discrete level, however, the standard backward Euler and Crank--Nicolson discretizations provide no guarantee that the computed $r^{n+1}$ remains positive, an inconsistency with the continuous definition that contradicts the square-root ansatz and may compromise long-time robustness. Although the SAV method has been widely applied, this subtle but consequential issue has received little attention. We first characterize this failure quantitatively by deriving a sharp criterion and a sufficient condition on the time step size, and construct an explicit counterexample showing that sign loss occurs for parameters of practical relevance. Rather than modifying the definition of $r$ as in existing positivity-preserving variants, we retain the square-root form and reformulate the discrete evolution from $r_t$ to $(r^{2})_t$, which converts the scalar equation into a convex quadratic with a strictly negative constant term, always yielding a unique positive root. For the Crank--Nicolson scheme, the product-form discretization $r^{n+1}r^{n}$ preserves this quadratic structure, while conventional alternatives do not. The resulting schemes incur the same computational cost as the original SAV method and are proved unconditionally energy-stable. Numerical experiments for the Cahn--Hilliard equation confirm the predicted positivity, energy stability, and convergence rates.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qiong-Ao Huang, Zhi-Hao Liu, Ying-Wei Wang, Li-Na Yan. 2026-10-01. Positivity-preserving scalar auxiliary variable schemes for gradient flows via a quadratic reformulation. https://arxiv.org/abs/2610.01063

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

KEEP EXPLORING

Related papers

Neural network-driven domain decomposition for efficient solutions to the Helmholtz equation

Accurately simulating wave propagation is crucial in fields such as acoustics, electromagnetism, and seismic analysis. Traditional numerical methods, like finite difference and finite element approaches, are widely used to solve governing partial differential equations (PDEs) such as the Helmholtz equation. However, these methods face significant computational challenges when applied to high-frequency wave problems in complex two-dimensional domains. This work investigates Finite Basis Physics-Informed Neural Networks (FBPINNs) and their multilevel extensions as a promising alternative. These methods leverage domain decomposition, partitioning the computational domain into overlapping sub-domains, each governed by a local neural network. We assess their accuracy and computational efficiency in solving the Helmholtz equation for the homogeneous case, demonstrating their potential to mitigate the limitations of traditional approaches.

math.NA↗

Differentiating through Stochastic Differential Equations: A Primer

Dynamical systems are essential to model various phenomena in physics, finance, economics, and are also of current interest in machine learning. A central modeling task is investigating parameter sensitivity, whether tuning atmospheric coefficients, computing financial Greeks, or optimizing neural networks. These sensitivities are mathematically expressed as derivatives of an objective function with respect to parameters of interest and are rarely available analytically, necessitating numerical methods for approximating them. While the literature for differentiation of deterministic systems is well-covered, the treatment of stochastic systems, such as stochastic differential equations (SDEs), in most curricula is less comprehensive than what the subtleties arising from the interplay of noise and discretization warrant. This paper provides a primer on numerical differentiation of SDEs organized as a two-tale narrative. Tale 1 demonstrates that differentiating through discretized SDEs, known as the discretize-optimize approach, is reliable for both Itô and Stratonovich calculus. Tale 2 examines the optimize-discretize approach, investigating the continuous limit of adjoint equations from Tale 1 corresponding to the desired gradients. Our aim is to equip readers with a clear guide on the numerical differentiation of SDEs: computing gradients correctly in both Itô and Stratonovich settings, understanding when discretize-optimize and optimize-discretize agree or diverge, and developing intuition for reasoning about stochastic differentiation beyond the cases explicitly covered.

math.NA↗

A discrete gradient scheme for preserving QSR-dissipativity

The notion of dissipative dynamical systems provides a formal description of processes that cannot generate energy internally. For these systems, changes in energy can only occur due to an external energy supply or dissipation effects. Unfortunately, dissipative properties tend to deteriorate in numerical computations, especially in nonlinear systems. Discrete gradient methods can help mitigate this problem. In this paper, we present a class of structure-preserving time discretization schemes based on discrete gradients for a special class of systems that are dissipative with respect to a quadratic supply rate.

math.NA↗