Lecture 14 Flashcards

1
Q

Range(A)

A

{y = Ax | \forall x}

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

Null(A)

A

{x | Ax = 0}

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

Eigenvector/eigenvalue

A

x ≠ 0 eigenvector of A if there’s Ax = λx, λ eigenvalue. Usually normalized eigenvectors ||x||=1 (because αx is also eigenvector)

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

Find eigenvalues

A

Ax = λx
(A-λI)x=0
p(λ)=det(A-λI)=0 (characteristic polynomial of degree n)
Roots of p(λ) are eigenvalues
Only analytical solutions for n<=4, otherwise approx num –LU would give exact solution if no floating point error.

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

Eigenvalues properties

A

Can have zero/complex/negative values. Eigenvalues can have a multiplicity.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
A =
1  e
e  1
where e=1e-10. Select the correct statement:
A) λ1 = 1
B) λ1 = 0
C) λ1 slightly>1
D) λ1 slightly>0
A

C

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

Diagonalizable matrices

A

A nxn with n linearly independent eigenvectors u.

AU = UD, A=UDU-1 similarity transformation of A (D with λi ordered, U non singular)

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

Power iteration

A

xk = λ1^k[α1.u1 + α2(λ2/λ1)^k.u2 + … + αn(λn/λ1)^k.un

if k → ∞, xk → α1.λ1^k.u1 multiple of u1.

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

Rayleigh coefficient

A

λ= xTAx / xTx

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

Power iteration normalized

A

yk = A.x_{k-1}
xk = yk/||yk||
avoids possible overflow or underflow

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

Power iteration, what if α1=0? (x0 has no component in the dominent eigenvector u1)

A

theory: xk→λ2^k α2 u2 (converges to u2 instead) BUT usually FP operations will introduce such component and α1≠0.

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

Power iteration, what if |λ1|=|λ2|?

A

Does not work, xk→λ1^k α1 u1 + λ2^k α2 u2

  • if sign are the same, method will converge to the correct eigenvalue
  • otherwise, no convergence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Power iteration error

A

||ek|| = O(|λ2/λ1|^k)

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

Power iteration convergence rate

A

linear, ||ek+1||//||ek|| = |λ2|/|λ1|

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

Similarity transformation changes eigenvalues/eigenvectors?

A

changes eigenvectors but not eigenvalues

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

Transformations that does not change the eigenvectors of a matrix but changes eigenvalues?

A
  • Taking any power of the matrix
  • Inverting the matrix
  • Shifting by a scalar multiple of the identity matrix
17
Q

λA1=3, λA2=-1, B=((A-2I)^-1)^2, λB1,λB2=?

A

1, 0.11

18
Q

How many power iterations to reduce the error by a factor of >1e-3?

A

||ek|| = |λ2/λ1|^k ||e0||

so k> log(1e-3)/log(λ2/λ1)

19
Q

Cost power iteration

A

O(n^2) per iteration