This is the authors' abstract. We don't add key points for this paper.
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 A is the generator of a strongly continuous semigroup S on a Hilbert space X, and the focus is on non-parabolic problems. The main results are optimal bounds for the uniform strong error Eₖ∞ := (E _j∈ \0, …, Nₖ\ \|U(tⱼ) - Uʲ\|ᵖ)1/p, where p ∈ [2,∞), U is the mild solution, Uʲ is obtained from a time discretisation scheme, k is the step size, and Nₖ = 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 - Eₖ∞ k √log(T/k) (linear equation, additive noise, general S); - Eₖ∞ √k √log(T/k) (nonlinear equation, multiplicative noise, contractive S); - Eₖ∞ k √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 S. 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 Eₖ:=(_j∈ \0,…,Nₖ \|U(tⱼ) - Uʲ\|ᵖ)1/p. Applications to Maxwell equations, Schrödinger 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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Klioba et al. (2023) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: