|
|||||
|
|
Direct algorithms to solve the two‐sided obstacle problem for an M‐matrix |
|
| Authors: | J P Zeng Y J Jiang |
| 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. |
| Keywords: | two‐sided obstacle problem direct algorithm M‐matrix polynomial computational complexity |