Introduction to Triangular Matrices
A triangular matrix is a special type of square matrix where all elements either above or below the main diagonal are zero.
Upper Triangular Matrix Lower Triangular Matrix
All elements below the main diagonal are zero. All elements above the main diagonal are zero.
Mathematically: a ij = 0 for i > j Mathematically: a ij = 0 for i < j
Key Properties
The transpose of an upper triangular matrix is a lower triangular matrix, and vice versa.
The product of two upper triangular matrices is an upper triangular matrix.
The product of two lower triangular matrices is a lower triangular matrix.
Invertibility Conditions
Theorem:
A triangular matrix is invertible if and only if all diagonal Example: Triangular Matrix with Diagonal Elements
elements are non-zero . Highlighted
Why This Condition?
The determinant of a triangular matrix is the product of its
diagonal entries.
A matrix is invertible if and only if its determinant is non-zero.
Therefore, all diagonal elements must be non-zero for
invertibility.
Consequences
If any diagonal element is zero, the matrix is singular (not
invertible).
The diagonal elements (highlighted) determine invertibility
This provides a quick check for invertibility without calculating
the full determinant.
Properties of Triangular Matrix Inverses
Key Properties
Property 1:
The inverse of an upper triangular matrix is also an upper
triangular matrix.
Property 2:
The inverse of a lower triangular matrix is also a lower triangular
matrix. Example: Upper Triangular Matrix and Its Inverse
Property 3:
The diagonal elements of the inverse are the reciprocals of the Note how the inverse maintains the upper triangular structure
original diagonal elements:
(A -1 )ii = 1/a ii
Property 4:
If A is triangular and B is triangular of the same type (both
upper or both lower), then their product AB is also triangular of
the same type.
Methods for Calculating Inverses
For triangular matrices, we can use specialized methods that are more efficient than general matrix inversion techniques.
Back Substitution Forward Substitution
For Upper Triangular Matrices For Lower Triangular Matrices
To find U -1 where U is upper triangular: To find L -1 where L is lower triangular:
Solve UX = I column by column Solve LX = I column by column
For each column j of X: For each column j of X:
x nj = 1/u nn x 1j = 1/l 11
For i = n-1 down to 1: For i = 2 to n:
n i-1
x ij = (1/u ii )(1 - Σ k=i+1 u ik x kj ) x ij = (1/l ii )(1 - Σ k=1 l ik x kj)
Complexity: O(n 3) Complexity: O(n 3)
Advantages Over General Methods
More efficient: Takes advantage of the known zero structure
Better numerical stability: Avoids unnecessary operations on zero elements
Simpler implementation: The algorithms are straightforward to code
Memory efficient: Can be implemented in-place for large matrices
Example: Inverse of Upper Triangular Matrix
Given Matrix Step 2: Solve for the third column
Let's find the inverse of the following upper triangular matrix: x 33 = 1/u 33 = 1/2 = 0.5
x 23 = (1/u 22 )(0 - u 23 x 33 ) = -2
U = \begin{pmatrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 0 & 0 &
2 \end{pmatrix} x 13 = (1/u 11 )(0 - u 12 x 23 - u 13 x 33 ) = 2.5
We need to solve UX = I for X, where X is the inverse of U.
Step 3: Solve for the second column
Step 1: Set up the system UX = I x 32 = 0
We'll solve for each column of X separately using back x 22 = 1/u 22 = 1
substitution. x 12 = (1/u 11 )(0 - u 12 x 22 ) = -2
Step 4: Solve for the first column
x 31 = x 21 = 0, x 11 = 1
Result
The inverse of U is:
U-1 = \begin{pmatrix} 1 & -2 & 2.5 \\ 0 & 1 & -2 \\ 0 & 0 & 0.5 \end{pmatrix}
