Lecture 13 Flashcards

1
Q

sensitivity of solutions linear system (perturbation to b)

A

||Δx|| / ||x|| <= cond(A) ||Δb||/||b||

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

condition number

A

output relerr / input relerr

= (||Δx||/||x||)/(||Δb||/||b||) <= = ||A^-1|| ||A|| = cond(A)

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

ill conditioned system

A

Amplifies error of the input (large cond(A))

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

well conditioned system

A

small cond(A)

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

sensitivity of solutions linear system (perturbation to A)

A

||Δx|| / ||x|| <= cond(A) ||ΔA||/||A||

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

norm condition number

A

||A^-1|| ||A|| = cond(A)

cons relative to a given norm, cond_2(A), cond_infty(A)…

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

What’s the best condition number

A
cond(A) = 1, indeed:
cond(A) = ||A||||A^-1|| >= ||AA^-1|| = ||Id||
||Id|| = max_{||x||=1} ||Id.x|| = max_{||x||=1} ||x|| = 1
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Matrix with optimal conditioning

A

Orthogonal matrices have optimal conditioning (A-1 = A.T) and are very well-behaved in computation

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

Condition number of
100 0 0
0 13 0
0 0 0.5

A

cond(A) = ||A||||A^-1|| = 100.(1/0.5) = 200

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

Condition number properties (4)

A

cond(A) >= 1
cond(Id) = 1
cond(aA) = cond(A)
for any diagonal matrix D, cond(D)=max|di|/min|di|

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

Pivoting and singularity of the matrix relation

A

not related things, pivoting for numerical issues only (little c…)

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

condition number indicator

A

Measure of how close a matrix is to being singular (det(A) close to zero doesn’t mean anything!) large number is nearly singular, a cond close to 1 is far from being singular

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

residual error, error vector

A
||r|| = ||A ^x - b|| (no knowledge of x!)
||e|| = ||x - ^x||
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Guaranteed small if LU with pivot?

A

regardless of the condition number, the relative residual is always small when LU with pivot (not the rel err)
||r|| / (||A|| ||^x||) <= ||ΔA||/||A|| <= c.em

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

Assuming IEEE double precision, how many digits of accuracy Ax=b when k(A)=1000?

A

10^3 10^-16 > 10^-13 digits of accuracy

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

cond(A) if A-1 doesn’t exist

A

\infty by convention (A singular, det A = 0)

17
Q

Rule of the thumb for conditioning

A

||Δx|| / ||x|| <= cond(A) c.em

when solving with LU/pivot, loss of W decimal digits if cond(A)=10^w (from log10(em) digits = log10(2.2e-16))

18
Q

ABx=b, ||Δb||/||b||=1e-4, cond(A)=6, cond(B)=14, worst case rel err ||Δx||/||x||=?

A

84e-4 (because relerrx=rellerrb.condA.condB)