English

Pathwise Uniform Convergence of Time Discretisation Schemes for SPDEs

Numerical Analysis 2024-12-19 v5 Numerical Analysis Analysis of PDEs Functional Analysis Probability

Abstract

In this paper, we prove convergence rates for time discretisation schemes for semi-linear stochastic evolution equations with additive or multiplicative Gaussian noise, where the leading operator AA is the generator of a strongly continuous semigroup SS on a Hilbert space XX, and the focus is on non-parabolic problems. The main results are optimal bounds for the uniform strong error Ek:=(Esupj{0,,Nk}U(tj)Ujp)1/p,\mathrm{E}_{k}^{\infty} := \Big(\mathbb{E} \sup_{j\in \{0, \ldots, N_k\}} \|U(t_j) - U^j\|^p\Big)^{1/p}, where p[2,)p \in [2,\infty), UU is the mild solution, UjU^j is obtained from a time discretisation scheme, kk is the step size, and Nk=T/kN_k = T/k. The usual schemes such as the exponential Euler, the implicit Euler, and the Crank-Nicolson method, etc. are included as special cases. Under conditions on the nonlinearity and the noise, we show - Ekklog(T/k)\mathrm{E}_{k}^{\infty}\lesssim k \sqrt{\log(T/k)} (linear equation, additive noise, general SS); - Ekklog(T/k)\mathrm{E}_{k}^{\infty}\lesssim \sqrt{k} \sqrt{\log(T/k)} (nonlinear equation, multiplicative noise, contractive SS); - Ekklog(T/k)\mathrm{E}_{k}^{\infty}\lesssim k \sqrt{\log(T/k)} (nonlinear wave equation, multiplicative noise) for a large class of time discretisation schemes. The logarithmic factor can be removed if the exponential Euler method is used with a (quasi)-contractive SS. The obtained bounds coincide with the optimal bounds for SDEs. Most of the existing literature is concerned with bounds for the simpler pointwise strong error Ek:=(supj{0,,Nk}EU(tj)Ujp)1/p.\mathrm{E}_k:=\bigg(\sup_{j\in \{0,\ldots,N_k\}}\mathbb{E} \|U(t_j) - U^{j}\|^p\bigg)^{1/p}. Applications to Maxwell equations, Schr\"odinger equations, and wave equations are included. For these equations, our results improve and reprove several existing results with a unified method and provide the first results known for the implicit Euler and the Crank-Nicolson method.

Keywords

Cite

@article{arxiv.2303.00411,
  title  = {Pathwise Uniform Convergence of Time Discretisation Schemes for SPDEs},
  author = {Katharina Klioba and Mark Veraar},
  journal= {arXiv preprint arXiv:2303.00411},
  year   = {2024}
}

Comments

Accepted for publication in IMA Journal of Numerical Analysis. 52 pages, 1 figure, added Subsection 6.5 with numerical experiments, changed Proposition 2.3, improved all logarithmic to square-root-logarithmic correction factors