L-matrix explained

In mathematics, the class of L-matrices are those matrices whose off-diagonal entries are less than or equal to zero and whose diagonal entries are positive; that is, an L-matrix L satisfies^[1]

L = (\ell _{ij} ); \ell _{ii} > 0 ; \ell _{ij} \leq 0 , i ≠ j.

See also

• Z-matrix—every L-matrix is a Z-matrix
• Metzler matrix—the negation of any L-matrix is a Metzler matrix

Notes and References

1. Book: Young. David M.. Iterative solution of large linear systems. registration. Academic Press. 1971 . Computer Science and Applied Mathematics . 73-170124 . 0127730508.