Chaotic iterative methods for the linear complementarity problems |
| |
| Institution: | 1. State Key Laboratory of Scientific/Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, P.O.Box 2719, Beijing 100080, People''s Republic of China;2. Parallel Algorithms Research Centre, Loughborough University of Technology, Loughborough, Leicestershire LE11 3TU, UK |
| |
| Abstract: | A class of parallel multisplitting chaotic relaxation methods is established for the large sparse linear complementarity problems, and the global and monotone convergence is proved for the H-matrix and the L-matrix classes, respectively. Moreover, comparison theorem is given, which describes the influences of the parameters and the multiple splittings upon the monotone convergence rates of the new methods. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
