Dashboard
Featured nodes
Roots
Public root
Templates
Test template
iCorps template
Guanyu's Latex template
Ivar's latex template
Family Tree template
Latex template
Router template
Orphans
Browse orphan nodes
Related nodes
Parents
1
Matrix diagonalization
Siblings
9
Sort by title
Sort by date
Definition of matrix diagonalization
Definition of diagonalizable matrix
An n-by-n matrix is diagonalizable if and only if it has n linearly independent eigenvectors.
An n-by-n matrix is diagonalizable if and only if the sum of the dimensions of the eigenspaces equals n.
An n-by-n matrix is diagonalizable if and only if the characteristic polynomial factors completely
A diagonalizable matrix is diagonalized by a matrix having the eigenvectors as columns.
An n-by-n matrix is diagonalizable if and only if the union of the basis vectors for the eigenspaces is a basis for R^n (or C^n).
An n-by-n matrix with n distinct eigenvalues is diagonalizable.
Formula for diagonalizing a real 2-by-2 matrix with a complex eigenvalue.
Knowen
Graph of nodes
New tree
New public tree
Not logged in
Sign in
Sign up
Help
Welcome to Knowen!
Edit test node (no login required)
Create new test node (no login required)
Now you are in the subtree of
Math
public knowledge tree.
Matrix diagonalization
Parent nodes
Go to node
3
Edit node
An n-by-n matrix with n distinct eigenvalues is diagonalizable.
Created over 8 years ago
Put content here.
×
Quick navigation
Nodes loading ...