Analysis of parallel preconditioned conjugate gradient algorithms

被引：1
|
作者：
Ciegis, R [1 ]
机构：
[1] Vilnius Gediminas Tech Univ, LT-10223 Vilnius, Lithuania
来源：
INFORMATICA | 2005年 / 16卷 / 03期
关键词：
parallel algorithms; preconditioned conjugate gradient method; scalability analysis; incomplete factorization;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The conjugate gradient method is an iterative technique used to solve systems of linear equations. The paper analyzes the performance of parallel preconditioned conjugate gradient algorithms. First, a theoretical model is proposed for estimation of the complexity of PPCG method and a scalability analysis is done for three different data decomposition cases. Computational experiments are done on IBM SP4 computer and some results are presented.. It is shown that theoretical predictions agree well with computational results.
引用
收藏
页码：317 / 332
页数：16
相关论文
共 50 条
12345