Computational methods for the fourier analysis of sparse high-dimensional functions
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Kämmerer, L. | |
dc.contributor.author | Kunis, S. | |
dc.contributor.author | Melzer, I. | |
dc.contributor.author | Potts, D. | |
dc.contributor.author | Volkmer, T. | |
dc.date.accessioned | 2021-12-23T16:32:45Z | - |
dc.date.available | 2021-12-23T16:32:45Z | - |
dc.date.issued | 2014 | |
dc.identifier.issn | 14397358 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/17501 | - |
dc.description.abstract | 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. © Springer International Publishing Switzerland 2014. | |
dc.description.sponsorship | Helmholtz AssociationHelmholtz Association,VH-NG-526; We gratefully acknowledge support by the German Research Foundation (DFG) within the Priority Program 1324, project PO 711/10-2 and KU 2557/1-2. Moreover, Ines Melzer and Stefan Kunis gratefully acknowledge their support by the Helmholtz Association within the young investigator group VH-NG-526. | |
dc.language.iso | en | |
dc.publisher | Springer Verlag | |
dc.relation.ispartof | Lecture Notes in Computational Science and Engineering | |
dc.subject | Fast Fourier transforms, Discretisation | |
dc.subject | Effective algorithms | |
dc.subject | High-dimensional | |
dc.subject | High-dimensional problems | |
dc.subject | Multivariate trigonometric polynomials, Fourier analysis | |
dc.title | Computational methods for the fourier analysis of sparse high-dimensional functions | |
dc.type | journal article | |
dc.identifier.doi | 10.1007/978-3-319-08159-5_17 | |
dc.identifier.scopus | 2-s2.0-85000416259 | |
dc.identifier.url | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85000416259&doi=10.1007%2f978-3-319-08159-5_17&partnerID=40&md5=338d049415e819deed4ac3388846ed09 | |
dc.description.volume | 102 | |
dc.description.startpage | 347 | |
dc.description.endpage | 363 | |
dcterms.isPartOf.abbreviation | Lect. Notes Comput. Sci. Eng. | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | KuSt212 | - |
Seitenaufrufe
7
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 06.06.2024