Section 3.10

The LU Factorization

[10/100%]
Show
LaTeX
Problem 3.10.1

Let A=[1454182631630]\mathbf{A} = \begin{bmatrix} 1 & 4 & 5 \\ 4 & 18 & 26 \\ 3 & 16 & 30 \end{bmatrix}.

?
(a)

Determine the LU factors of A\mathbf{A}.

(b)

Use the LU factors to solve Ax→1=b→1\mathbf{A}\overrightarrow {x}_{1} = \overrightarrow {b}_{1} as well as Ax→2=b→2\mathbf{A}\overrightarrow {x}_{2} = \overrightarrow {b}_{2}, where

b→1=(60−6)andb→2=(6612). \overrightarrow {b}_{1} = \begin{pmatrix} 6 \\ 0 \\ -6 \end{pmatrix} \qquad \text{and} \qquad \overrightarrow {b}_{2} = \begin{pmatrix} 6 \\ 6 \\ 12 \end{pmatrix}.
(c)

Use the LU factors to determine A−1\mathbf{A}^{-1}.

Problem 3.10.2

Let A\mathbf{A} and b→\overrightarrow {b} be the matrices

A=[1241736−12323−3202−26]andb→=(17334). \mathbf{A} = \begin{bmatrix} 1 & 2 & 4 & 17 \\ 3 & 6 & -12 & 3 \\ 2 & 3 & -3 & 2 \\ 0 & 2 & -2 & 6 \end{bmatrix} \qquad \text{and} \qquad \overrightarrow {b} = \begin{pmatrix} 17 \\ 3 \\ 3 \\ 4 \end{pmatrix}.
?
(a)

Explain why A\mathbf{A} does not have an LU factorization.

(b)

Use partial pivoting and find the permutation matrix P\mathbf{P} as well as the LU factors such that PA=LU\mathbf{P}\mathbf{A} = \mathbf{L}\mathbf{U}.

(c)

Use the information in P\mathbf{P}, L\mathbf{L}, and U\mathbf{U} to solve Ax→=b→\mathbf{A}\overrightarrow {x} = \overrightarrow {b}.

Problem 3.10.3

Determine all values of ξ\xi for which A=[ξ201ξ101ξ]\mathbf{A} = \begin{bmatrix} \xi & 2 & 0 \\ 1 & \xi & 1 \\ 0 & 1 & \xi \end{bmatrix} fails to have an LU factorization.

?
Problem 3.10.4

If A\mathbf{A} is a nonsingular matrix that possesses an LU factorization, prove that the pivot that emerges after (k+1)(k+1) stages of standard Gaussian elimination using only Type III operations is given by

pk+1=ak+1,k+1−c→TAk−1b→, p_{k+1} = a_{k+1,k+1} - \overrightarrow {c}^{T}\mathbf{A}_{k}^{-1}\overrightarrow {b},

where Ak\mathbf{A}_{k} and Ak+1=(Akb→c→Tak+1,k+1)\mathbf{A}_{k+1} = \begin{pmatrix} \mathbf{A}_{k} & \overrightarrow {b} \\ \overrightarrow {c}^{T} & a_{k+1,k+1} \end{pmatrix} are the leading principal submatrices of orders kk and k+1k+1, respectively. Use this to deduce that all pivots must be nonzero when an LU factorization for A\mathbf{A} exists.

?
Problem 3.10.5

If A\mathbf{A} is a matrix that contains only integer entries and all of its pivots are 11, explain why A−1\mathbf{A}^{-1} must also be an integer matrix.

?
Remark.
?

This fact can be used to construct random integer matrices that possess integer inverses by randomly generating integer matrices L\mathbf{L} and U\mathbf{U} with unit diagonals and then constructing the product A=LU\mathbf{A} = \mathbf{L}\mathbf{U}.

Problem 3.10.6

Consider the tridiagonal matrix T=[β1γ100α1β2γ200α2β3γ300α3β4]\mathbf{T} = \begin{bmatrix} \beta_{1} & \gamma_{1} & 0 & 0 \\ \alpha_{1} & \beta_{2} & \gamma_{2} & 0 \\ 0 & \alpha_{2} & \beta_{3} & \gamma_{3} \\ 0 & 0 & \alpha_{3} & \beta_{4} \end{bmatrix}.

?
(a)

Assuming that T\mathbf{T} possesses an LU factorization, verify that it is given by

L=[1000α1/π11000α2/π21000α3/π31],U=[π1γ1000π2γ2000π3γ3000π4], \mathbf{L} = \begin{bmatrix} 1 & 0 & 0 & 0 \\ \alpha _{1}/\pi _{1} & 1 & 0 & 0 \\ 0 & \alpha _{2}/\pi _{2} & 1 & 0 \\ 0 & 0 & \alpha _{3}/\pi _{3} & 1 \end{bmatrix}, \qquad \mathbf{U} = \begin{bmatrix} \pi _{1} & \gamma _{1} & 0 & 0 \\ 0 & \pi _{2} & \gamma _{2} & 0 \\ 0 & 0 & \pi _{3} & \gamma _{3} \\ 0 & 0 & 0 & \pi _{4} \end{bmatrix},

where the πi\pi_{i}'s are generated by the recursion formula

π1=β1andπi+1=βi+1−αiγiπi. \pi _{1} = \beta _{1} \qquad \text{and} \qquad \pi _{i+1} = \beta _{i+1} - \frac{\alpha _{i}\gamma _{i}}{\pi _{i}}.

(This holds for tridiagonal matrices of arbitrary size, making the LU factors of such matrices very easy to compute.)

(b)

Apply the recursion formula given above to obtain the LU factorization of

T=[2−100−12−100−12−100−11]. \mathbf{T} = \begin{bmatrix} 2 & -1 & 0 & 0 \\ -1 & 2 & -1 & 0 \\ 0 & -1 & 2 & -1 \\ 0 & 0 & -1 & 1 \end{bmatrix}.
Problem 3.10.7

An×n\mathbf{A}_{n \times n} is called a band matrix if aij=0a_{ij} = 0 whenever ∣i−j∣>w\left|i-j\right| > w for some positive integer ww, called the bandwidth. In other words, the nonzero entries of A\mathbf{A} are constrained to be in a band of ww diagonal lines above and below the main diagonal. For example, tridiagonal matrices have bandwidth one, and diagonal matrices have bandwidth zero. If A\mathbf{A} is a nonsingular matrix with bandwidth ww, and if A\mathbf{A} has an LU factorization A=LU\mathbf{A} = \mathbf{L}\mathbf{U}, then L\mathbf{L} inherits the lower band structure of A\mathbf{A}, and U\mathbf{U} inherits the upper band structure in the sense that L\mathbf{L} has "lower bandwidth" ww, and U\mathbf{U} has "upper bandwidth" ww. Illustrate why this is true by using a generic 5×55 \times 5 matrix with a bandwidth of w=2w = 2.

?
Problem 3.10.8
?
(a)

Construct an example of a nonsingular symmetric matrix that fails to possess an LU (or LDU) factorization.

(b)

Construct an example of a nonsingular symmetric matrix that has an LU factorization but is not positive definite.

Problem 3.10.9

Recall the LDU factorization: factoring the diagonal pivots out of the upper-triangular factor U\mathbf{U} of an LU factorization A=LU\mathbf{A} = \mathbf{L}\mathbf{U} produces A=LDU′\mathbf{A} = \mathbf{L}\mathbf{D}\mathbf{U}', where D=\diag(u11,u22,…,unn)\mathbf{D} = \diag (u_{11}, u_{22}, \ldots , u_{nn}) is the diagonal matrix of pivots and U′\mathbf{U}' is a rightmost upper-triangular matrix with 11's on its diagonal (renaming U′\mathbf{U}' as U\mathbf{U} hereafter, so both L\mathbf{L} and U\mathbf{U} have unit diagonals in the LDU factorization).

?
(a)

Determine the LDU factors for A=[1454182631630]\mathbf{A} = \begin{bmatrix} 1 & 4 & 5 \\ 4 & 18 & 26 \\ 3 & 16 & 30 \end{bmatrix} (this is the same matrix used in exercise 3.10.1).

(b)

Prove that if a matrix has an LDU factorization, then the LDU factors are uniquely determined.

(c)

If A\mathbf{A} is symmetric and possesses an LDU factorization, explain why it must be given by A=LDLT\mathbf{A} = \mathbf{L}\mathbf{D}\mathbf{L}^{T}.

Problem 3.10.10

Recall: a symmetric matrix A\mathbf{A} possessing an LU factorization in which each pivot is positive is said to be positive definite, and such a matrix can be uniquely factored as A=RTR\mathbf{A} = \mathbf{R}^{T}\mathbf{R}, where R\mathbf{R} is an upper-triangular matrix with positive diagonal entries; this is the Cholesky factorization of A\mathbf{A}, and R\mathbf{R} is the Cholesky factor of A\mathbf{A}.

Explain why A=[123281231227]\mathbf{A} = \begin{bmatrix} 1 & 2 & 3 \\ 2 & 8 & 12 \\ 3 & 12 & 27 \end{bmatrix} is positive definite, and then find the Cholesky factor R\mathbf{R}.

?