Sei sulla pagina 1di 6

# Cholesky, Doolittle and Crout Factorization

## 6. Cholesky, Doolittle and Crout Factorization

Definition (LU-Factorization). The nonsingular matrix A has an LU-factorization if it can be expressed as the product of a lower-triangular matrix L and an upper triangular matrix U: . When this is possible we say that A has an LU-decomposition. It turns out that this factorization (when it exists) is not unique. If L has 1's on it's diagonal, then it is called a Doolittle factorization. If U has 1's on its diagonal, then it is called a Crout factorization. When (or ), it is called a Cholesky decomposition. Doolittle Factorization. If A has a Doolittle factorization A = LU.

## Cholesky, Doolittle and Crout Factorization

Cholesky Factorization. If A is real, symmetric and positive definite matrix, then it has a Cholesky , where U an upper triangular matrix ( ). factorizationhas a Cholesky factorization

## where L is a lower triangular matrix (

Theorem (A = LU; Factorization with NO Pivoting). Assume that A has a Doolittle, Crout or , is found in three steps: Cholesky factorization. The solution X to the linear system 1. Construct the matrices , if possible. for using forward substitution. 2. Solve for using back substitution. 3. Solve Example 1. Find the A = LU factorization for the matrix method.
file:///C|/numerical_analysis/chap02/CholeskyMod.html (2 of 3)02.11.2006 20:02:20

Solution 1.

## . Use the Doolittle

file:///C|/numerical_analysis/chap02/CholeskyMod_lnk_1.html02.11.2006 20:02:20

## . Use the Crout

file:///C|/numerical_analysis/chap02/CholeskyMod_lnk_2.html02.11.2006 20:02:20

## . Use the Cholesky

file:///C|/numerical_analysis/chap02/CholeskyMod_lnk_3.html02.11.2006 20:02:20