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
L = ( ℓ i j ) ; ℓ i i > 0 ; ℓ i j ≤ 0 , i ≠ j . {\displaystyle L=(\ell _{ij});\quad \ell _{ii}>0;\quad \ell _{ij}\leq 0,\quad i\neq j.}We don't have any images related to L-matrix yet.
You can add one yourself here.
We don't have any YouTube videos related to L-matrix yet.
You can add one yourself here.
We don't have any PDF documents related to L-matrix yet.
You can add one yourself here.
We don't have any Books related to L-matrix yet.
You can add one yourself here.
We don't have any archived web articles related to L-matrix yet.
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. 0127730508 ↩