Skip to Main content Skip to Navigation
Journal articles

The central limit theorem for a nonlinear algorithm based on quantization

Abstract : In a series of papers we have presented an algorithm based on quantization for pricing American options. More generally, this amounts to solving numerically an obstacle problem for some semilinear partial differential equations. Our algorithm is based on a Monte Carlo method and so a statistical error results. In the present paper, we study this error: we prove the central limit theorem for the algorithm and we give evaluations of the variance. The difficulty comes from the fact that the algorithm is not linear. On the other hand, an interesting problem is to control the behaviour of the variance of the algorithm as the complexity increases. It turns out that the variance does not blow up if the time-discretization step and the space-discretization step tend to zero.
Document type :
Journal articles
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00693136
Contributor : Admin Lama <>
Submitted on : Tuesday, May 1, 2012 - 9:43:44 PM
Last modification on : Thursday, March 19, 2020 - 12:26:02 PM

Links full text

Identifiers

Citation

Vlad Bally. The central limit theorem for a nonlinear algorithm based on quantization. PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2004, 460 (2041), pp.221--241. ⟨10.1098/rspa.2003.1241⟩. ⟨hal-00693136⟩

Share

Metrics

Record views

361