default search action
Lutz Kämmerer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Lutz Kämmerer:
Constructing efficient spatial discretizations of spans of multivariate Chebyshev polynomials. CoRR abs/2406.03281 (2024) - [i10]Felix Bartel, Lutz Kämmerer, Kateryna Pozharska, Martin Schäfer, Tino Ullrich:
Exact discretization, tight frames and recovery via D-optimal designs. CoRR abs/2412.02489 (2024) - 2023
- [j11]Felix Bartel
, Lutz Kämmerer, Daniel Potts, Tino Ullrich:
On the reconstruction of functions from values at subsampled quadrature points. Math. Comput. 93(346): 785-809 (2023) - 2022
- [j10]Lutz Kämmerer, Felix Krahmer, Toni Volkmer:
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. Numer. Algorithms 89(4): 1479-1520 (2022) - [i9]Felix Bartel, Lutz Kämmerer, Daniel Potts, Tino Ullrich:
On the reconstruction of functions from values at subsampled quadrature points. CoRR abs/2208.13597 (2022) - [i8]Lutz Kämmerer, Daniel Potts, Fabian Taubert:
Nonlinear approximation in bounded orthonormal product bases. CoRR abs/2211.06071 (2022) - 2021
- [j9]Craig Gross
A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. Adv. Comput. Math. 47(6): 86 (2021) - [i7]Lutz Kämmerer, Daniel Potts, Fabian Taubert:
The uniform sparse FFT with application to PDEs with random coefficients. CoRR abs/2109.04131 (2021) - 2020
- [j8]Maximilian Bochmann, Lutz Kämmerer, Daniel Potts:
A sparse FFT approach for ODE with random coefficients. Adv. Comput. Math. 46(4): 65 (2020) - [i6]Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer:
A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size. CoRR abs/2003.09753 (2020) - [i5]Lutz Kämmerer, Felix Krahmer, Toni Volkmer:
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. CoRR abs/2006.13053 (2020) - [i4]Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer:
Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables. CoRR abs/2012.09889 (2020) - [i3]Lutz Kämmerer:
A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications. CoRR abs/2012.14263 (2020)
2010 – 2019
- 2019
- [j7]Lutz Kämmerer, Toni Volkmer:
Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices. J. Approx. Theory 246: 1-27 (2019) - [i2]Lutz Kämmerer:
Multiple Lattice Rules for Multivariate L∞ Approximation in the Worst-Case Setting. CoRR abs/1909.02290 (2019) - [i1]Lutz Kämmerer, Tino Ullrich, Toni Volkmer:
Worst case recovery guarantees for least squares approximation using random samples. CoRR abs/1911.10111 (2019) - 2017
- [j6]Glenn Byrenheid
Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness. Numerische Mathematik 136(4): 993-1034 (2017) - 2015
- [j5]Lutz Kämmerer, Daniel Potts, Toni Volkmer:
Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form. J. Complex. 31(3): 424-456 (2015) - [j4]Lutz Kämmerer, Daniel Potts, Toni Volkmer:
Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling. J. Complex. 31(4): 543-576 (2015) - 2013
- [j3]Lutz Kämmerer:
Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices. SIAM J. Numer. Anal. 51(5): 2773-2796 (2013) - 2012
- [j2]Lutz Kämmerer, Stefan Kunis, Daniel Potts
Interpolation lattices for hyperbolic cross trigonometric polynomials. J. Complex. 28(1): 76-92 (2012) - 2011
- [j1]Lutz Kämmerer, Stefan Kunis:
On the stability of the hyperbolic cross discrete Fourier transform. Numerische Mathematik 117(3): 581-600 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: