LowerTriangularMatrix
LowerTriangularMatrix[lmat]
converts the lower triangular matrix lmat to a structured array.
Details


- Lower triangular matrices, when represented as structured arrays, allow for efficient storage and more efficient operations, including Det, Inverse and LinearSolve.
- Lower triangular matrices occur when solving linear systems of equations, where they represent simple systems that can be solved by forward substitution. Matrix decompositions that use lower and upper triangular matrices include LU, LDL, LL (Cholesky) and LQ decompositions.
- A lower triangular matrix
satisfies
for
.
- The elements lij need not be numerical.
- The inverse of a lower triangular matrix is another lower triangular matrix.
- Lower triangular matrices are closed under matrix multiplication, so
is again a lower triangular matrix.
- The determinant of a lower triangular matrix is given by the product of the diagonal elements
.
- Operations that are accelerated for LowerTriangularMatrix include:
-
Det time Dot time LinearSolve time - For a LowerTriangularMatrix sa, the following properties "prop" can be accessed as sa["prop"]:
-
"Matrix" lower triangular matrix, represented as a full array "Properties" list of supported properties "Structure" type of structured array "StructuredData" internal data stored by the structured array "StructuredAlgorithms" list of functions with special methods for the structured array "Summary" summary information, represented as a Dataset - Normal[LowerTriangularMatrix[…]] gives the lower triangular matrix as an ordinary matrix.

Examples
open allclose allBasic Examples (2)
Construct a lower triangular matrix:
Normal can convert a LowerTriangularMatrix to its ordinary representation:
Scope (5)
LowerTriangularMatrix objects include properties that give information about the matrix:
The "Summary" property gives a brief summary of information about the matrix:
The "StructuredAlgorithms" property lists the functions that have structured algorithms:
Structured algorithms are typically faster:
When appropriate, structured algorithms return another LowerTriangularMatrix object:
Inverting lt gives another lower triangular matrix:
Transposing lt gives an upper triangular matrix:
The product of lt with its transpose is no longer a triangular matrix:
Construct a lower triangular matrix from a SparseArray with integer entries:
Applications (2)
Properties & Relations (2)
Transposing a LowerTriangularMatrix yields an UpperTriangularMatrix:
The entries of a LowerTriangularMatrix are coerced to the lowest precision:
Possible Issues (1)
LowerTriangularMatrix[a] does not evaluate if a is not manifestly lower triangular:

Use LowerTriangularMatrix[LowerTriangularize[a]] to get the lower triangular part of a:
Text
Wolfram Research (2022), LowerTriangularMatrix, Wolfram Language function, https://reference.wolfram.com/language/ref/LowerTriangularMatrix.html.
CMS
Wolfram Language. 2022. "LowerTriangularMatrix." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/LowerTriangularMatrix.html.
APA
Wolfram Language. (2022). LowerTriangularMatrix. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/LowerTriangularMatrix.html