Fast Computation of Partial Fourier Transforms
نویسندگان
چکیده
منابع مشابه
Fast Computation of Partial Fourier Transforms
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal compl...
متن کاملFast Computation of Voigt Functions via Fourier Transforms
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the fourth power of the computational effort. Because of its use of highly vectorizable operations for its core, it can be implemented very efficiently in scripting ...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملFast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms
The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN , whereas the geometrically more versatile finite element methods (FEM) are bounded to N in the best case. We report the implementation of a Non-uniform Fast Fourier Transform algorithm which brings a N lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multiscale Modeling & Simulation
سال: 2009
ISSN: 1540-3459,1540-3467
DOI: 10.1137/080715457