Talks at scientific conferences and workshops

• NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks (pdf)
  International Workshop on Scientific Machine Learning, Cologne, Germany, January 8–10, 2020.
• Rank-1 Lattice Based High-dimensional Approximation and sparse FFT (pdf)
  SIAM Conference on Computational Science and Engineering (CSE19), Spokane, Washington, USA, February 25–March 1, 2019.
• Multiple rank-1 lattice sampling and high-dimensional sparse FFT (pdf)
  7th International Conference on Computational Harmonic Analysis (ICCHA7), Nashville, Tennessee, USA, May 14–18, 2018.
• High-dimensional approximation and sparse FFT (pdf)
  International Conference on New perspectives in the theory of function spaces and their applications (NPFSA-2017), Będlewo, Poland, September 17–23, 2017.
• Sparse high-dimensional FFT using rank-1 lattices (pdf)
  28th International Workshop on Operator Theory and its Applications (IWOTA 2017), Chemnitz, Germany, August 14–18, 2017.
• Multivariate sparse FFT based on rank-1 Chebyshev lattice sampling (pdf)
  12th International Conference on Sampling Theory and Applications (SampTA 2017), Tallinn, Estonia, July 3–7, 2017.
• Sparse high-dimensional FFT with applications to data mining (pdf)
  4th Workshop on Sparse Grids and Applications (SGA 2016), Miami, Florida, USA, October 4–7, 2016.
• Sparse high-dimensional FFT based on rank-1 lattice sampling (pdf)
  4th Dolomites Workshop on Constructive Approximation and Applications (DWCAA16), Alba di Canazei, Italy, September 8–13, 2016.
• Sparse high-dimensional FFT based on rank-1 lattice sampling (pdf)
  12th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (MCQMC 2016), Stanford, California, USA, August 14–19, 2016.
• Fast and exact reconstruction of arbitrary multivariate algebraic polynomials in Chebyshev form (pdf)
  6th Workshop on High-Dimensional Approximation (HDA2015), Bonn, Germany, September 14–18, 2015.
• Fast and exact reconstruction of arbitrary multivariate algebraic polynomials in Chebyshev form (pdf)
  11th International Conference on Sampling Theory and Applications (SampTA 2015), Washington, DC, USA, May 25–29, 2015.
• Fast and stable reconstruction of high-dimensional polynomials based on samples at rank-1 lattice nodes (pdf)
  Mecklenburg Workshop Approximation Methods and Function Spaces, Hasenwinkel, Germany, March 16–20, 2015.
• Approximation of high-dimensional multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (pdf)
  Final Conference of SPP 1324 (SPP-JT14), Marburg, Germany, November 24–28, 2014.
• Approximation of high-dimensional multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (pdf)
  3rd Workshop on Sparse Grids and Applications (SGA 2014), Stuttgart, Germany, September 1–5, 2014.
• Approximation of high-dimensional multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (pdf)
  11th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (MCQMC 2014), Leuven, Belgium, April 6–11, 2014.
• Approximation hochdimensionaler multivariater periodischer Funktionen durch trigonometrische Polynome (pdf)
  Mecklenburger Workshop Approximationsmethoden und schnelle Algorithmen 2014, Hasenwinkel, Germany, March 17–20, 2014.
• Approximation of high-dimensional multivariate functions by trigonometric polynomials based on rank-1 lattice sampling (pdf)
  5th Annual Meeting of SPP 1324 (SPP-JT13), Eisenach, Germany, December 4–6, 2013.
• Approximation of multivariate functions by sampling along (perturbed) rank-1 lattice nodes (pdf)
  Advances in Mathematical Image Processing (AIP), Annweiler, Germany, September 30 – October 2, 2013.
• Taylor and rank-1 lattice based nonequispaced fast Fourier transform (pdf)
  10th International Conference on Sampling Theory and Applications (SampTA 2013), Bremen, Germany, July 1–5, 2013.
• Taylor based nonequispaced fast Fourier transform (pdf)
  Mecklenburger Workshop Approximationsmethoden und schnelle Algorithmen 2013, Hasenwinkel, Germany, March 17–20, 2013.
• Nonequidistant fast Fourier transform for frequencies supported on a subset of the full grid (pdf)
  23. Rhein‐Ruhr‐Workshop 2013, Bestwig, Germany, February 1–2, 2013.

Posters

• NFFT-based Fast Summation for the Graph Laplacian of Fully Connected Networks
  (Part I: NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks,
   Part II: Results of image segmentation via spectral clustering and k-means)
  SIAM Conference on Computational Science and Engineering (CSE19), Spokane, Washington, USA, February 25 - March 1, 2019.
• High-dimensional approximation and sparse FFT using multiple rank-1 lattices (pdf)
  Harmonic Analysis and Applications 2018, Strobl, Austria, June 4-8, 2018.
Sparse high-dimensional FFT based on rank-1 lattice sampling (pdf)
2. International Matheon Conference on Compressed Sensing and its Applications (CSA2015), Berlin, Germany, December 7-11, 2015.

Further talks

• High-dimensional approximation and sparse FFT using (multiple) rank-1 lattices (pdf)
  Mathematical Signal Processing Seminar, Michigan State University, East Lansing, Michigan, USA, February 2019.
• High-dimensional approximation and sparse FFT using (multiple) rank-1 lattices (pdf)
  Technical University of Munich, Garching, Germany, November 2018.
• Approximation of high-dimensional multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (pdf)
  University of Bonn, Bonn, Germany, July 2014.