Скачать или смотреть Discrete Fourier Transform

This video shows how a periodic function can be decomposed into a sequence of sines and cosines and how we can approximate the corresponding Fourier coefficients by a Discrete Fourier Transform (DFT) on a set of equidistant samples of the function values. The DFT is then formulated as a matrix-vector multiplication where the matrix is the Fourier matrix and the vector represents the set of samples.

This video corresponds to Section 3.1 of the book Parallel Scientific Computation: A Structured Approach Using BSP, Second Edition, by Rob H. Bisseling, Oxford University Press, 2020.

An expanded set of slides, solutions to the homework questions, and software accompanying the book can all be found on my personal book page:
https://webspace.science.uu.nl/~bisse...