Given the symmetric structure of the LDU factors of a symmetric matrix (see Section 7.1) and the common use of LU factorization in the analysis of linear systems, it is constructive to develop expressions that relate an explicit LU decomposition to an implicit LDU factorization. In subsequent sections of this document, they will prove useful in deriving symmetric variants of the algorithms discussed in Section 4 and Section 5.
In other words, the symmetric factorization algorithms discussed in this document assume an LU decomposition exists (or is to be computed) such that
Its existing (explicit) factorization (either L or U) is triangular, and
The desired (implicit) factorization is unit triangular.
This implies that algorithms which deal with an explicit set of lower triangular factors, call them , will associate the factors of an implicit LDU decomposition as follows
Substituting for L based on Equation 58 yields
Recalling that the inverse of a diagonal matrix is the arithmetic inverse of each element and taking the product yields
In a similar vein, algorithms that deal with an explicit set of upper triangular factors, call them , will associate the factors of an LDU decomposition as follows.
This association yields the following relationship between the explicit factors and implicit factors L.
These observations show that it is only necessary to compute and store or during the LU factorization of a symmetric matrix. This halves the arithmetic required during the factorization procedure. However, symmetry does not reduce the work required during forward and backward substitution.