(data structure)
Definition: A matrix that is only defined at (i,j) when i > j.
Generalization (I am a kind of ...)
lower triangular matrix.
See also strictly upper triangular matrix, ragged matrix.
Note:
For example
j i - - - - 7 - - - 1 0 - - 1 9 5 -
It may be more compactly represented in an array by storing entry (i,j) in location (i-1)(i-2)/2 + j (1-based indexing).
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 16 November 2016.
HTML page formatted Wed Oct 30 12:15:31 2024.
Cite this as:
Paul E. Black, "strictly lower triangular matrix", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 16 November 2016. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/strictlyLowerTriangMat.html