Block LU decomposition: Difference between revisions

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
imported>Boleyn
needs ref
 
imported>AllCatsAreGrey
 
Line 1: Line 1:
{{Unreferenced|date=December 2009}}
{{More citations needed|date=June 2025}}
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.
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.<ref>{{cite journal |last1=Gallivan |first1=K. A. |last2=Plemmons |first2=R. J. |last3=Sameh |first3=A. H. |title=Parallel Algorithms for Dense Linear Algebra Computations |journal=SIAM Review |date=1990 |volume=32 |issue=1 |pages=94–95 |url=https://www.jstor.org/stable/2030382 |access-date=24 June 2025 |issn=0036-1445}}</ref>


==Block LDU decomposition==
==Block LDU decomposition==
Line 151: Line 151:
{{DEFAULTSORT:Block Lu Decomposition}}
{{DEFAULTSORT:Block Lu Decomposition}}
[[Category:Matrix decompositions]]
[[Category:Matrix decompositions]]
[[Category:Linear algebra]]

Latest revision as of 14:03, 24 June 2025

Template:More citations needed 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)=(A12CA*2)(A*2A12B)+(000Q12)(000Q*2),

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

A12A*2=A;A12A12=I;A*2A*2=I;Q12Q*2=Q.

Thus, we have

(ABCD)=LU,

where

LU=(A120CA*20)(A*2A12B00)+(000Q12)(000Q*2).

The matrix LU can be decomposed in an algebraic manner into

L=(A120CA*2Q12)andU=(A*2A12B0Q*2).

See also

References

Template:Reflist

  1. Script error: No such module "Citation/CS1".