research
∙
11/11/2022
Nonlinear approximation in bounded orthonormal product bases
We present a dimension-incremental algorithm for the nonlinear approxima...
share
research
∙
08/29/2022
On the reconstruction of functions from values at subsampled quadrature points
This paper is concerned with function reconstruction from samples. The s...
research
∙
09/09/2021
The uniform sparse FFT with application to PDEs with random coefficients
We develop an efficient, non-intrusive, adaptive algorithm for the solut...
research
∙
12/28/2020
A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications
Several more and more efficient component–by–component (CBC) constructio...
research
∙
12/17/2020
Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables
We consider fast, provably accurate algorithms for approximating functio...
research
∙
06/23/2020
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
In this paper a sublinear time algorithm is presented for the reconstruc...
research
∙
03/21/2020
A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size
In this paper we present the first known deterministic algorithm for the...
research
∙
09/05/2019