We study pathwise approximation of scalar stochastic differential equations at a single time point or globally in time by means of methods that are based on finitely many observations of the driving Brownian motion. We prove lower error bounds in terms of the average number of evaluations of the driving Brownian motion that hold for every such method under rather mild assumptions on the coefficients of the equation. The underlying simple idea of our analysis is as follows: the lower error bounds known for equations with coefficients that have sufficient regularity globally in space should still apply in the case of coefficients that have this regularity in space only locally, in a small neighborhood of the initial value. Our results apply to a huge variety of equations with coefficients that are not globally Lipschitz continuous in space including Cox-Ingersoll-Ross processes, equations with superlinearly growing coefficients, and equations with discontinuous coefficients. In many of these cases the resulting lower error bounds even turn out to be sharp.
Contents2010 Mathematics Subject Classification. 65C30, 60H10.
We study strong (pathwise) approximation of Cox-Ingersoll-Ross processes. We propose a Milstein-type scheme that is suitably truncated close to zero, where the diffusion coefficient fails to be locally Lipschitz continuous. For this scheme we prove polynomial convergence rates for the full parameter range including the accessible boundary regime. The error criterion is given by the maximal Lp-distance of the solution and its approximation on a compact interval. In the particular case of a squared Bessel process of dimension δ > 0 the polynomial convergence rate is given by min(1, δ)/(2p).2010 Mathematics Subject Classification. 65C30, 60H10.
Abstract. We consider the one-dimensional squared Bessel process given by the stochastic differential equation (SDE)and study strong (pathwise) approximation of the solution X at the final time point t = 1. This SDE is a particular instance of a Cox-Ingersoll-Ross (CIR) process where the boundary point zero is accessible. We consider numerical methods that have access to values of the driving Brownian motion W at a finite number of time points. We show that the polynomial convergence rate of the n-th minimal errors for the class of adaptive algorithms as well as for the class of algorithms that rely on equidistant grids are equal to infinity and 1/2, respectively. This shows that adaption results in a tremendously improved convergence rate. As a by-product, we obtain that the parameters appearing in the CIR process affect the convergence rate of strong approximation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.