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]
See also
- Z-matrix—every L-matrix is a Z-matrix
- Metzler matrix—the negation of any L-matrix is a Metzler matrix
References
- ↑ Young, David M. (1971). Iterative solution of large linear systems. Computer Science and Applied Mathematics. Academic Press. ISBN 0127730508. LCCN 73-170124.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.