Block LU decomposition

From Wikipedia, the free encyclopedia

Template:Short description

Page Module:Message box/ambox.css has no content.

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.[1]

Block LDU decomposition

(ABCD)=(I0CA1I)(A00DCA1B)(IA1B0I)

Block Cholesky decomposition

Consider a block matrix:

(ABCD)=(ICA1)A(IA1B)+(000DCA1B),

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)=(A12CA2)(A2A12B)+(000Q12)(000Q2),

where the Schur complement of A in the block matrix is defined by

Q=DCA1B

and the half matrices can be calculated by means of Cholesky decomposition or LDL decomposition. The half matrices satisfy that

A12A2=A;A12A12=I;A2A2=I;Q12Q2=Q.

Thus, we have

(ABCD)=LU,

where

LU=(A120CA20)(A2A12B00)+(000Q12)(000Q2).

The matrix LU can be decomposed in an algebraic manner into

L=(A120CA2Q12)andU=(A2A12B0Q2).

See also

References

Page Template:Reflist/styles.css has no content.

  1. ^ Page Module:Citation/CS1/styles.css has no content.Gallivan, K. A.; Plemmons, R. J.; Sameh, A. H. (1990). "Parallel Algorithms for Dense Linear Algebra Computations". SIAM Review. 32 (1): 94–95. ISSN 0036-1445. Retrieved 24 June 2025.