Block LU decomposition: Difference between revisions
imported>AllCatsAreGrey added Category:Linear algebra using HotCat |
imported>YeenBean m Added short description |
||
| Line 1: | Line 1: | ||
{{Short description|Type of matrix factorization}} | |||
{{More citations needed|date=June 2025}} | {{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.<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> | 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> | ||
Latest revision as of 16:33, 4 July 2025
Template:Short description Script error: No such module "Unsubst". 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
<templatestyles src="Reflist/styles.css" />
- ↑ Script error: No such module "Citation/CS1".
Script error: No such module "Check for unknown parameters".