Search arXivSearch

arXiv · 1707.08818

A note on strong approximation of SDEs with smooth coefficients that have at most linearly growing derivatives

Abstract

Recently, it has been shown in [Jentzen, A., M\"uller-Gronbach, T., and Yaroslavtseva, L., Commun. Math. Sci., 14, 2016] that there exists a system of autonomous stochastic differential equations (SDE) on the time interval $[0,T]$ with infinitely differentiable and bounded coefficients such that no strong approximation method based on evaluation of the driving Brownian motion at finitely many fixed times in $[0,T]$, e.g. on an equidistant grid, can converge in absolute mean to the solution at the final time with a polynomial rate in terms of the number of Brownian motion values that are used. In the literature on strong approximation of SDEs, polynomial error rate results are typically achieved under the assumption that the first order derivatives of the coefficients of the equation satisfy a polynomial growth condition. This assumption is violated for the pathological SDEs from the above mentioned negative result. However, in the present article we construct an SDE with smooth coefficients that have first order derivatives of at most linear growth such that the solution at the final time can not be approximated with a polynomial rate, whatever method based on observations of the driving Brownian motion at finitely many fixed times is used. Most interestingly, it turns out that using a method that adjusts the number of evaluations of the driving Brownian motion to its actual path, the latter SDE can be approximated with rate 1 in terms of the average number of evaluations that are used. To the best of our knowledge, this is only the second example in the literature of an SDE for which there exist adaptive methods that perform superior to non-adaptive ones with respect to the convergence rate.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Müller-Gronbach, Larisa Yaroslavtseva. 2017-07-27. A note on strong approximation of SDEs with smooth coefficients that have at most linearly growing derivatives. https://arxiv.org/abs/1707.08818

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR