242 search results - page 4 / 49 » Fast computation of general Fourier Transforms on GPUS |
SIAMNUM
2010
13 years 3 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
IV
2006
IEEE
14 years 2 months ago
2006
IEEE
Many contemporary visualization tools comprise some image filtering approach. Since image filtering approaches are very computationally demanding, the acceleration using graphic...
APPML
2010
13 years 8 months ago
2010
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
ICS
2000
Tsinghua U.
14 years 3 days ago
2000
Tsinghua U.