For the large sparse linear complementarity problems, by reformulating them as implicit fixed-point equations based on splittings of the system matrices, we establish a class of modulus-based matrix splitting iteration methods and prove their convergence when the system matrices are positive-definit
β¦ LIBER β¦
A modified modulus method for symmetric positive-definite linear complementarity problems
β Scribed by Jun-Liang Dong; Mei-Qun Jiang
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 120 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1070-5325
- DOI
- 10.1002/nla.609
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Modulus-based matrix splitting iteration
β
Zhong-Zhi Bai
π
Article
π
2010
π
John Wiley and Sons
π
English
β 133 KB
Modified Hermitian and skew-Hermitian sp
β
Liang Li; Ting-Zhu Huang; Xing-Ping Liu
π
Article
π
2007
π
John Wiley and Sons
π
English
β 305 KB
A bard-type method for a generalized lin
β
J. J. JΓΊdice; F. M. Pires
π
Article
π
1990
π
John Wiley and Sons
π
English
β 795 KB
In this article we develop an extension of Murty's Bard-type method for the solution of a generalized linear complementarity problem with upper bounds (BLCP) when its matrix M has positive principal minors ( M E P). We prove that the Bard-type algorithm converges to the unique solution of the BLCP w
Mesh-independent convergence of the modi
β
T. Kim; J. E. Pasciak; P. S. Vassilevski
π
Article
π
2006
π
John Wiley and Sons
π
English
β 200 KB
π 1 views