Nonequispaced Hyperbolic Cross Fast Fourier Transform

DOI10.1137/090754947MaRDI QIDQ3069078zbMATH OpenOpenAlexFDO

Authors Michael Döhler, Stefan Kunis, Daniel Potts

Publication date 24 January 2011

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/090754947

zbMATH Keywords

numerical examplessparse gridtrigonometric approximationspline interpolationapproximation errorhyperbolic cross fast Fourier transformmultidimensional fast Fourier transformarithmetic costarbitrary sampling nodeshyperbolic cross Fourier expansionnonequispaced hyperbolic cross fast Fourier transform

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast evaluation of trigonometric polynomials from hyperbolic crosses
• Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
• Nonequispaced FFT. Generalisation and inversion.
• Accelerating the Nonuniform Fast Fourier Transform
• Interpolation lattices for hyperbolic cross trigonometric polynomials
• scientific article; zbMATH DE number 1284007
• Time and memory requirements of the nonequispaced FFT
• The sparse cardinal sine decomposition and its application for fast numerical convolution
• Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
• A new theoretical derivation of NFFT and its implementation on GPU

Cited in

(16)

• Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
• Approximation of high-dimensional periodic functions with Fourier-based methods
• Nonequispaced fast Fourier transforms without oversampling
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
• Using a hyperbolic cross to solve non-linear macroeconomic models
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• On the stability of the hyperbolic cross discrete Fourier transform
• Interpolation lattices for hyperbolic cross trigonometric polynomials
• On computing high-dimensional Riemann theta functions
• A fully discrete fast Fourier-Galerkin method solving a boundary integral equation for the biharmonic equation
• Prony's method in several variables: symbolic solutions by universal interpolation
• NHCFFT
• Nonequispaced fast Fourier transform on parallel hexagon
• Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
• Computational methods for the Fourier analysis of sparse high-dimensional functions
• On the fundamental conjecture of HDMR: a Fourier analysis approach

Describes a project that uses

Uses Software

• NFFT3
• NFFT
• Algorithm 862
• Matlab

This page was built for publication: Nonequispaced Hyperbolic Cross Fast Fourier Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069078)