Content deleted Content added
Added atomic inverses and example. Also fixed upper atomic to use u instead of l |
Jitse Niesen (talk | contribs) copy-edit, lower + upper triangular = diagonal, determinant |
||
Line 27:
is called '''upper triangular matrix''' or '''right triangular matrix'''.
If the entries on the [[principal diagonal]] are 1, the matrix is termed '''unit''' upper/lower or '''normed''' upper/lower triangular. If, in addition, all the off-diagonal entries are zero except for the entries in one column, then the matrix is '''atomic''' upper/lower triangular. So an atomic lower triangular matrix is of the form
The matrix▼
:<math> \mathbf{L}_{i} =
\begin{bmatrix}
Line 38 ⟶ 36:
& & \vdots & & \ddots & \\
0 & & l_{n,i} & & & 1 \\
\end{bmatrix}.
</math>
</math>▼
:<math> \mathbf{L}_{i}^{-1} =
\begin{bmatrix}
Line 62 ⟶ 47:
& & \vdots & & \ddots & \\
0 & & -l_{n,i} & & & 1 \\
\end{bmatrix},
</math>▼
</math>
i.e. the
== Notes ==
A matrix which is simultaneously upper and lower triangular is [[diagonal matrix|diagonal]]. The [[identity matrix]] is
The product of two upper triangular matrices is upper triangular, so the set of upper triangular matrices forms an [[associative algebra|algebra]]. Algebras of upper triangular matrices have a natural generalisation in [[functional analysis]] which yields [[nest algebra]]s.
The [[transpose]] of a upper triangular matrix is a lower triangular matrix and vice versa. The [[determinant]] of a triangular matrix equals the product of the diagonal entries.
The variable L is commonly used for lower triangular matrix, standing for lower/left, while the variable U or R is commonly used for upper triangular matrix, standing for upper/right. The variable R has the added benefit of being the same initial for the German term for 'right.'
Line 91 ⟶ 65:
== Examples ==
▲The matrix
:<math>
\begin{bmatrix}
Line 99 ⟶ 74:
</math>
is upper triangular and
:<math>
\begin{bmatrix}
Line 109 ⟶ 83:
is lower triangular.
The matrix
Atomic lower triangular matrix inverse▼
:<math>
\begin{bmatrix}
Line 115 ⟶ 89:
4 & 1 & 0 \\
2 & 0 & 1 \\
\end{bmatrix}
▲</math>
\begin{bmatrix}
1 & 0 & 0 \\
-4 & 1 & 0 \\
-2 & 0 & 1 \\
\end{bmatrix}.
</math>
|