pith. sign in

arxiv: math/0612523 · v4 · pith:LE6XUPE5new · submitted 2006-12-18 · 🧮 math.PR · math.ST· stat.TH

Multi-step Richardson-Romberg Extrapolation: Remarks on Variance Control and complexity

classification 🧮 math.PR math.STstat.TH
keywords eulerextrapolationrichardson-rombergadmitsbrowniancomplexitydiscretizationerror
0
0 comments X
read the original abstract

We propose a multi-step Richardson-Romberg extrapolation method for the computation of expectations $E f(X_{_T})$ of a diffusion $(X_t)_{t\in [0,T]}$ when the weak time discretization error induced by the Euler scheme admits an expansion at an order $R\ge 2$. The complexity of the estimator grows as $R^2$ (instead of $2^R$) and its variance is asymptotically controlled by considering some consistent Brownian increments in the underlying Euler schemes. Some Monte carlo simulations carried with path-dependent options (lookback, barriers) which support the conjecture that their weak time discretization error also admits an expansion (in a different scale). Then an appropriate Richardson-Romberg extrapolation seems to outperform the Euler scheme with Brownian bridge.

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.