Jump to content

L-matrix

From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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. Computer Science and Applied Mathematics. Academic Press. ISBN 0127730508. LCCN 73-170124.