Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Accelerating the Nonuniform Fast Fourier Transform
by
Greengard, Leslie
, Lee, June-Yub
in
Algorithms
/ Data lines
/ Exact sciences and technology
/ Fast Fourier transformations
/ Fourier analysis
/ Fourier transformations
/ Fourier transforms
/ Geometric lines
/ Image reconstruction
/ Integral equations, integral transforms
/ Integral transforms, operational calculus
/ Interpolation
/ Magnetic resonance imaging
/ Mathematical analysis
/ Mathematical functions
/ Mathematics
/ Normal distribution
/ Numerical analysis
/ Numerical analysis. Scientific computation
/ Partial differential equations
/ Problems and Techniques
/ Random access memory
/ Sciences and techniques of general use
/ Statistical analysis
2004
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Accelerating the Nonuniform Fast Fourier Transform
by
Greengard, Leslie
, Lee, June-Yub
in
Algorithms
/ Data lines
/ Exact sciences and technology
/ Fast Fourier transformations
/ Fourier analysis
/ Fourier transformations
/ Fourier transforms
/ Geometric lines
/ Image reconstruction
/ Integral equations, integral transforms
/ Integral transforms, operational calculus
/ Interpolation
/ Magnetic resonance imaging
/ Mathematical analysis
/ Mathematical functions
/ Mathematics
/ Normal distribution
/ Numerical analysis
/ Numerical analysis. Scientific computation
/ Partial differential equations
/ Problems and Techniques
/ Random access memory
/ Sciences and techniques of general use
/ Statistical analysis
2004
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Accelerating the Nonuniform Fast Fourier Transform
by
Greengard, Leslie
, Lee, June-Yub
in
Algorithms
/ Data lines
/ Exact sciences and technology
/ Fast Fourier transformations
/ Fourier analysis
/ Fourier transformations
/ Fourier transforms
/ Geometric lines
/ Image reconstruction
/ Integral equations, integral transforms
/ Integral transforms, operational calculus
/ Interpolation
/ Magnetic resonance imaging
/ Mathematical analysis
/ Mathematical functions
/ Mathematics
/ Normal distribution
/ Numerical analysis
/ Numerical analysis. Scientific computation
/ Partial differential equations
/ Problems and Techniques
/ Random access memory
/ Sciences and techniques of general use
/ Statistical analysis
2004
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Accelerating the Nonuniform Fast Fourier Transform
2004
Request Book From Autostore
and Choose the Collection Method
Overview
The nonequispaced Fourier transform arises in a variety of application areas, from medical imaging to radio astronomy to the numerical solution of partial differential equations. In a typical problem, one is given an irregular sampling of N data in the frequency domain and one is interested in reconstructing the corresponding function in the physical domain. When the sampling is uniform, the fast Fourier transform (FFT) allows this calculation to be computed in O(N log N) operations rather than O(N²) operations. Unfortunately, when the sampling is nonuniform, the FFT does not apply. Over the last few years, a number of algorithms have been developed to overcome this limitation and are often referred to as nonuniform FFTs (NUFFTs). These rely on a mixture of interpolation and the judicious use of the FFT on an oversampled grid [A. Dutt and V. Rokhlin, \"SIAM J. Sci. Comput.\", 14 (1993), pp. 1368-1383]. In this paper, we observe that one of the standard interpolation or \"gridding\" schemes, based on Gaussians, can be accelerated by a significant factor without precomputation and storage of the interpolation weights. This is of particular value in two- and three-dimensional settings, saving either$10^{d}N$in storage in d dimensions or a factor of about 5-10 in CPU time (independent of dimension).
Publisher
Society for Industrial and Applied Mathematics
This website uses cookies to ensure you get the best experience on our website.