Search arXivSearch

arXiv · 2308.07060

A convergent stochastic scalar auxiliary variable method

Abstract

We discuss an extension of the scalar auxiliary variable approach, which was originally introduced by Shen et al. ([Shen, Xu, Yang, J. Comput. Phys., 2018]) for the discretization of deterministic gradient flows. By introducing an additional scalar auxiliary variable, this approach allows to derive a linear scheme, while still maintaining unconditional stability. Our extension augments the approximation of the evolution of this scalar auxiliary variable with higher order terms, which enables its application to stochastic partial differential equations. Using the stochastic Allen--Cahn equation as a prototype for nonlinear stochastic partial differential equations with multiplicative noise, we propose an unconditionally energy stable, linear, fully discrete finite element scheme based on our augmented scalar auxiliary variable method. Recovering a discrete version of the energy estimate and establishing Nikolskii estimates with respect to time, we are able to prove convergence of discrete solutions towards pathwise unique martingale solutions by applying Jakubowski's generalization of Skorokhod's theorem. A generalization of the Gyöngy--Krylov characterization of convergence in probability to quasi-Polish spaces finally provides convergence of fully discrete solutions towards strong solutions of the stochastic Allen--Cahn equation. Finally, we present numerical simulations underlining the practicality of the scheme and the importance of the introduced augmentation terms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefan Metzger. 2024-09-19. A convergent stochastic scalar auxiliary variable method. https://doi.org/10.1093/imanum%2Fdrae065

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

KEEP EXPLORING

Related papers

A Stabilized Finite Element Method for a Morpho-Visco-Poroelastic Model

Studying the structure of soft tissues is important and relevant in biology, particularly in some diseases, such as tumor growth and dermal contraction after burn injury. Based on the complicated characteristics of the tissue and for the sake of a better understanding of the underlying biomechanics, we propose a mathematical model that combines elastic, viscous, and porous effects with growth or shrinkage due to microstructural changes. The framework is referred to as morpho-visco-poroelasticity. Although the existence results of the solution to the problem are not given in this study, we assess the stability of the equilibria for both the continuous and semi-discrete versions of the model, and the key features of this modelling framework have been discussed. To obtain reliable numerical solutions, a stabilized finite element (FE) scheme is proposed for the morpho-visco-poroelasticity equations to avoid spurious oscillations in the pressure profile; the success of this FE scheme is verified by numerical simulations and convergence investigation in both spatial and temporal aspects. For a more quantitative assessment, the total variation of the pressure profile is evaluated as a function of the stabilization parameter.

math.NA

Efficient third-order iterative algorithms for computing zeros of special functions

This manuscript presents a novel and reliable third-order iterative procedure for computing the zeros of solutions to second-order ordinary differential equations. By approximating the solution of the related Riccati differential equation using the trapezoidal rule, this study has derived the proposed third-order method. This work establishes sufficient conditions to ensure the theoretical non-local convergence of the proposed method. This study provides suitable initial guesses for the proposed third-order iterative procedure to compute all zeros in a given interval of the solutions to second-order ordinary differential equations. The orthogonal polynomials like Legendre and Hermite, as well as the special functions like Bessel, Coulomb wave, confluent hypergeometric, and cylinder functions, satisfy the proposed conditions for convergence. Numerical simulations demonstrate the effectiveness of the proposed theory. This work also presents a comparative analysis with recent studies.

math.NA

Machine-Learning-Enhanced Discretize-then-Project Reduced-Order Modeling of Turbulent Flows on Collocated Grids

This study presents a hybrid reduced-order modeling (ROM) framework for incompressible flows on collocated finite-volume grids, combining a discretize-then-project consistent-flux formulation for velocity and pressure with a non-intrusive neural-network closure for turbulent viscosity. The intrusive formulation preserves discrete mass conservation and pressure-velocity coupling, while a reduced pressure reference-cell constraint fixes pressure gauge ambiguity. We evaluate Multilayer Perceptron (MLP), Transformer, and Long Short-Term Memory (LSTM) closures. For a three-dimensional lid-driven cavity at $Re=100$, the LSTM-based ROM achieves relative errors of 0.7% in velocity and 4% in turbulent viscosity. At $Re=3200$, a mode-sensitivity study identifies $N=15$ POD modes as the best overall configuration, balancing accuracy, dimension, robustness, and cost. It yields a final relative velocity error of approximately 12.3% and an online wall-clock speedup of approximately $50\times$ over the full-order model; energy and enstrophy errors remain below 11% for all three architectures. This regime requires case-specific neural-network retraining and pressure reference-cell parameter retuning. In a time-extrapolation test trained on $t\in[0,3]$,s and rolled out to $t=6$,s, the ROM remains bounded, although velocity and pressure errors increase beyond the training window. The LSTM turbulent-viscosity closure remains robust, identifying long-horizon pressure accuracy as the main limitation. These results demonstrate the potential of consistent projection-based modeling combined with data-driven turbulence closure for efficient reduced-order simulation.

math.NA