Strong Approximation of Stochastic Burgers Equations with Space-Time White Noise

In this paper, we establish algebraic strong convergence rates for spectral Galerkin and fully discrete approximations of the stochastic Burgers equation driven by additive space--time white noise. For deterministic initial data in $H^1$, the spectral approximation is shown to be convergent in the spatial supremum norm, uniformly in time and in every finite probability moment, with order arbitrarily close to $1/2$. Furthermore, we prove that an accelerated fully tamed exponential method possesses spatial and temporal strong convergence orders arbitrarily close to $1/2$ and $1/4$ under a CFL condition. The key to our analysis is a polynomial stability estimate for the conservative Burgers flux, which allows us to control the nonlinear error using polynomial moment bounds for the exact and numerical solutions. To the best of our knowledge, these are the first algebraic strong convergence rates on the whole probability space for this equation with additive space--time white noise.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16930
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Strong Approximation of Stochastic Burgers Equations with Space-Time White Noise

Jianbo Cui, Liying Sun
arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
preprint

Strong Approximation of Stochastic Burgers Equations with Space-Time White Noise

Jianbo Cui, Liying Sun
preprint en

Abstract

In this paper, we establish algebraic strong convergence rates for spectral Galerkin and fully discrete approximations of the stochastic Burgers equation driven by additive space--time white noise. For deterministic initial data in $H^1$, the spectral approximation is shown to be convergent in the spatial supremum norm, uniformly in time and in every finite probability moment, with order arbitrarily close to $1/2$. Furthermore, we prove that an accelerated fully tamed exponential method possesses spatial and temporal strong convergence orders arbitrarily close to $1/2$ and $1/4$ under a CFL condition. The key to our analysis is a polynomial stability estimate for the conservative Burgers flux, which allows us to control the nonlinear error using polynomial moment bounds for the exact and numerical solutions. To the best of our knowledge, these are the first algebraic strong convergence rates on the whole probability space for this equation with additive space--time white noise.

arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon