Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The order barrier for the $L^1$-approximation of the log-Heston SDE at a single point (2212.07252v2)

Published 14 Dec 2022 in math.NA, cs.NA, and math.PR

Abstract: We study the $L1$-approximation of the log-Heston SDE at the terminal time point by arbitrary methods that use an equidistant discretization of the driving Brownian motion. We show that such methods can achieve at most order $ \min { \nu, \tfrac{1}{2} }$, where $\nu$ is the Feller index of the underlying CIR process. As a consequence Euler-type schemes are optimal for $\nu \geq 1$, since they have convergence order $\tfrac{1}{2}-\epsilon$ for $\epsilon >0$ arbitrarily small in this regime.

Citations (1)

Summary

We haven't generated a summary for this paper yet.