Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.19117

Numerical Ergodicity and Optimal Strong Error Estimates for a Class of Novel Tamed Schemes to Superlinear SPDEs

Zhihui Liu·Jie Shen
View original source ↗Read source document ↗Export metadata ↓

Abstract

We construct a class of novel tamed schemes for superlinear stochastic partial differential equations (SPDEs), including the stochastic Allen--Cahn equation driven by either multiplicative or additive noise. The schemes preserve the same Lyapunov structure as the original system, and we rigorously establish their longtime unconditional stability. Furthermore, we prove that the corresponding Galerkin-based fully discrete tamed schemes inherit the unique ergodicity of the underlying SPDEs and achieve optimal strong convergence rates in both the multiplicative and additive noise cases.

Explore related subjects

math.NAcs.NA

Keep this discovery

BibTeXRIS

Zhihui Liu, Jie Shen. 2026-09-02. Numerical Ergodicity and Optimal Strong Error Estimates for a Class of Novel Tamed Schemes to Superlinear SPDEs. https://arxiv.org/abs/2502.19117

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

Discover connections

cs.NA subjectmath.NA subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT↗
arXiv2026

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA↗
arXiv2021

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA↗