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

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(n3) and is more efficient than those in (Numer. Linear Algebra Appl. 2006; 13:543–551). Copyright © 2010 John Wiley & So...

Full description

Saved in:
Bibliographic Details
Published in:Numerical linear algebra with applications Vol. 18; no. 1; pp. 167 - 173
Main Authors: Jiang, Ying-Jun, Zeng, Jin-Ping
Format: Journal Article
Language:English
Published: Chichester, UK John Wiley & Sons, Ltd 01.01.2011
Subjects:
Algorithms
Complexity
Computation
direct algorithm
Linear algebra
M-matrix
Mathematical models
Obstacles
polynomial computational complexity
two-sided obstacle problem
ISSN:1070-5325, 1099-1506, 1099-1506
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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(n3) and is more efficient than those in (Numer. Linear Algebra Appl. 2006; 13:543–551). Copyright © 2010 John Wiley & Sons, Ltd.
Bibliography:ark:/67375/WNG-CQG5J12C-K
ArticleID:NLA726
National Natural Science Foundation of People's Republic of China - No. 10901027; No. 10971058
istex:7B519C8CE964AE65A8CFEF9C6BC1616A250C5AC8
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1070-5325
1099-1506
1099-1506
DOI:10.1002/nla.726