Computational methods for the Fourier analysis of sparse high-dimensional functions

DOI10.1007/978-3-319-08159-5_17MaRDI QIDQ5256568zbMATH OpenOpenAlexFDO

Authors Lutz Kämmerer, Stefan Kunis, Ines Melzer, Daniel Potts, Toni Volkmer

Publication date 18 June 2015

Published in Extraction of Quantifiable Information from Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08159-5_17

zbMATH Keywords

algorithmfast Fourier transformFourier analysistrigonometric polynomials

Mathematics Subject Classification ID

Trigonometric polynomials, inequalities, extremal problems (42A05) Trigonometric approximation (42A10) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
• Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
• Fast evaluation of trigonometric polynomials from hyperbolic crosses
• Nonequispaced Hyperbolic Cross Fast Fourier Transform

Cited in

(7)

• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
• A stable and accurate butterfly sparse Fourier transform
• Sparse high-dimensional FFT based on rank-1 lattice sampling
• Sparse Evaluation of Compositions of Functions Using Multiscale Expansions
• Fast sparse nonlinear Fourier expansions of high dimensional functions
• A note on the high-dimensional sparse Fourier transform in the continuous setting

Describes a project that uses

Uses Software

• NFFT3

This page was built for publication: Computational methods for the Fourier analysis of sparse high-dimensional functions

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