You are about to erase your work on this activity. Are you sure you want to do this?
Updated Version Available
There is an updated version of this activity. If you update to the most recent version of this activity, then your current progress on this activity will be erased. Regardless, your record of completion will remain. How would you like to proceed?
The multiplicity of an eigenvalue as a root of the characteristic equation.
Characteristic equation
The equation
is called the characteristic equation of .
Characteristic polynomial
The polynomial
is called the characteristic polynomial of .
Diagonalizable matrix
Let be an matrix. Then is said to be diagonalizable if there exists an invertible
matrix such that
where is a diagonal matrix. In other words, a matrix is diagonalizable if it is similar
to a diagonal matrix, .
Eigenspace
If is an eigenvalue of an matrix, the set of all eigenvectors associated to along with
the zero vector is the eigenspace associated to . The eigenspace is a subspace of .
Eigenvalue
Let be an matrix. We say that a scalar is an eigenvalue of if
for some nonzero vector . We say that is an eigenvector of associated with the
eigenvalue .
Eigenvalue decomposition
If is an eigenvalue of an matrix, the set of all eigenvectors associated to along with
the zero vector is the eigenspace associated to . The eigenspace is a subspace of .
Eigenvector
Let be an matrix. We say that a non-zero vector is an eigenvector of
if
for some scalar . We say that is an eigenvalue of associated with the eigenvector .
Geometric multiplicity of an eigenvalue
The geometric multiplicity of an eigenvalue is the dimension of the corresponding
eigenspace .
Gershgorin disk
A circle in the complex plane which has a diagonal entry of a matrix as its center and
the sum of the absolute values of the other entries in that row (or column) as its
radius.
Gershgorin’s Theorem
Gershgorin’s theorem says that the eigenvalues of an matrix can be found in the
region in the complex plane consisting of the Gershgorin disks.
Power method (and its variants)
The power method is an iterative method for computing the dominant eigenvalue of a
matrix. It variants can compute the smallest eigenvalue or the eigenvalue closest to
some target.
Properties of similar matrices
Similar matrices must have the same...
(a)
determinant,
(b)
rank,
(c)
trace,
(d)
characteristic polynomial,
and
(e)
eigenvalues.
Similar matrices
If and are matrices, we say that and are similar, if for some invertible matrix . In
this case we write .
2024-09-06 02:10:36
Start typing the name of a mathematical function to automatically insert it.
(For example, "sqrt" for root, "mat" for matrix, or "defi" for definite integral.)
Controls
Press...
...to do
left/right arrows
Move cursor
shift+left/right arrows
Select region
ctrl+a
Select all
ctrl+x/c/v
Cut/copy/paste
ctrl+z/y
Undo/redo
ctrl+left/right
Add entry to list or column to matrix
shift+ctrl+left/right
Add copy of current entry/column to to list/matrix
ctrl+up/down
Add row to matrix
shift+ctrl+up/down
Add copy of current row to matrix
ctrl+backspace
Delete current entry in list or column in matrix
ctrl+shift+backspace
Delete current row in matrix
×
Start typing the name of a mathematical function to automatically insert it.
(For example, "sqrt" for root, "mat" for matrix, or "defi" for definite integral.)