Fast orthogonal transforms and generation of Brownian paths
From MaRDI portal
Methods of discrete Brownian paths simulations are presented. They are based on orthogonal decomposition of the covariance matrix (using fast discrete Hartley, Hilbert, Walsh-Hadamard and wavelet transforms) and local random interpolation of gaps by the Brownian bridge paths.NEWLINENEWLINEDiscrete Lévy processes simulation is also discussed. Applications to different options pricing are presented.
Recommendations
- New Brownian bridge construction in quasi-Monte Carlo methods for computational finance
- Brownian path generation and polynomial chaos
- The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
- On the tractability of the Brownian bridge algorithm
- Path generation for quasi-Monte Carlo simulation of mortgage-backed securities
Cites work
- Arbitrage Theory in Continuous Time
- Complexity and effective dimension of discrete Lévy areas
- Derivative securities and difference methods.
- Efficient Monte Carlo and quasi-Monte Carlo option pricing under the variance gamma model
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- Fast principal components analysis method for finance problems with unequal time steps
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 5797591 (Why is no real title available?)
- scientific article; zbMATH DE number 3115573 (Why is no real title available?)
- scientific article; zbMATH DE number 712371 (Why is no real title available?)
- scientific article; zbMATH DE number 1103058 (Why is no real title available?)
- scientific article; zbMATH DE number 1999206 (Why is no real title available?)
- scientific article; zbMATH DE number 2006037 (Why is no real title available?)
- Low-discrepancy simulation
- On the tractability of the Brownian bridge algorithm
- On the Walsh Functions
- Quasi-Monte Carlo methods in financial engineering: an equivalence principle and dimension reduction
- Smoothness and dimension reduction in quasi-Monte Carlo methods
- Stratified sampling and quasi-Monte Carlo simulation of Lévy processes
- The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
- Unified Matrix Treatment of the Fast Walsh-Hadamard Transform
Cited in
(10)- High-dimensional integration on \(\mathbb{R}^d\), weighted Hermite spaces, and orthogonal transforms
- Spatial low-discrepancy sequences, spherical cone discrepancy, and applications in financial modeling
- Integration in Hermite spaces of analytic functions
- Efficient Monte Carlo simulation for integral functionals of Brownian motion
- An iterative algorithm to determine the number of time steps in path generation methods
- Fast algorithms for Brownian matrices
- Brownian path generation and polynomial chaos
- Forward or backward simulation? A comparative study
- Fast QMC matrix-vector multiplication
- Brownian bridge and other path-dependent Gaussian processes vectorial simulation
This page was built for publication: Fast orthogonal transforms and generation of Brownian paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413477)