The order barrier for the L^1-approximation of the log-Heston SDE at a single point

12/14/2022
∙
by   Annalena Mickel, et al.
∙
0
∙

We study the L^1-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{ν, 12}, where ν is the Feller index of the underlying CIR process. As a consequence Euler-type schemes are optimal for ν≥ 1, since they have convergence order 12-ϵ for ϵ >0 arbitrarily small in this regime.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment