Block LU decomposition: Difference between revisions
imported>Boleyn needs ref |
imported>AllCatsAreGrey added Category:Linear algebra using HotCat |
||
| Line 1: | Line 1: | ||
{{ | {{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
Block Cholesky decomposition
Consider a block matrix:
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:
where the Schur complement of in the block matrix is defined by
and the half matrices can be calculated by means of Cholesky decomposition or LDL decomposition. The half matrices satisfy that
Thus, we have
where
The matrix can be decomposed in an algebraic manner into
See also
References
- ↑ Script error: No such module "Citation/CS1".