Answers are grounded in this paper and cite their sources.
We establish upper bounds for the weak and strong error resulting from a perturbation of the noise driving the stochastic Burgers equation, where we assume the noise to be additive and of trace class and the initial value to be sufficiently regular. More specifically, replacing the covariance operator of the driving noise Q₁ ∈ L₁(L²) in the Burgers equation by a covariance operator Q₂ ∈ L₁(L²) results in a weak error of O(\| (-A)^-1⁻ (Q₁-Q₂) \|L₁(L²)) and a strong error of O(\| (-A)^-1/2⁻|Q₁1/2 -Q₂1/2| \|L₂(L²)). Here \|· \|L₁ is the trace class norm, \|· \|L₂ is the Hilbert-Schmidt norm, and A is the one-dimensional Dirichlet Laplacian that represents the leading term in the Burgers equation. In particular, our results provide upper bounds for the weak and strong error arising when approximating the trace class noise by finite-dimensional noise; the rates we obtain reflect the general philosophy that the weak convergence rate should be twice the strong rate.
No takes yet. Share an insight, caveat, or question.
Cox et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: