Cookies und Tracking helfen uns, Ihnen auf unserer Website ein besseres Erlebnis zu ermöglichen.
NAMColloquium
Fast Fourier-Based Algorithms in Different Kinds of Applications
27.6.2023, 17:15 - 19:00
Vortragende Person:Dr. Franziska Nestler, Universität Chemnitz
Veranstaltungsort:Institut für Numerische und Angewandte Mathematik, Lotzestraße 16-18MN 55Gras Geo Map
Veranstalter:Institut für Numerische und Angewandte Mathematik
Beschreibung:
The fast Fourier transform (FFT) is one of the most important methods in data and signal processing. It can be used to efficiently evaluate trigonometric polynomials on equidistant grids, where the number of required arithmetic operations only increases like O(N log N), where N denotes the grid size.
In many applications, however, arbitrarily distributed data points are given instead of equidistant grids. In order to be able to work efficiently with trigonometric polynomials for such data, the so-called FFT for nonequispaced data (NFFT) can be used.
The spectrum of applications ranges from fast summation methods, the calculation of interactions in particle systems and methods for high-dimensional approximation to (kernel-based) methods in the field of machine learning.
In this talk, we will focus on NFFT and related fast summation methods. After an introduction of these methods, we focus on some selected applications.
Ähnliche Veranstaltungen nach Schlagwort finden:
Veranstaltungsart:Kolloquium
Veranstaltungssprache:Englisch
Kategorie:Forschung
Name der einladenden Person:Prof. Dr. Gerlind Plonka-Hoch
Kontakt:Nadine Kapusniak0551 39 24195n.kapusniak@math.uni-goettingen.de
Export als iCalendar/ICS-Datei:
Download
EN DE