A Nonuniform Fast Fourier Transform Based on Low Rank Approximation
From MaRDI portal
Publication:4603509
DOI10.1137/17M1134822zbMath1382.41006arXiv1701.04492OpenAlexW2578554495WikidataQ56608065 ScholiaQ56608065MaRDI QIDQ4603509
Diego Ruiz-Antolín, Alex Townsend
Publication date: 21 February 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04492
Numerical methods for discrete and fast Fourier transforms (65T50) Approximation by polynomials (41A10)
Related Items (16)
Fast algorithms using orthogonal polynomials ⋮ Frequency Extraction for BEM Matrices Arising From the 3D Scalar Helmholtz Equation ⋮ Fast algorithms for the multi-dimensional Jacobi polynomial transform ⋮ Direct inversion of the nonequispaced fast Fourier transform ⋮ On the computation of the SVD of Fourier submatrices ⋮ An extra-component method for evaluating fast matrix-vector multiplication with special functions ⋮ On the stability of unevenly spaced samples for interpolation and quadrature ⋮ Computing with Functions in the Ball ⋮ A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? ⋮ Spatio-temporal proper orthogonal decomposition of turbulent channel flow ⋮ Continuous window functions for NFFT ⋮ Uniform error estimates for nonequispaced fast Fourier transforms ⋮ A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel ⋮ Multidimensional phase recovery and interpolative decomposition butterfly factorization ⋮ A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation ⋮ How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast evaluation of real and complex exponential sums
- A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
- Fast spherical Fourier algorithms.
- The type 3 nonuniform FFT and its applications
- Julia: A Fresh Approach to Numerical Computing
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- Fast Fourier Transforms for Nonequispaced Data
- Fast Summation at Nonequispaced Knots by NFFT
- Nonequispaced fast Fourier transforms without oversampling
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- Accelerating the Nonuniform Fast Fourier Transform
- Rapid Computation of the Discrete Fourier Transform
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Nonuniform fast fourier transforms using min-max interpolation
- Trigonometric Interpolation and Quadrature in Perturbed Points
- An efficient Newton-type method for the computation of ML estimators in a uniform linear array
- Computing with Functions in Spherical and Polar Geometries I. The Sphere
This page was built for publication: A Nonuniform Fast Fourier Transform Based on Low Rank Approximation
