eigensystems and canonical forms Flashcards

1
Q

eigenvector:

A

a vector x is an eigenvalue of A (A is square) if x is nonzero and Ax is a multiple of x
i.e. there is some λ such that Ax=λx

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

eigenvalue:

A

λ is an eigenvalue of A if Ax=λx with x being an eigenvector
det(λI-A)=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

eigenpair:

A

the λ and x that are eigenvalue/vector of A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

characteristic polynomial:

A

p(λ)=det(λI-A) - some polynomial equal to 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

spectrum:

A

the set of all eigenvalues of A
an nxn matrix has n eigenvalues, so Λ(A)={λ1,…,λn}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

invariant subspace:

A

a subspace X is invariant for A if AX in X - x in X implies Ax in X

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

how to check if the spectrum of B is contained within the spectrum of A:

A

let the columns of Y in C^(nxp), p<=n, form a basis for a subspace X of C^n. X is invariant iff AY=YB for some B in C^pxp. when the latter holds, the spectrum of B is contained within that of A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

similar:

A

two matrices A and B are similar if there exists a nonsingular matrix P such that B=P^(-1)AP

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

similarity transformation:

A

B=P^(-1)AP

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

transforming matrix:

A

P in B=P^(-1)AP

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

similarity and eigenpairs:

A

if A and B are similar, A and B have the same eigenvalues, and x is an eigenvector of A with associated eigenvalue λ iff P^(-1)x is an eigenvector of B with the same associated eigenvalue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

unitarily similar:

A

two matrices A and B are unitarily similar if there is a unitary matrix U such that B=U*AU

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

orthogonally similar:

A

if A and B are real matrices, they are orthogonally similar if there is a real orthogonal matrix U such that B=U^(T)AU

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

if A is similar to a diagonal matrix:

A

A is called diagonalizable and/or simple

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

schur’s theorem:

A

let A be a square matrix, then there exists a unitary matrix U and an upper triangular matrix T such that T=U^(-1)AU=U*AU

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

schur decomposition:

A

A=UTU*, not unique

17
Q

schur vector:

A

the columns of U in a schur decomp

18
Q

normal:

A

a matrix A is normal if AA=AA

19
Q

the spectral theorem:

A

god what a cool name
A is normal iff there is a unitary matrix U and a diagonal matrix Λ such that A=UΛU*

20
Q

if A in C^nxn has n orthogonal eigenvectors:

A

A is normal

21
Q

an nxn matrix A is diagonalizable iff:

A

A has n linearly independent eigenvectors

22
Q

a matrix with distinct eigenvalues is:

A

diagonalizable

23
Q

the jordan canonical form:

A

any square matrix can be expressed in the form X^(-1)AX=J=
[J1(λ1)

Jp(λp)]
Jk=Jk(λk)=
[λk 1
λk 1
… …
1
Ak] in C^mkxmk
where X is nonsingular and m1+…+mp=n

24
Q

jordan block:

A

the mkxmk matrices in the jcf that go along the diagonal

25
Q

jordan matrix properties:

A

the number p of jordan block is the number of linearly independent eigenvectors of A, so A is diagonalizable iff n=p
the algebraic multiplicity of an eigenvalue λ is the sum of dimensions of the jordan blocks in which λ appears
the geometric multiplicity of λ is the number of jordan blocks associated with λ - dim(null(A-λI))

26
Q

defective:

A

an eigenvalue is defective if it appears in a jordan block of size greater than 1, or equivalently if its algebraic multiplicity exceeds its geometric multiplicity
a matrix is defective if it has a defective eigenvalue or equivalently if it doesn’t have a complete set of linearly independent eigenvectors

27
Q

how to find the jordan canonical form of a given matrix A:

A

find all the distinct eigenvalues of A, maybe by finding the roots of the characteristic polynomial
for each distinct eigenvalue λi of A, form (A-λiI), (A-λiI)^2, … and analyse the sequence of ranks as follows:
the smallest value of ki for which rank(A-λiI)^ki attains its minimum value is the order of the largest block corresponding to λi, this is called the index of λi
the no. of blocks of size k in J with eigenvalue λi is rank(A-λiI)^(k-1)+rank(A-λiI)^(k+1)-2rank(A-λiI)^k

28
Q

generalised eigenvectors:

A

let X^(-1)AX=J
AX=XJ
the columns of X in positions 1, m1+1, m1+m2+1,… are eigenvectors of A and are linearly independent as X is nonsingular
the other columns are generalised eigenvectors

29
Q

jordan chain:

A

equating the first m1 columns of AX=XJ corresponding to the first jordan block J1 gives us Ax1=λ1x1, Axi=λ1xi+x(i-1), i=2,…,m1
the vectors x1,…,xm1 are called a jordan chain

30
Q

cayley-hamilton theorem:

A

if p is the characteristic polynomial of a nxn matrix A, then p(A)=0

31
Q

minimal polynomial:

A

let A be a nxn matrix with s distinct eigenvalues λ1,…,λs - the minimal polynomial is q(λ)=(s)Π(i=1)(λ-λi)^ni, where ni is the dimension of the largest jordan block in which λi appears