Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDiscrete-time Simulation of Stochastic Volterra Equations
109
0
0.0
(
0
)
Added by
Fan Yang
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We study discrete-time simulation schemes for stochastic Volterra equations, namely the Euler and Milstein schemes, and the corresponding Multi-Level Monte-Carlo method. By using and adapting some results from Zhang [22], together with the Garsia-Rodemich-Rumsey lemma, we obtain the convergence rates of the Euler scheme and Milstein scheme under the supremum norm. We then apply these schemes to approximate the expectation of functionals of such Volterra equations by the (Multi-Level) Monte-Carlo method, and compute their complexity.
rate research
Read More
Solutions to the stochastic wave equation on the unit sphere are approximated by spectral methods. Strong, weak, and almost sure convergence rates for the proposed numerical schemes are provided and shown to depend only on the smoothness of the driving noise and the initial conditions. Numerical experiments confirm the theoretical rates. The developed numerical method is extended to stochastic wave equations on higher-dimensional spheres and to the free stochastic Schrodinger equation on the unit sphere.
We establish a general theory of optimal strong error estimation for numerical approximations of a second-order parabolic stochastic partial differential equation with monotone drift driven by a multiplicative infinite-dimensional Wiener process. The equation is spatially discretized by Galerkin methods and temporally discretized by drift-implicit Euler and Milstein schemes. By the monotone and Lyapunov assumptions, we use both the variational and semigroup approaches to derive a spatial Sobolev regularity under the $L_omega^p L_t^infty dot H^{1+gamma}$-norm and a temporal Holder regularity under the $L_omega^p L_x^2$-norm for the solution of the proposed equation with an $dot H^{1+gamma}$-valued initial datum for $gammain [0,1]$. Then we make full use of the monotonicity of the equation and tools from stochastic calculus to derive the sharp strong convergence rates $O(h^{1+gamma}+tau^{1/2})$ and $O(h^{1+gamma}+tau^{(1+gamma)/2})$ for the Galerkin-based Euler and Milstein schemes, respectively.
We develop in this work a numerical method for stochastic differential equations (SDEs) with weak second order accuracy based on Gaussian mixture. Unlike the conventional higher order schemes for SDEs based on It^o-Taylor expansion and iterated It^o integrals, the proposed scheme approximates the probability measure $mu(X^{n+1}|X^n=x_n)$ by a mixture of Gaussians. The solution at next time step $X^{n+1}$ is then drawn from the Gaussian mixture with complexity linear in the dimension $d$. This provides a new general strategy to construct efficient high weak order numerical schemes for SDEs.
We analyze the qualitative properties and the order of convergence of a splitting scheme for a class of nonlinear stochastic Schrodinger equations driven by additive It^o noise. The class of nonlinearities of interest includes nonlocal interaction cubic nonlinearities. We show that the numerical solution is symplectic and preserves the expected mass for all times. On top of that, for the convergence analysis, some exponential moment bounds for the exact and numerical solutions are proved. This enables us to provide strong orders of convergence as well as orders of convergence in probability and almost surely. Finally, extensive numerical experiments illustrate the performance of the proposed numerical scheme.
In this paper, we focus on constructing numerical schemes preserving the averaged energy evolution law for nonlinear stochastic wave equations driven by multiplicative noise. We first apply the compact finite difference method and the interior penalty discontinuous Galerkin finite element method to discretize space variable and present two semi-discrete schemes, respectively. Then we make use of the discrete gradient method and the Pade approximation to propose efficient fully-discrete schemes. These semi-discrete and fully-discrete schemes are proved to preserve the discrete averaged energy evolution law. In particular, we also prove that the proposed fully-discrete schemes exactly inherit the averaged energy evolution law almost surely if the considered model is driven by additive noise. Numerical experiments are given to confirm theoretical findings.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
