中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
The convergence of parallel iteration algorithms for linear complementarity problems

文献类型:期刊论文

作者Bai, ZZ
刊名COMPUTERS & MATHEMATICS WITH APPLICATIONS
出版日期1996-11-01
卷号32期号:9页码:1-17
关键词linear complementarity problem matrix multisplitting accelerated overrelaxation technique H-matrix symmetric positive definite matrix convergence theory
ISSN号0898-1221
英文摘要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.
语种英语
WOS记录号WOS:A1996VU10800001
出版者PERGAMON-ELSEVIER SCIENCE LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/28829]  
专题中国科学院数学与系统科学研究院
通讯作者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.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。