摘要
This paper presents a new CG-type algorithm for solving large linear systems. It isobtained from a subclass of the ABS algorithm-Voyevodin’s CG method by choosingthe parameter matrix B in some special ways. Having preconditioning properties, thematrix B makes the new algorithm converge fast. The convergence analysis is given.Several ways for choosing B, which are similar to the polynomial preconditioing, arediscussed. Numerical tests indicate that the new algorithm is effective and competitive.Besides, it is suitable for parallel architectectures.
This paper presents a new CG-type algorithm for solving large linear systems. It isobtained from a subclass of the ABS algorithm-Voyevodin's CG method by choosingthe parameter matrix B in some special ways. Having preconditioning properties, thematrix B makes the new algorithm converge fast. The convergence analysis is given.Several ways for choosing B, which are similar to the polynomial preconditioing, arediscussed. Numerical tests indicate that the new algorithm is effective and competitive.Besides, it is suitable for parallel architectectures.
出处
《数值计算与计算机应用》
CSCD
北大核心
1999年第2期131-137,共7页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金!39560018
