×

zbMATH — the first resource for mathematics

Quasi-Monte Carlo methods for the Kou model. (English) Zbl 1151.91476
Summary: We firstly show how to formulate the finance problem as an integration problem so that QMC methods can be applied to it. Consequently, we introduce QMC approaches for the integration problems pertaining to the Poisson processes, compound Poisson processes and jump-diffusion processes underlying the Kou model. As opposed to increment-by-increment approaches, our approaches change the ordering of the variates in the integration problems to pack more variance into the opening dimensions. We report numerical experiments indicating that the approaches introduced achieve lower standard errors than the increment-by-increment approaches.

MSC:
91G60 Numerical methods (including Monte Carlo methods)
65C05 Monte Carlo methods
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] DOI: 10.1239/jap/996986757 · Zbl 0989.60047 · doi:10.1239/jap/996986757
[2] DOI: 10.1287/mnsc.1060.0575 · Zbl 1232.91700 · doi:10.1287/mnsc.1060.0575
[3] Caflisch R. E., J. Comp. Finance 1 pp 27– (1997)
[4] DOI: 10.1093/imaman/14.1.65 · Zbl 1073.91033 · doi:10.1093/imaman/14.1.65
[5] DOI: 10.1287/mnsc.48.8.1086.166 · Zbl 1216.91039 · doi:10.1287/mnsc.48.8.1086.166
[6] DOI: 10.1287/mnsc.1030.0163 · doi:10.1287/mnsc.1030.0163
[7] DOI: 10.1515/156939603322728996 · doi:10.1515/156939603322728996
[8] L’Ecuyer P., MA pp 419– (2002)
[9] DOI: 10.1515/156939606778705155 · Zbl 1113.65004 · doi:10.1515/156939606778705155
[10] DOI: 10.1006/jcom.2001.0631 · Zbl 0998.65005 · doi:10.1006/jcom.2001.0631
[11] Rasmus S., Lecture Notes in Comput. Sci. 3039 pp 795– (2004) · doi:10.1007/978-3-540-25944-2_103
[12] Ribeiro C., Journal of Computational Finance 7 (2) pp 81– (2004)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.