06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

5.3. SOLVING LINEAR SYSTEMS USING AN LU FACTORIZATION 125<br />

the row operation which involves replacing a row by itself added to a multiple of another<br />

row. The matrix L is what you get by updating the identity matrix as illustrated above.<br />

You should note that for a square matrix, the number of row operations necessary to<br />

reduce to LU form is about half the number needed to place the matrix in row reduced<br />

echelon form. This is why an LU factorization is of interest in solving systems of equations.<br />

5.3 Solving <strong>Linear</strong> Systems Using An LU Factorization<br />

The reason people care about the LU factorization is it allows the quick solution of systems<br />

of equations. Here is an example.<br />

⎛ ⎞<br />

⎛<br />

Example 5.3.1 Suppose you want to find the solutions to ⎝ 1 2 3 2<br />

⎞ x<br />

4 3 1 1 ⎠ ⎜ y<br />

⎟<br />

⎝ z ⎠ =<br />

1 2 3 0<br />

⎛<br />

w<br />

⎝ 1 ⎞<br />

2 ⎠ .<br />

3<br />

Of course one way is to write the augmented matrix and grind away. However, this<br />

involves more row operations than the computation of an LU factorization and it turns out<br />

that an LU factorization can give the solution quickly. Here is how. The following is an LU<br />

factorization for the matrix.<br />

⎛<br />

⎝ 1 2 3 2<br />

4 3 1 1<br />

1 2 3 0<br />

⎞ ⎛<br />

⎠ = ⎝ 1 0 0 ⎞ ⎛<br />

4 1 0 ⎠ ⎝ 1 2 3 2 ⎞<br />

0 −5 −11 −7 ⎠ .<br />

1 0 1 0 0 0 −2<br />

Let Ux = y and consider Ly = b where in this case, b =(1, 2, 3) T .Thus<br />

⎛<br />

1 0 0<br />

⎞ ⎛<br />

y 1<br />

⎞ ⎛ ⎞<br />

1<br />

⎝ 4 1 0 ⎠ ⎝ y 2<br />

⎠ = ⎝ 2 ⎠<br />

1 0 1 y 3 3<br />

⎛ ⎞<br />

which yields very quickly that y = −2 ⎠ . Now you can find x by solving Ux = y. Thus<br />

⎝ 1<br />

2<br />

in this case,<br />

⎛ ⎞<br />

⎛<br />

⎞ x ⎛ ⎞<br />

1 2 3 2<br />

⎝ 0 −5 −11 −7 ⎠ ⎜ y<br />

1<br />

⎟<br />

⎝ z ⎠ = ⎝ −2 ⎠<br />

0 0 0 −2<br />

2<br />

w<br />

which yields<br />

⎛<br />

− 3 5 + 7 5 t<br />

⎞<br />

9<br />

x = ⎜ 5<br />

⎝<br />

− 11<br />

5 t<br />

⎟<br />

t ⎠ ,t∈ R.<br />

−1<br />

Work this out by hand and you will see the advantage of working only with triangular<br />

matrices.<br />

It may seem like a trivial thing but it is used because it cuts down on the number of<br />

operations involved in finding a solution to a system of equations enough that it makes a<br />

difference for large systems.

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

Saved successfully!

Ooh no, something went wrong!