We discuss how the parameters of 1D Type 3 Non-Uniform Fast Fourier Transform (NUFFT) algorithms based on the Gaussian gridding can be chosen to achieve a prescribed accuracy. Type 3 NUFFT algorithms are of interest in many areas of applied electromagnetics, as for example fast antenna analysis and synthesis and fast calculation of the scattered fields. The approach is related to the one dimensional case and follows the work in A. Dutt and V. Rokhlin, SIAM J. Sci. Comp. 14 (1993). The accuracy of the proposed choice is numerically assessed for an electromagnetic application consisting of the implementation of the aggregation and disaggregation steps in the fast calculation of the scattered field by the Fast Multipole Method
3-D controlled-source electromagnetic data are often computed directly in the domain of interest, ei...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
In this paper we study the error behavior of the well known fast Fourier transform for nonequispaced...
We discuss how the parameters of 1D Type 3 Non-Uniform Fast Fourier Transform (NUFFT) algorithms bas...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
We deal with an optimized approach for implementing non-uniform fast Fourier transform (NUFFT) algor...
Abstract—Based on the regular Fourier matrix, a new set of ac-curacy factors is proposed for the non...
The so-called non-uniform fast Fourier transform (NFFT) is a family of algorithms for efficiently co...
We deal with developing an optimized approach for implementing nonuniform fast Fourier transform (NU...
We deal with an approach based on Non-Uniform FFTs (NUFFTs) of type-3 and on a pruned FFT to efficie...
We show that the aggregation and disaggregation stages of the Fast Multipole Method (FMM) can be eff...
We propose an optimized approach for implementing Non-Uniform Fast Fourier Transform (NUFFT) algorit...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
We present and discuss the parallel implementation on GPUs of three types of NUFFTs in CUDA language...
3-D controlled-source electromagnetic data are often computed directly in the domain of interest, ei...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
In this paper we study the error behavior of the well known fast Fourier transform for nonequispaced...
We discuss how the parameters of 1D Type 3 Non-Uniform Fast Fourier Transform (NUFFT) algorithms bas...
We provide a sufficient condition to select the parameters of Type 3 Non-Uniform Fast Fourier Transf...
We deal with an optimized approach for implementing non-uniform fast Fourier transform (NUFFT) algor...
Abstract—Based on the regular Fourier matrix, a new set of ac-curacy factors is proposed for the non...
The so-called non-uniform fast Fourier transform (NFFT) is a family of algorithms for efficiently co...
We deal with developing an optimized approach for implementing nonuniform fast Fourier transform (NU...
We deal with an approach based on Non-Uniform FFTs (NUFFTs) of type-3 and on a pruned FFT to efficie...
We show that the aggregation and disaggregation stages of the Fast Multipole Method (FMM) can be eff...
We propose an optimized approach for implementing Non-Uniform Fast Fourier Transform (NUFFT) algorit...
AbstractA group of algorithms generalizing the fast Fourier transform to the case of noninteger freq...
We present and discuss the parallel implementation on GPUs of three types of NUFFTs in CUDA language...
3-D controlled-source electromagnetic data are often computed directly in the domain of interest, ei...
A group of algorithms is presented generalizing the Fast Fourier Transform to the case of non-intege...
In this paper we study the error behavior of the well known fast Fourier transform for nonequispaced...