Derivation and example of the Crout Factorization.

The Crout factorization is similar to the Doolittle factorization except that  [Graphics:../Images/dol_gr_8.gif]  instead of  [Graphics:../Images/dol_gr_9.gif].  

Consider the matrix product  A = LU where L is lower triangular and U is upper triangular.

Use the rule for finding the element [Graphics:../Images/dol_gr_10.gif] to successively compute the entries in U and L.

[Graphics:../Images/dol_gr_11.gif]

Compute the first row of  U  and the first column of  L.

[Graphics:../Images/dol_gr_12.gif]

Compute the second row of  U  and the second column of  L.

[Graphics:../Images/dol_gr_13.gif]

Compute the third row of  U  and the third column of  L.

[Graphics:../Images/dol_gr_14.gif]

Compute the k-th row of  U  and the k-th column of  L.

[Graphics:../Images/dol_gr_15.gif]

The above derivation would lead rise to the following Crout subroutine.

[Graphics:../Images/dol_gr_16.gif]
 
 

Example 1 (b).  Find the A = LU  factorization for the following matrix using the Crout subroutine.

Solution.

[Graphics:../Images/dol_gr_17.gif]
[Graphics:../Images/dol_gr_18.gif]
 

The matrix has been factored it is similar to the Doolittle factorization. But this time the elements on the diagonal of  U  are [Graphics:../Images/dol_gr_19.gif].

There is more computing effort required for the Crout method than the Doolittle method.  For this reason we prefer the Doolittle method.

 

 

 

 

 

 

(c) John H. Mathews