On the tractability of the Brownian bridge algorithm

DOI10.1016/S0885-064X(03)00045-1MaRDI QIDQ652449zbMATH OpenFDO

Authors Gerhard Larcher, Gunther Leobacher, Klaus Scheicher

Publication date 14 December 2011

Published in Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

algorithmsquasi-Monte Carlo methodsBrownian bridgefinancial applicationsKoksma-Hlawka inequality

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical methods (including Monte Carlo methods) (91G60) Brownian motion (60J65)

Recommendations

• The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• New Brownian bridge construction in quasi-Monte Carlo methods for computational finance
• Quasi-Monte Carlo methods in financial engineering: an equivalence principle and dimension reduction
• scientific article; zbMATH DE number 1103081

Cites work

• scientific article; zbMATH DE number 3153217 (Why is no real title available?)
• scientific article; zbMATH DE number 4083739 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1222506 (Why is no real title available?)
• scientific article; zbMATH DE number 1222809 (Why is no real title available?)
• scientific article; zbMATH DE number 1790428 (Why is no real title available?)
• Generating Quasi-Random Paths for Stochastic Processes
• Some applications of multidimensional integration by parts
• The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• Über die Diskrepanz mehrdimensionaler Folgen mod 1

Cited in

(12)

• scientific article; zbMATH DE number 2186466 (Why is no real title available?)
• Fast orthogonal transforms and generation of Brownian paths
• Algorithms for Brownian dynamics across discontinuities
• An iterative algorithm to determine the number of time steps in path generation methods
• The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
• QMC Galerkin discretization of parametric operator equations
• Anchor points matter in ANOVA decomposition
• New Brownian bridge construction in quasi-Monte Carlo methods for computational finance
• Calibration of financial models using quasi-Monte Carlo
• Random weights, robust lattice rules and the geometry of the \(cbcrc\) algorithm
• Quickest search over Brownian channels
• Liberating the weights

This page was built for publication: On the tractability of the Brownian bridge algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652449)