Linear Algebra - Exam 3 Flashcards

(20 cards)

1
Q

Eigenvector

A

For a nxn matrix A, x is a non-zero vector such that Ax = šœ†x for some scalar šœ†.

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

Eigenvalue

A

A value šœ† of A gives a non-trivial solution vector x to Ax = šœ†x

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

What is the more-used formula for Ax = šœ†x?

A

(A-šœ†I)x = 0

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

Eigenspace of A corresponding to šœ†

A

The set of all solutions to (A-šœ†I)x = 0 is Nul(A-šœ†I). It is a subspace of ā„n

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

Characteristic Polynomial

A

P(šœ†) = det(A-šœ†I)

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

Properties of the characteristic equation

A

1) šœ† is an eigenvalue iff det(A-šœ†I) = 0
2) If šœ† is an eigenvalue, Eig(šœ†) = Nul(A-šœ†I)
3) The roots of the characteristic equation give the eigenvalues of A
4) An nxn matrix can have maximum n eigenvalues

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

Similar Matrices A and B

A

A and B are similar if there exists an invertible matrix P∈ ā„nxn such that A = PBP^(-1)

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

Diagonalizable

A

A is diagonalizable if A = PDP^(-1), with diagonalizable D

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

Properties of a Diagonalizable Matrix

A
  • An nxn matrix A is diagonalizable if it has n linearly independent eigenvectors
  • A = PDP^(-1) iff the columns of P are n linearly independent eigenvectors of A
  • The diagonal entries of D are the eigenvalues corresponding to the eigenvectors in P
  • A is diagnoalizable iff there are enough eigenvectors to form a basis of ā„n, called the eigenvector basis of ā„n
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

For A with less than n linearly independent eigenvectors (Diagonalization)

A
  • A has distinct eigenvalues šœ†1, …, šœ†p
  • The geometric multiplicity of šœ†k, with 1<k<p, is less than or equal to the algebraic multiplicity of šœ†k
  • Bk is a basis for the eigenspace corresponding to šœ†k for each k, and the total collection of vectors in the sets B1,…,Bp forms an eigenvector basis for ā„n
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Inner Product

A
  • uv**=**u**^(T)v**
  • u1v1+…+unvn
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Length

A
  • ||v|| = √(v)^2
  • √(v1^2+v2^2+…+vn^2)
  • ||v||^2 = v^2
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Normalization

A
  • multiplication by 1/||v|| = unit vector u
  • ||u|| = 1
  • u is always in the same direction as v
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Distance

A
  • dist(u,v) = ||u-v||
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Orthogonality

A
  • u*v = 0
  • 0 is orthogonal to all vectors in ā„n
  • ||u+v|| = ||u||^2 + ||v||^2
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Orthogonal Complement (W perp)

A

W⊄ is the orthogonal complement of W if every vector in W⊄ is orthogonal to every vector in W.

17
Q

Properties of W perp

A
  • x∈W⊄ iff x is orthogonal to every vector in a set that spans W
  • W⊄ is a subspace of ā„n
18
Q

Pythagorean Property

A

uv** = ||**u**||||v**||*cos(š›¼), where š›¼ is the angle between u and v

19
Q

Orthogonal Sets

A
  • A set S={u1, … , up} is an orthogonal set if every distinct pair of vectors in the set is orthogonal. That is, ui*uj = 0 when i≠j.
  • If a set is orthogonal, then it is also linearly independent
  • S is a basis for the subspace spanned by S
20
Q

Orthogonal Basis

A

S={u1, … , up} is an orthogonal basis for W in ā„n if for every vector y in W, the weights in the linear combination y = c1u1+….+cpup are given by ci=(y*ui)/ui^2 for i = 1, … , p