Back to Search Start Over

Direct algorithm for the solution of two-sided obstacle problems with M-matrix.

Authors :
Jiang, Ying-Jun
Zeng, Jin-Ping
Source :
Numerical Linear Algebra with Applications; Jan2011, Vol. 18 Issue 1, p167-173, 9p
Publication Year :
2011

Abstract

A direct algorithm for the solution to the affine two-sided obstacle problem with an M-matrix is presented. The algorithm has the polynomial bounded computational complexity O( n) and is more efficient than those in ( Numer. Linear Algebra Appl. 2006; :543-551). Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
ALGORITHMS
MATRICES (Mathematics)
POLYNOMIALS
COMPUTATIONAL complexity
LINEAR complementarity problem
PROBLEM solving
GAUSSIAN processes

Details

Language :
English
ISSN :
10705325
Volume :
18
Issue :
1
Database :
Complementary Index
Journal :
Numerical Linear Algebra with Applications
Publication Type :
Academic Journal
Accession number :
57366856
Full Text :
https://doi.org/10.1002/nla.726
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details