A straightforward discretisation of high-dimensional problems often leads to a curse of dimensions and thus the use of sparsity has become a popular tool. Efficient algorithms like the fast Fourier transform (FFT) have to be customised to these thinner discretisations and we focus on two major topics regarding the Fourier analysis of high-dimensional functions: We present stable and effective algorithms for the fast evaluation and reconstruction of multivariate trigonometric polynomials with frequencies supported on an index set I ⊂ 𝕫d.
CITATION STYLE
Kämmerer, L., Kunis, S., Melzer, I., Potts, D., & Volkmer, T. (2014). Computational methods for the fourier analysis of sparse high-dimensional functions. Lecture Notes in Computational Science and Engineering, 102, 347–363. https://doi.org/10.1007/978-3-319-08159-5_17
Mendeley helps you to discover research relevant for your work.