On Tamed Milstein Schemes of SDEs Driven by L\'evy Noise
classification
🧮 math.PR
keywords
driftdrivenmilsteinschemesapproximateciteclassicalcoefficient
read the original abstract
We extend the taming techniques developed in \cite{konstantinos2014,sabanis2013} to construct explicit Milstein schemes that numerically approximate L\'evy driven stochastic differential equations with super-linearly growing drift coefficients. The classical rate of convergence is recovered when the first derivative of the drift coefficient satisfies a polynomial Lipschitz condition.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.