On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem

被引：46

作者：

Bai, ZZ ^{[1
]}

机构：

[1] Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, State Key Lab Sci Engn Comp, Beijing 100080, Peoples R China

来源：

IMA JOURNAL OF NUMERICAL ANALYSIS | 1998年 / 18卷 / 04期

基金：

中国国家自然科学基金;

关键词：

D O I：

10.1093/imanum/18.4.509

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The monotone convergence of the parallel matrix multisplitting relaxation method for linear complementarity problems (see Bai, Z. Z. and Evens, D. J. 1997 Int. J. Comput. Math. 63, 309-326) is discussed, and the corresponding comparison theorem about the monotone convergence rate of this method is thoroughly established.

引用

页码：509 / 518

页数：10

共 4 条

[1] Matrix multisplitting relaxation methods for linear complementarity problems [J].

Bai, ZZ ;

Evans, DJ .

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1997, 63 (3-4) :309-326

[2]

HADJIDIMOS A, 1978, MATH COMPUT, V32, P149, DOI 10.1090/S0025-5718-1978-0483340-6

[3] CONVERGENCE OF PARALLEL MULTISPLITTING ITERATIVE METHODS FOR M-MATRICES [J].

NEUMANN, M ;

PLEMMONS, RJ .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1987, 88-9 :559-573

[4]

WANG D, 1991, LINEAR ALGEBRA APPL, V154, P473

← 1 →