Fouriertransform on sparse grids with hierarchical bases (Q1203427)

From MaRDI portal
Revision as of 14:37, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fouriertransform on sparse grids with hierarchical bases
scientific article

    Statements

    Fouriertransform on sparse grids with hierarchical bases (English)
    0 references
    0 references
    0 references
    8 February 1993
    0 references
    An algorithm for the trigonometric interpolation of functions of \(n\) variables on a sparse grid is described. This discrete Fourier transform based on the fast Fourier transform has a greatly reduced complexity in comparison to the Fourier transform on a regular grid whereas the approximation quality in only slightly reduced if the function belongs to a Korobov space. The transformation is also easily invertible.
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    trigonometric interpolation
    0 references
    sparse grid
    0 references
    discrete Fourier transform
    0 references
    fast Fourier transform
    0 references
    reduced complexity
    0 references
    Korobov space
    0 references
    0 references