03.03.2014 Views

Numerical Methods Course Notes Version 0.1 (UCSD Math 174, Fall ...

Numerical Methods Course Notes Version 0.1 (UCSD Math 174, Fall ...

Numerical Methods Course Notes Version 0.1 (UCSD Math 174, Fall ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

3.3. LU FACTORIZATION 31<br />

appropriately:<br />

This continues:<br />

⎡<br />

⎢<br />

⎣<br />

−3<br />

8<br />

−2<br />

−1<br />

⎡<br />

⎢<br />

⎣<br />

−1<br />

8<br />

2<br />

1<br />

⎤ ⎡<br />

⎥<br />

⎦ ⇒ ⎢<br />

⎣<br />

⎤ ⎡<br />

⎥<br />

⎦ ⇒ ⎢<br />

⎣<br />

− 12<br />

5<br />

8<br />

−2<br />

−1<br />

−3<br />

8<br />

−2<br />

−1<br />

⎤<br />

⎥<br />

⎦<br />

⎤ ⎡<br />

⎥<br />

⎦ ⇒ ⎢<br />

⎣<br />

We then perform a permuted backwards substitution on the augmented system<br />

⎛<br />

27 1<br />

0 0<br />

10 5<br />

− 12 ⎞<br />

5<br />

⎜ 4 2 1 2 8<br />

⎟<br />

⎝<br />

17<br />

0 0 0<br />

9<br />

− 2 ⎠<br />

3<br />

5 7 1<br />

0<br />

2 4 2<br />

−1<br />

This proceeds as<br />

Fill in your own values here.<br />

3.3 LU Factorization<br />

We examined G.E. to solve the system<br />

where A is a matrix:<br />

− 12<br />

5<br />

8<br />

− 2 3<br />

−1<br />

⎤<br />

⎥<br />

⎦<br />

x 4 = −2 9<br />

3 17 = −6<br />

17<br />

x 3 = 10 (<br />

− 12<br />

27 5 − 1 )<br />

−6<br />

= . . .<br />

5 17<br />

x 2 = 2 (<br />

−1 − 1 −6<br />

5 2 17 − 7 )<br />

4 x 3 = . . .<br />

x 1 = 1 (<br />

8 − 2 −6<br />

)<br />

4 17 − x 3 − 2x 2 = . . .<br />

⎡<br />

A =<br />

⎢<br />

⎣<br />

Ax = b,<br />

⎤<br />

a 11 a 12 a 13 · · · a 1n<br />

a 21 a 22 a 23 · · · a 2n<br />

a 31 a 32 a 33 · · · a 3n<br />

.<br />

. . . ..<br />

⎥<br />

. ⎦<br />

a n1 a n2 a n3 · · · a nn<br />

We want to show that G.E. actually factors A into lower and upper triangular parts, that is A = LU,<br />

where ⎡<br />

⎤ ⎡<br />

⎤<br />

1 0 0 · · · 0<br />

u 11 u 12 u 13 · · · u 1n<br />

l 21 1 0 · · · 0<br />

0 u 22 u 23 · · · u 2n<br />

L =<br />

l 31 l 32 1 · · · 0<br />

, U =<br />

0 0 u 33 · · · u 3n<br />

.<br />

⎢<br />

⎣<br />

.<br />

. . . ..<br />

⎥ ⎢<br />

. ⎦ ⎣<br />

.<br />

. . . ..<br />

⎥<br />

. ⎦<br />

l n1 l n2 l n3 · · · 1<br />

0 0 0 · · · u nn<br />

We call this a LU Factorization of A.<br />

.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!