strictly lower triangular matrix

(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

It may be more compactly represented in an array by storing entry (i,j) in location (i-1)(i-2)/2 + j (one-based indexing).

Author: PEB

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:08 2006.

Cite this as:
Paul E. Black, "strictly lower triangular matrix", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/strictlyLowerTriangMat.html