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.











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)