Randomized Milstein algorithm for approximation of solutions of jump-diffusion SDEs

12/01/2022
by   Paweł Przybyłowicz, et al.
0

We investigate the error of the randomized Milstein algorithm for solving scalar jump-diffusion stochastic differential equations. We provide a complete error analysis under substantially weaker assumptions than known in the literature. In case the jump-commutativity condition is satisfied, we prove optimality of the randomized Milstein algorithm by proving a matching lower bound. Moreover, we give some insight into the multidimensional case by investigating the optimal convergence rate for the approximation of jump-diffusion type Lévys' areas. Finally, we report numerical experiments that support our theoretical findings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2019

Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information

We deal with pointwise approximation of solutions of scalar stochastic d...
research
06/15/2023

On approximation of solutions of stochastic delay differential equations via randomized Euler scheme

We investigate existence, uniqueness and approximation of solutions to s...
research
03/10/2023

Lower error bounds and optimality of approximation for jump-diffusion SDEs with discontinuous drift

In this note we prove sharp lower error bounds for numerical methods for...
research
06/22/2020

Randomized Runge-Kutta method – stability and convergence under inexact information

We deal with optimal approximation of solutions of ODEs under local Lips...
research
12/21/2021

The truncated θ-Milstein method for nonautonomous and highly nonlinear stochastic differential delay equations

This paper focuses on the strong convergence of the truncated θ-Milstein...
research
08/30/2021

A Boundary-Layer Preconditioner for Singularly Perturbed Convection Diffusion

Motivated by a wide range of real-world problems whose solutions exhibit...
research
05/09/2016

Randomized Kaczmarz for Rank Aggregation from Pairwise Comparisons

We revisit the problem of inferring the overall ranking among entities i...

Please sign up or login with your details

Forgot password? Click here to reset