PARALLEL CHAOTIC MULTISPLITTING ITERATIVE METHODS FOR THE LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEM  

作　　者：Zhong-zhi Bai (State Key Laboratory of Scientific/Engineering Competing Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing 100080, China) 

出　　处：《Journal of Computational Mathematics》2001年第3期281-292,共12页计算数学（英文）

基　　金：the National Natural Science Foundation of China (19601036) and Subsidized by the SpecialFunds for Major State Basic Research

摘　　要：Focuses on a study which presented a parallel chaotic multisplitting method for solving the large sparse linear complementarity problem. Preliminaries of the study; Equations of the parallel chaotic multisplitting method; Information on the convergence theories; Details on the parallel chaotic multisplitting relaxation methods.Focuses on a study which presented a parallel chaotic multisplitting method for solving the large sparse linear complementarity problem. Preliminaries of the study; Equations of the parallel chaotic multisplitting method; Information on the convergence theories; Details on the parallel chaotic multisplitting relaxation methods.

关 键 词：linear complementarity problem matrix multisplitting chaotic iteration relaxed method convergence property 

分 类 号：O241[理学—计算数学]