Block LU decomposition

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

(ABCD)=(I0CA−1I)(A00D−CA−1B)(IA−1B0I)

Block Cholesky decomposition

Consider a block matrix: (ABCD)=(ICA−1)A(IA−1B)+(000D−CA−1B), where the matrix A is assumed to be non-singular, I is an identity matrix with proper dimension, and 0 is a matrix whose elements are all zero.

We can also rewrite the above equation using the half matrices: (ABCD)=(A12CA−∗2)(A∗2A−12B)+(000Q12)(000Q∗2), where the Schur complement of A in the block matrix is defined by Q=D−CA−1B and the half matrices can be calculated by means of Cholesky decomposition or LDL decomposition. The half matrices satisfy that A12A∗2=A;A12A−12=I;A−∗2A∗2=I;Q12Q∗2=Q.

Thus, we have (ABCD)=LU, where LU=(A120CA−∗20)(A∗2A−12B00)+(000Q12)(000Q∗2).

The matrix LU can be decomposed in an algebraic manner into L=(A120CA−∗2Q12)  and  U=(A∗2A−12B0Q∗2).

See also