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 โฆ
Chaotic iterative methods for the linear complementarity problems
โ Scribed by Zhong-Zhi Bai; D.J. Evans
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 550 KB
- Volume
- 96
- Category
- Article
- ISSN
- 0377-0427
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
Iterative algorithms for semi-linear qua
โ
Muhammad Aslam Noor
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 552 KB
Iterative methods for a class of complem
โ
Muhammad Aslam Noor
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 853 KB
Inexact multisplitting methods for linea
โ
Jun-Liang Dong
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 571 KB
We present an inexact multisplitting method for solving the linear complementarity problems, which is based on the inexact splitting method and the multisplitting method. This new method provides a specific realization for the multisplitting method and generalizes many existing matrix splitting meth
The convergence of parallel iteration al
โ
Zhong-Zhi Bai
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 768 KB
Convergence of SSOR methods for linear c
โ
Mehdi Dehghan; Masoud Hajarian
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 933 KB