# Quiz Chapter 04.07: LU Decomposition

 MULTIPLE CHOICE TEST LU DECOMPOSITION SIMULTANEOUS LINEAR EQUATIONS

1. The LU decomposition method is computationally more efficient than Naïve Gauss elimination method for solving

2. The lower triangular matrix [L] in the [L][U] decomposition of the matrix given below

• $\begin{bmatrix} 25&5&4 \\ 10&8&16 \\ 8&12&22 \\ \end{bmatrix} = \begin{bmatrix} 1&0&0 \\ l_{21}&1&0 \\ l_{31}&l_{32}&1 \\ \end{bmatrix} \begin{bmatrix} u_{11}&u_{12}&u_{13} \\ 0&u_{22}&u_{23} \\ 0&0&u_{33} \\ \end{bmatrix}$

is

3. The lower triangular matrix [L] in the [L][U] decomposition of the matrix given below

• $\begin{bmatrix} 25&5&4 \\ 0&8&16 \\ 0&12&22 \\ \end{bmatrix} = \begin{bmatrix} 1&0&0 \\ l_{21}&1&0 \\ l_{31}&l_{32}&1 \\ \end{bmatrix} \begin{bmatrix} u_{11}&u_{12}&u_{13} \\ 0&u_{22}&u_{23} \\ 0&0&u_{33} \\ \end{bmatrix}$

is

4. For a given $2000 \times 2000$ matrix [A], assume that it takes about $15$ seconds to find the inverse of [A] by use of the [L][U] decomposition method, that is, finding the [L][U] once, and then doing forward substitution and back substitution $2000$ times using the $2000$ columns of the identity matrix as the right hand side vector. The approximate time, in seconds, that it will take to find the inverse if found by repeated use of the Naïve Gauss elimination method, that is, doing forward elimination and back substitution $2000$ times by using the $2000$ columns of the identity matrix as the right hand side vector is most nearly

5. The algorithm for solving the set of $n$ equations [A][X] = [C], where [A] = [L][U] involves solving [L][Z] = [C] by forward substitution. The algorithm to solve [L][Z] = [C] is given by

6. To solve boundary value problems, the finite difference methods are used resulting in simultaneous linear equations with tridiagonal coefficient matrices. These are solved using the specialized [L][U] decomposition method. The set of equations in matrix form with a tridiagonal coefficient matrix for

• $\dfrac{d^{2}y}{dx^{2}} = 6x - 0.5x^{2}, \, y \left( 0 \right) = 0, \, y \left( 12 \right) = 0,$

using the finite difference method with a second order accurate central divided difference method and a step size of $h=4$ is