31. Eigenvectors of Circulant Matrices: Fourier Matrix

Автор: MIT OpenCourseWare

Загружено: 2019-05-16

Просмотров: 40655

Описание:

MIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018
Instructor: Gilbert Strang
View the complete course: https://ocw.mit.edu/18-065S18
YouTube Playlist: • MIT 18.065 Matrix Methods in Data Analysis...

This lecture continues with constant-diagonal circulant matrices. Each lower diagonal continues on an upper diagonal to produce n equal entries. The eigenvectors are always the columns of the Fourier matrix and computing is fast.

License: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu

31. Eigenvectors of Circulant Matrices: Fourier Matrix

Доступные форматы для скачивания:

Скачать видео mp4

Информация по загрузке:

Скачать аудио mp3

Похожие видео

Lecture 32: ImageNet is a Convolutional Neural Network (CNN), The Convolution Rule

Lecture 32: ImageNet is a Convolutional Neural Network (CNN), The Convolution Rule

26. Complex Matrices; Fast Fourier Transform

26. Complex Matrices; Fast Fourier Transform

21. Eigenvalues and Eigenvectors

21. Eigenvalues and Eigenvectors

12. Computing Eigenvalues and Singular Values

12. Computing Eigenvalues and Singular Values

Lecture 8: Norms of Vectors and Matrices

Lecture 8: Norms of Vectors and Matrices

17. Orthogonal Matrices and Gram-Schmidt

17. Orthogonal Matrices and Gram-Schmidt

Discrete Fourier Transform

Discrete Fourier Transform

MIT 18.06SC Linear Algebra, Fall 2011

MIT 18.06SC Linear Algebra, Fall 2011

25. Stochastic Gradient Descent

25. Stochastic Gradient Descent

Метод конечных элементов — Гилберт Стрэнг

Метод конечных элементов — Гилберт Стрэнг

Expressing Vectors in Different Frames Using Rotation Matrices

Expressing Vectors in Different Frames Using Rotation Matrices

The Discrete Fourier Transform (DFT)

The Discrete Fourier Transform (DFT)

6. Singular Value Decomposition (SVD)

6. Singular Value Decomposition (SVD)

Алгоритм быстрого преобразования Фурье

Алгоритм быстрого преобразования Фурье

5. Positive Definite and Semidefinite Matrices

5. Positive Definite and Semidefinite Matrices

Nonrecursive Fast Fourier Transform

Nonrecursive Fast Fourier Transform

14. Low Rank Changes in A and Its Inverse

14. Low Rank Changes in A and Its Inverse

Быстрое преобразование Фурье (БПФ): самый гениальный алгоритм?

Быстрое преобразование Фурье (БПФ): самый гениальный алгоритм?

What eigenvalues and eigenvectors mean geometrically

What eigenvalues and eigenvectors mean geometrically

Circulant Matrices and Fourier Basis

Circulant Matrices and Fourier Basis