PuSH - Publikationsserver des Helmholtz Zentrums München

Kämmerer, L.* ; Kunis, S. ; Melzer, I.* ; Potts, D.* ; Volkmer, T.*

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

Lecture Notes Comp. Sci. Eng. 102, 347-363 (2014)
Postprint DOI Verlagsversion bestellen
Open Access Green
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⊂
Weitere Metriken?
Zusatzinfos bearbeiten [➜Einloggen]
Publikationstyp Artikel: Journalartikel
Dokumenttyp Wissenschaftlicher Artikel
ISSN (print) / ISBN 1439-7358
e-ISSN 1439-7358
ISBN 978-3-319-08159-5
Konferenztitel Extraction of Quantifiable Information from Complex Systems
Quellenangaben Band: 102, Heft: , Seiten: 347-363 Artikelnummer: , Supplement: ,
Verlag Springer
Verlagsort Berlin ; Heidelberg