Fast orthogonal transforms and generation of Brownian paths
Publication:413477
DOI10.1016/J.JCO.2011.11.003zbMath1256.65009DBLPjournals/jc/Leobacher12OpenAlexW2066027744WikidataQ41642851 ScholiaQ41642851MaRDI QIDQ413477
Publication date: 7 May 2012
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2011.11.003
Hartley transformoption pricingHilbert transformBrownian bridgecovariance matrixwavelet transformsWalsh-Hadamard transformdiscrete Lévy processeslocal random interpolation
Applications of statistics to actuarial sciences and financial mathematics (62P05) Numerical methods (including Monte Carlo methods) (91G60) Monte Carlo methods (65C05) Brownian motion (60J65) Numerical methods for discrete and fast Fourier transforms (65T50) Stochastic particle methods (65C35)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the tractability of the Brownian bridge algorithm
- Complexity and effective dimension of discrete Lévy areas
- The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
- Derivative securities and difference methods.
- Smoothness and dimension reduction in quasi-Monte Carlo methods
- Quasi-Monte Carlo Methods in Financial Engineering: An Equivalence Principle and Dimension Reduction
- Efficient Monte Carlo and Quasi–Monte Carlo Option Pricing Under the Variance Gamma Model
- Fast Principal Components Analysis Method for Finance Problems With Unequal Time Steps
- Stratified sampling and quasi-Monte Carlo simulation of Lévy processes
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- Unified Matrix Treatment of the Fast Walsh-Hadamard Transform
- Arbitrage Theory in Continuous Time
- On the Walsh Functions
This page was built for publication: Fast orthogonal transforms and generation of Brownian paths