Opening Linear Algebra: Finding Eigenvectors of a Matrix
Linear Algebra: Finding Eigenvectors of a Matrix
- Length
- 53 min
- Level
- Undergraduate
Chapter 1 of 6: Defining eigenspaces
Eigenspaces of a square matrix are the kernels of , one for each eigenvalue. Hower works through a matrix with distinct eigenvalues, row reducing to find a basis for each eigenspace. She proves that eigenvectors belonging to distinct eigenvalues are linearly independent and defines geometric multiplicity as an eigenspace's dimension. A matrix is diagonalizable exactly when these multiplicities sum to , and a second example builds an eigenbasis on that criterion. The session, number 21 of Linear Algebra: Systems, Matrices & Transformations, ends by constructing a non-diagonalizable upper triangular matrix for every .
Your comment is kept while you sign up.Sign in
Hower computes eigenspaces as kernels of and proves when a matrix fails to diagonalize.
Eigenspaces of a square matrix are the kernels of , one for each eigenvalue. Hower works through a matrix with distinct eigenvalues, row reducing to find a basis for each eigenspace. She proves that eigenvectors belonging to distinct eigenvalues are linearly independent and defines geometric multiplicity as an eigenspace's dimension. A matrix is diagonalizable exactly when these multiplicities sum to , and a second example builds an eigenbasis on that criterion. The session, number 21 of Linear Algebra: Systems, Matrices & Transformations, ends by constructing a non-diagonalizable upper triangular matrix for every .
This lecture
Lecture 21 of 24 of Linear Algebra: Systems, Matrices & Transformations.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.