The convergence of parallel iteration algorithms for linear complementarity problems

CSpace

	The convergence of parallel iteration algorithms for linear complementarity problems
	Bai, ZZ
	1996-11-01
发表期刊	COMPUTERS & MATHEMATICS WITH APPLICATIONS
ISSN	0898-1221
卷号	32 期号:9 页码:1-17
摘要	For the linear complementarity problem, we set up a class of parallel matrix multisplitting accelerated overrelaxation (AOR) algorithm suitable to multiprocessor systems (SIMD-systems). This new algorithm, when its relaxation parameters are suitably chosen, can not only afford extensive choices for parallely serving the linear complementarity problems, but also can greatly improve the convergence property of itself. When the system matrices of the problems are either H-matrices with positive diagonal elements or symmetric positive definite matrices, we establish convergence theories of the new algorithm in a detailed manner.
关键词	linear complementarity problem matrix multisplitting accelerated overrelaxation technique H-matrix symmetric positive definite matrix convergence theory
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:A1996VU10800001
出版者	PERGAMON-ELSEVIER SCIENCE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/28830
专题	中国科学院数学与系统科学研究院
通讯作者	Bai, ZZ
作者单位	CHINESE ACAD SCI,INST COMPUTAT MATH & SCI ENGN COMP,POB 2719,BEIJING 100080,PEOPLES R CHINA
推荐引用方式 GB/T 7714	Bai, ZZ. The convergence of parallel iteration algorithms for linear complementarity problems[J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS,1996,32(9):1-17.
APA	Bai, ZZ.(1996).The convergence of parallel iteration algorithms for linear complementarity problems.COMPUTERS & MATHEMATICS WITH APPLICATIONS,32(9),1-17.
MLA	Bai, ZZ."The convergence of parallel iteration algorithms for linear complementarity problems".COMPUTERS & MATHEMATICS WITH APPLICATIONS 32.9(1996):1-17.