Fouriertransform on sparse grids with hierarchical bases (Q1203427): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3031434 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3922758 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the multi-level splitting of finite element spaces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4010713 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1494602634 / rank | |||
Normal rank | |||
Latest revision as of 10:06, 30 July 2024
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
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
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
