Springe zum Hauptinhalt
Universitätsbibliothek
Universitätsbibliographie

Ergebnis der Datenbankabfrage

Nr. Titel Autor Jahr
1 Nonlinear approximation in bounded orthonormal product bases Potts, Daniel et al. 2023
2 On the reconstruction of functions from values at subsampled quadrature points Bartel, Felix et al. 2023
3 A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions Kämmerer, Lutz* et al. 2022
4 On the reconstruction of functions from values at subsampled quadrature points Potts, Daniel et al. 2022
5 The uniform sparse FFT with application to PDEs with random coefficients Potts, Daniel et al. 2022
6 A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size Kämmerer, Lutz et al. 2021
7 A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications Kämmerer, Lutz* 2021
8 The uniform sparse FFT with application to PDEs with random coefficients Potts, Daniel* et al. 2021
9 Worst-case recovery guarantees for least squares approximation using random samples Ullrich, Tino et al. 2021
10 A sparse FFT approach for ODE with random coefficients Bochmann, Maximilian et al. 2020
11 High-dimensional sparse FFT based on sampling along multiple rank-1 lattices Kämmerer, Lutz* et al. 2020
12 A sparse FFT approach for ODE with random coefficients Potts, Daniel et al. 2019
13 Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices Kämmerer, Lutz* et al. 2019
14 Multiple Lattice Rules for Multivariate L∞ Approximation in the Worst-Case Setting Kämmerer, Lutz 2019
15 Worst case recovery guarantees for least squares approximation using random samples Kämmerer, Lutz et al. 2019
16 Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices Volkmer, Toni et al. 2018
17 Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform Kämmerer, Lutz 2017
18 High-dimensional sparse FFT based on sampling along multiple rank-1 lattices Kämmerer, Lutz et al. 2017
19 Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness Byrenheid, Glenn et al. 2017
20 Multiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials Kämmerer, Lutz 2016
Aktuelle Seite:
Anzahl der Ergebnisseiten: 2
Anzahl der Dokumente: 33

Soziale Medien

Verbinde dich mit uns: