1/10
Covers the end of Notes 1 and the Beginning of Notes 2 highlighted (Refer to the lecture for proofs))
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Equivalence
We say that matrices A and B in Rnxm are equivalent if there exists invertible matrices S1 in Rnxn and S2 in Rmxm such that we can form A as A = S1BS2
Similarity
We say that matrices A and B in Rnxn are similar if there exists an invertible matrix S in Rnxn such that A=SBS-1
Congruence
We say that matrices A and B in Rnxn are congruent if there exists an invertible matrix S in Rnxn such that A=SBST
Orthogonal Similarity
A and B are orthogonally similar if they are both Similar and Congruent
The Characteristic Polynomial
Given a matrix A in Rnxn, The polynomial formed when you take the det(lambda*I-A)
Eigenvalues
The roots of the characteristic polynomial, are complex numbers
spec(A)
The set of all eigenvalues of matrix A
Algebraic multiplicity
Number of times a single eigenvalue is the root of the characteristic equation
Simple Matrix
The eigenvalues of the matrix all have a multiplicity of 1
Eigenvectors
x in Rn is an eigenvector of A in Rnxn if (lambda*I-A)x = 0.
Geometric Multiplicity
How many linearly independent eigenvectors are associated with that particular eigenvalue lambda