Direct algorithms to solve the two‐sided obstacle problem for an M‐matrix
J. P. Zeng, Yingjun Jiang · Numerical Linear Algebra with Applications · 2006
Abstract In this paper, two direct algorithms for solving the two‐sided obstacle problem with an M‐matrix are presented. The algorithms are well defined and have polynomial computational complexity. Copyright © 2006 John Wiley & Sons, Ltd.