Doolittle Algorithm: LU DecompositionIn this section, we will learn about the LU decomposition of a matrix with the help of Doolittle's algorithm. Here LU can also be known as the "LU factorization", where LU stands for 'Lower Upper'. In 1938, the famous mathematician Tadeusz Banachiewicz was introduced the LU decomposition. In the Doolittle algorithm, we will factor the matrix in the form of multiplication of a lower triangular matrix and upper triangular matrix in the case of numerical analysis and linear analysis. With the help of LU decomposition, computers can be solved the square systems of linear equations. At the time of computing the determinant of matrix or inverting a matrix, this will be a key step. Suppose there is a square matrix which is indicated by A. An LU factorization can be described as the factorization of A with proper column and/or rows permutation or order, which will be divided into two factors, i.e., a lower triangular matrix, which is represented by L, and an upper triangular matrix, which is represented by U. So A = LU. Doolittle AlgorithmA square matrix can be easily factored into a lower triangular matrix and upper triangular matrix, which is described as follows:
[A] = [L] [U]
We have one more way to factor A into an LU decomposition, which is Doolittle's method. This method allows us to do factor without going through the hassle of Gaussian Elimination. Suppose there is an n * n matrix A. Here we will assume that this matrix also contains the LU decomposition, and we will explicitly write the form of L and U. After that, we will use the systematic manner to solve the entries in L and U with the help of equations that result from the multiplications necessary for A = LU. The terms used for the U matrix are described as follows: And the term which is used for the L matrix is described as follows: Examples of LU decomposition:Example 1: Input: Output: Example 2: In this example, we will find the LU decomposition with the help of using Doolittle's method of the given matrix: Solution: According to the Doolittle algorithm, A = LU So The above matrix implies that: u_{11 }= 8 u_{12 }= 6 u_{13 }= 2 I_{21}u_{11 }= 6 ⇒ I_{21} * 8 = 6 ⇒ I_{21} = 3/4 I_{21}u_{12} + u_{22} = 7 ⇒ (3/4) * (6) + u_{22 }= 7 ⇒ u_{22 }= 5/2 I_{21}u_{13} + u_{23} = 4 ⇒ (3/4) × 2 + u_{23} = 4 ⇒ u_{23} = 5/2 l_{31}u_{11} = 2 ⇒ l_{31} × 8 = 2 ⇒ l_{31} = 1 / 4 l_{31}u_{12} + l_{32}u_{22} = 4 ⇒ 1/4 × (6) + l_{32} × 5/2 = 4 ⇒ l_{32} = 1 l_{31}u_{13} + l_{32}u_{23} + u_{33} = 3 ⇒ 1/4 × 2 + (1) × (5/2) + u_{33} = 3 ⇒ u_{33} = 0 A = L * U = LU Doolittle's MethodHere we will describe the steps of a Doolittle method LU factorization of A when there is the unit value in the diagonal elements of lower triangular matrix L. Steps:
Example: X_{1} + X_{2} + X_{3}= 5 X_{1} + 2X_{2} + 2X_{3} = 6 X_{1} + 2X_{2}+ 3X_{3} = 8 Solution: Suppose A = LU. So, Suppose Ly = B Y_{1} = 5 Y_{1} + Y_{2} = 6; Y_{2} = 1 Y_{1} + Y_{2} + Y_{3} = 8; Y_{3} = 2 Y_{1} = 5 Y_{2} = 1 Y_{3} = 2 Suppose Ux = Y
Next TopicRSA Encryption in Discrete Mathematics
