Direct algorithms to solve the two-sided obstacle problem for an M-matrix

被引：3
|
作者：
Zeng, J. P. [1 ]
Jiang, Y. J.
机构：
[1] Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China
[2] Changsha Univ Sci & Technol, Coll Math & Comp Sci, Changsha, Peoples R China
[3] Hunan Univ, State Key Lab Adv Design & Mfg Vehicle Body, Changsha, Peoples R China
来源：
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS | 2006年 / 13卷 / 07期
关键词：
two-sided obstacle problem; direct algorithm; M-matrix; polynomial computational complexity;
D O I：
10.1002/nla.487
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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 (C) 2006 John Wiley & Sons, Ltd.
引用
收藏
页码：543 / 551
页数：9
相关论文
共 50 条
12345