Jump to content

L-matrix

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by InternetArchiveBot (talk | contribs) at 21:41, 8 June 2020 (Bluelink 1 book for verifiability (refca)) #IABot (v2.0.1) (GreenC bot). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

References

  1. ^ Young, David M. (1971). "Iterative solution of large linear systems". Academic Press, New York-London. {{cite journal}}: Cite journal requires |journal= (help)