This is an old revision of this page, as edited by Fephisto(talk | contribs) at 15:57, 5 October 2020(The more general form should be stated first.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 15:57, 5 October 2020 by Fephisto(talk | contribs)(The more general form should be stated first.)
In linear algebra, a Block LU decomposition is a matrix decomposition of a block matrix into a lower block triangular matrix L and an upper block triangular matrix U. This decomposition is used in numerical analysis to reduce the complexity of the block matrix formula.
Block LDU decomposition
An LU decomposition is LDU (Lower-Diagonal-Upper) decomposition may be performed if is non-singular. Consider a block matrix:
This may be useful for inversion if also (the Schur complement) is non-singular:
An equivalent UDL decomposition exists if is non-singular:
This may be useful for inversion if is non-singular:
Block Cholesky decomposition
If the matrix is symmetric, then an alternative simplification is as follows:
where the matrix is assumed to be non-singular,
is an identity matrix with proper dimension, and is a matrix whose elements are all zero.
We can also rewrite the above equation using the half matrices: