Fast orthogonal transforms and generation of Brownian paths (Q413477): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q340793
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Rostislav E. Maiboroda / rank
 
Normal rank

Revision as of 19:56, 13 February 2024

scientific article
Language Label Description Also known as
English
Fast orthogonal transforms and generation of Brownian paths
scientific article

    Statements

    Fast orthogonal transforms and generation of Brownian paths (English)
    0 references
    0 references
    7 May 2012
    0 references
    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. Discrete Lévy processes simulation is also discussed. Applications to different options pricing are presented.
    0 references
    Hartley transform
    0 references
    Hilbert transform
    0 references
    Walsh-Hadamard transform
    0 references
    Brownian bridge
    0 references
    option pricing
    0 references
    covariance matrix
    0 references
    wavelet transforms
    0 references
    local random interpolation
    0 references
    discrete Lévy processes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references