Premium
Direct algorithms to solve the two‐sided obstacle problem for an M ‐matrix
Author(s) -
Zeng J. P.,
Jiang Y. J.
Publication year - 2006
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.487
Subject(s) - obstacle , algorithm , matrix (chemical analysis) , mathematics , computational complexity theory , mathematical optimization , algebra over a field , pure mathematics , materials science , political science , law , composite material
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom