Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions

DOI10.1007/978-3-319-08159-5_17zbMath1319.65130OpenAlexW138843309MaRDI QIDQ5256568

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

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

algorithmFourier analysisfast Fourier transformtrigonometric polynomials

Mathematics Subject Classification ID

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

Related Items (2)

Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ High-dimensional sparse FFT based on sampling along multiple rank-1 lattices

Uses Software

• NFFT3

This page was built for publication: Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions