Thank you professor for this fantastic lecture! At around 4:10, the professor says: Hermitian matrices have m distinct eigenvalues. I think that is not always true, however. One counterexample is the mxm identity matrix: although it is Hermitian (i.e., symmetric), it has only one single eigenvalue (which is one) with an algebraic multiplicity of m.

Great stuff. I hadn't really gone through this before. Makes good sense...thanks for the clear explanation.

Great explanation!

You are the best! I would like to attend some of your classes.

Thanks a lot sir 🙏 very well explained 🙏

I'm probably missing something, but shouldn't the equation for the eigenvalue lambda (visible at the bottom right at 26:00) also be divided by v-transpose times v?

The Reighley quotient iteration can give you m eigenvalues and eigenvectors? In my intuition, I think this algorithm still procudes only the largest eigenvalue, but with cubic convergence speed compared to the standard power iteration. Am I right?

Please an an example problem for more clarity.