## Preliminary list of abstracts

**Note:** We are using the fantastic MathJax JavaScript library to typeset the mathematics on this web page.
You can right-click on a formula to zoom in or to select the rendering engine you like (all under 'Settings').
Under Firefox the default renderer turns out to be MathML (which is quick), but you might prefer the HTML-CSS renderer for more faithful LaTeX rendering.
If you encounter any problems with this setup: then please email us!

Click here to go back to the list of abstracts.

- Kämmerer, Lutz (Faculty of Mathematics, Chemnitz University of Technology, Germany)

A straightforward discretisation of high dimensional problems often leads to an exponential growth in the number of degrees of freedom. So, computational costs of even efficient algorithms like the fast Fourier transform increase similar.

Trigonometric polynomials with frequencies only supported by hyperbolic crosses allow for a good approximation of functions of appropriate smoothness and decrease the number of used Fourier coefficients strongly. As a matter of course, an important issue is the customisation of efficient algorithms to these thinner discretisations.

By using rank-1 lattices as spatial discretisations one can simplify the corresponding multidimensional trigonometric polynomials to one dimensionals in an easy way. With the well known FFT one can evaluate these stable and fast. We generalize this concept by using generating vectors with real-valued entries. By doing this, we can give new strategies to search for stable spatial discretisations of trigonometric polynomials.