#### Filter Results:

#### Publication Year

2011

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Lutz Kämmerer, Stefan Kunis
- Numerische Mathematik
- 2011

A straightforward discretisation of problems in high dimensions often leads to an exponential growth in the number of degrees of freedom. Sparse grid approximations allow for a severe decrease in the number of used Fourier coefficients to represent functions with bounded mixed derivatives and the fast Fourier transform (FFT) has been adapted to this thin… (More)

- Lutz Kämmerer, Stefan Kunis, Daniel Potts
- J. Complexity
- 2012

Sparse grid discretisations allow for a severe decrease in the number of degrees of freedom for high dimensional problems. Recently, the corresponding hyperbolic cross fast Fourier transform has been shown to exhibit numerical instabilities already for moderate problem sizes. In contrast to standard sparse grids as spatial discretisation, we propose the use… (More)

In this paper, we present algorithms for the approximation of multivariate functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. Recently an algorithm for the trigonometric… (More)

- Lutz Kämmerer
- SIAM J. Numerical Analysis
- 2013

- Lutz Kämmerer
- 2012

The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric… (More)

- Lutz Kämmerer, Daniel Potts, Toni Volkmer
- J. Complexity
- 2015

In this paper, we present algorithms for the approximation of multivariate periodic functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of periodic functions of a certain smoothness. Our considerations include functions from periodic Sobolev… (More)

- Lutz Kämmerer, Daniel Potts, Toni Volkmer
- J. Complexity
- 2015

In this paper, we present error estimates for the approximation of multivariate periodic functions in periodic Hilbert spaces of isotropic and dominating mixed smoothness by trigonometric polynomials. The approximation is based on sampling of the multivariate functions on rank-1 lattices. We use reconstructing rank-1 lattices with generating vectors of… (More)

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… (More)

- L. Kämmerer
- 2014

In this talk, we present algorithms for the approximation of multivariate functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. The proposed algorithm based mainly on a… (More)

- Lutz Kämmerer
- 2013

The approximation of problems in d spatial dimensions by sparse trigono-metric polynomials supported on known or unknown frequency index sets I ⊂ Z d is an important task with a variety of applications. The use of a generalization of rank-1 lattices as spatial discretizations offers a suitable possibility for sampling such sparse trigonometric polynomials.… (More)

- ‹
- 1
- ›