Strong convergence of a fully discrete scheme for stochastic Burgers equation with fractional-type noise
Pith reviewed 2026-05-23 22:17 UTC · model grok-4.3
The pith
A spectral Galerkin plus nonlinear-tamed exponential Euler scheme for the stochastic Burgers equation with fractional Brownian motion converges strongly.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The fully discrete scheme converges strongly to the mild solution of the stochastic Burgers equation. After establishing exponential integrability of the stochastic convolution of the fractional Brownian motion, the paper shows that both the semi-discrete and fully discrete approximations have uniformly bounded moments; it then proves convergence in probability by a stopping time technique and obtains strong convergence as a consequence.
What carries the argument
The nonlinear-tamed accelerated exponential Euler method, which stabilizes the nonlinear term while integrating the linear part exactly and is paired with spectral Galerkin spatial discretization.
If this is right
- The semi-discrete Galerkin approximations possess uniformly bounded moments of all orders.
- The fully discrete approximations also possess uniformly bounded moments.
- Convergence in probability of the fully discrete scheme to the true solution holds.
- Strong convergence in L^p follows directly from the combination of moment boundedness and convergence in probability.
Where Pith is reading between the lines
- Strong convergence would allow pathwise error control when simulating individual realizations of the solution.
- The stopping-time technique for probability convergence might transfer to other semilinear SPDEs with similar noise regularity.
- The taming parameter in the time integrator could be tuned to recover optimal convergence rates for specific values of H.
Load-bearing premise
The Hurst parameter of the fractional Brownian motion lies strictly between one half and one, supplying the regularity and exponential integrability needed for the moment bounds and stopping-time argument.
What would settle it
A concrete numerical test in which the strong error between the computed solution and a high-resolution reference fails to approach zero when both spatial mesh size and time step are driven to zero under the stated conditions on H.
read the original abstract
We investigate numerical approximations for the stochastic Burgers equation driven by an additive cylindrical fractional Brownian motion with Hurst parameter $H \in (\frac{1}{2}, 1)$. To discretize the continuous problem in space, a spectral Galerkin method is employed, followed by the presentation of a nonlinear-tamed accelerated exponential Euler method to yield a fully discrete scheme. By showing the exponential integrability of the stochastic convolution of the fractional Brownian motion, we present the boundedness of moments of semi-discrete and full-discrete approximations. Building upon these results and the convergence of the fully discrete scheme in probability proved by a stopping time technique, we derive the strong convergence of the proposed scheme.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops a spectral Galerkin spatial discretization combined with a nonlinear-tamed accelerated exponential Euler time-stepping scheme for the stochastic Burgers equation driven by additive cylindrical fractional Brownian motion with Hurst parameter H ∈ (1/2, 1). It first establishes exponential integrability of the stochastic convolution to obtain uniform moment bounds on the semi-discrete and fully discrete approximations, then uses a stopping-time argument to prove convergence in probability of the fully discrete scheme, and finally upgrades this to strong convergence.
Significance. If the moment bounds are shown to be uniform with respect to the discretization parameters, the result would constitute a useful extension of strong-convergence theory to SPDEs with fractional noise and superlinear drift, employing a practical tamed exponential integrator. The approach builds on standard techniques (exponential moments, stopping times) but applies them to a fully discrete setting that is relevant for computation.
major comments (1)
- [sections establishing moment bounds for the fully discrete scheme and the passage from convergence in probability to L^p] The exponential integrability of the continuous stochastic convolution is used to bound moments of the approximations, but the manuscript must explicitly verify that the resulting moment constants remain independent of the number of Galerkin modes N and the time step Δt after accounting for the spectral projection error and the taming truncation in the exponential Euler step. Without this uniformity, the stopping-time argument cannot be guaranteed to produce strong convergence whose rate does not deteriorate under refinement.
minor comments (2)
- [abstract] The abstract and introduction should state the precise norm and rate (if any) in which strong convergence is obtained.
- [introduction and scheme definition] Notation for the fully discrete solution (e.g., u^{N,Δt}_n) and the precise form of the taming function should be introduced earlier for readability.
Simulated Author's Rebuttal
We thank the referee for the careful reading and the constructive major comment. We address the concern regarding uniformity of moment bounds point by point below.
read point-by-point responses
-
Referee: [sections establishing moment bounds for the fully discrete scheme and the passage from convergence in probability to L^p] The exponential integrability of the continuous stochastic convolution is used to bound moments of the approximations, but the manuscript must explicitly verify that the resulting moment constants remain independent of the number of Galerkin modes N and the time step Δt after accounting for the spectral projection error and the taming truncation in the exponential Euler step. Without this uniformity, the stopping-time argument cannot be guaranteed to produce strong convergence whose rate does not deteriorate under refinement.
Authors: We agree that explicit verification of parameter-independent constants is essential for rigor. In the proofs establishing exponential integrability of the stochastic convolution (Section 2) and the subsequent moment bounds for the semi-discrete (Section 3) and fully discrete (Section 4) approximations, the constants arise from the Burkholder-Davis-Gundy inequality applied to the fractional noise and from a tamed Gronwall inequality; these depend only on the equation coefficients, the Hurst index H, and the taming threshold, none of which involve N or Δt. The spectral projection error is absorbed using the smoothing property of the analytic semigroup and the Hölder regularity of the cylindrical fBm, yielding a bound independent of the dimension of the Galerkin space. The nonlinear taming ensures that, on the stopped processes used in the convergence-in-probability argument, the truncation does not introduce N- or Δt-dependent growth. Nevertheless, to make this independence fully transparent, we will insert a dedicated remark (or short lemma) immediately after the moment-bound theorems that explicitly states the constants are uniform in N and Δt and traces the dependence through the estimates. With this clarification the stopping-time argument carries through unchanged and the strong-convergence result remains valid. revision: yes
Circularity Check
No significant circularity; derivation uses independent analytic steps
full rationale
The paper's chain proceeds by first proving exponential integrability of the continuous stochastic convolution (for H in (1/2,1)), then using that to obtain uniform moment bounds on the semi-discrete and fully discrete approximations, separately establishing convergence in probability via a stopping-time argument, and finally combining the two to obtain strong convergence. None of these steps is shown to reduce by definition or by fitting to the final claim; the moment bounds and stopping-time argument are presented as separate analytic results rather than tautologies or self-referential fits. No load-bearing self-citations or imported uniqueness theorems appear in the provided derivation outline.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Hurst parameter H ∈ (1/2, 1)
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
By showing the exponential integrability of the stochastic convolution of the fractional Brownian motion, we present the boundedness of moments of semi-discrete and full-discrete approximations. Building upon these results and the convergence of the fully discrete scheme in probability proved by a stopping time technique, we derive the strong convergence
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Lemma 3.5. For any ˜c > 0 and N ∈ N, there exists η ≥ 0, such that E[ e^{˜c ∫_0^T (∥ON,η_t∥_{L^∞}^2 +1) dt} ] < ∞
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
A. Alabert, I. Gynogy, On numerical approximation of stochastic Burgers’ equation, Springer Berlin, 2006
work page 2006
- [2]
- [3]
-
[4]
F. Biagini, Y.Z. Hu, B. ∅ksendal, T.S. Zhang, Stochastic calculus for fractional Brownian motion and applications, Springer London, 2008
work page 2008
-
[5]
D. Bl¨ omker, M. Kamrani, S.M. Hosseini, Full discretization of the stochastic Burgers equation with correlated noise, IMA J. Numer. Anal., 33 (2013) 825-848
work page 2013
-
[6]
D. Bl¨ omker, A. Jentzen, Galerkin approximations for the stochastic Burgers equation, SIAM J. Numer. Anal., 51 (2013) 694-715
work page 2013
-
[7]
C.E. Br´ ehier, J.B. Cui, J.L. Hong, Strong convergence rates of semi-discrete splitting approx- imations for stochastic Allen–Cahn equation, IMA J. Numer. Anal., 39 (2019) 2096-2134
work page 2019
- [8]
-
[9]
E. Carelli, A. Prohl, Rates of convergence for discretizations of the stochastic incompressible Navier–Stokes equations, SIAM J. Numer. Anal., 50 (2012) 2467-2496
work page 2012
-
[10]
A. Chekhlov, V. Yakhot, Kolmogorov turbulence in a random-force-driven Burgers equation, Phys. Rev. E, 51 (1995) 2739-2742
work page 1995
-
[11]
G. Da Prato, A. Debussche, R. Temam, Stochastic Burgers’ equation, Nonlinear Differential Equations and Applications, 1 (1994) 389-402
work page 1994
-
[12]
G. Da Prato, D. Gatarek, Stochastic Burgers equation with correlated noise, Stochastics, 52 (1995) 29-41
work page 1995
-
[13]
G. Da Prato, J. Zabczyk, Stochastic equations in infinite dimensions, Cambridge University Press, 2014
work page 2014
- [14]
-
[15]
C. Gugg, H. Kielh¨ ofer, M. Niggemann, On the approximation of the stochastic Burgers equation, Commun. Math. Phys., 230 (2002) 181-199. 22
work page 2002
- [16]
-
[17]
M. Hutzenthaler, A. Jentzen, F. Lindner, P. Puˇ snik, Strong convergence rates on the whole probability space for space-time discrete numerical approximation schemes for stochastic Burgers equations, arXiv:1911.01870, 2019
-
[18]
M. Hutzenthaler, A. Jentzen, D. Salimova, Strong convergence of full-discrete nonlinearity- truncated accelerated exponential Euler-type approximations for stochastic Kuramoto– Sivashinsky equations, Commun. Math. Sci., 16 (2018) 1489-1529
work page 2018
-
[19]
M. Hutzenthaler, R. Link, Strong convergence rates for full-discrete approximationsof stochas- tic Burgers equations with multiplicative noise, arXiv:2210.17536, 2022
-
[20]
Jeng, Forced model equation for turbulence, Phys
D.T. Jeng, Forced model equation for turbulence, Phys. Fluids, 12 (1969) 2006-2010
work page 1969
-
[21]
A. Jentzen, D. Salimova, T. Welti, Strong convergence for explicit space-time discrete numerical approximation methods for stochastic Burgers equations, arXiv:1710.07123, 2017
work page internal anchor Pith review arXiv 2017
-
[22]
F. Khan, Higher order pathwise approximation for the stochastic Burgers’ equation with additive noise, Appl. Numer. Math., 162 (2021) 67-80
work page 2021
-
[23]
Kolmogorov, Wienersche Spiralen und einige andere interessante Kurven im Hilbertschen Raum
A.N. Kolmogorov, Wienersche Spiralen und einige andere interessante Kurven im Hilbertschen Raum. C.R. (Doklady) Acad. Sci. URSS (N.S.) 26 (1940) 115-118
work page 1940
-
[24]
Kotelenez, A stochastic Navier–Stokes equation for the vorticity of a two-dimensional fluid, Ann
P. Kotelenez, A stochastic Navier–Stokes equation for the vorticity of a two-dimensional fluid, Ann. Appl. Probab., 5 (1995) 1126-1160
work page 1995
- [25]
-
[26]
B.B. Mandelbrot, J.W. Van Ness, Fractional Brownian motions, fractional noises and applications, SIAM Rev., 10 (1968) 422-437
work page 1968
-
[27]
D.G. Pe´ rez, L. Zunino, M. Garavaglia, Modeling turbulent wave-front phase as a fractional Brownian motion: a new approach, J. Opt. Soc. Am. A, 21 (2004) 1962-1969
work page 2004
-
[28]
Rothe, Global solutions of reaction-diffusion systems, Springer Berlin, 1984
F. Rothe, Global solutions of reaction-diffusion systems, Springer Berlin, 1984
work page 1984
-
[29]
Stroock, Probability Theory, Cambridge University Press, 2011
D.W. Stroock, Probability Theory, Cambridge University Press, 2011
work page 2011
-
[30]
G.L. Wang, M. Zeng, B.L. Guo, Stochastic Burgers’ equation driven by fractional Brownian motion, J. Math. Anal. Appl., 371 (2010) 210-222
work page 2010
-
[31]
X.J. Wang, An efficient explicit full-discrete scheme for strong approximation of stochastic Allen-Cahn equation, Stoch. Process. Appl., 130 (2020) 6271-6299
work page 2020
- [32]
-
[33]
W. Wu, S.B. Cui, J.Q. Duan, Global well-posedness of the stochastic generalized Kuramoto– Sivashinsky equation with multiplicative noise, Acta Mathematicae Applicatae Sinica, English Series, 34 (2018) 566-584. 23
work page 2018
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.