The parallel iterative algorithm based on approzimate factorization for block-tridiagonal linear systems
In this paper, the parallel iterative algorithm for solving block-tridiagonai linear systems on distributed-memory multi-computers is presented. The coefficient matrix of the block-tridiagonal linear systems is approximately decomposed in order to perform the parallel computation, and an iterative scheme is formed. The communication needs only thrice between the adjacent processors all through the computing process at each iteration. Theoretically, a sufficient condition of convergence of the algorithm is given.Finally, the results on HP rx2600 cluster indicate that the algorithm is feasible with the preferable convergen -ce and efficiency.
block-tridiagonal linear equations approzimate factorization parallel iterative algorithm
Yanhong Fan Quanyi Lv Fangfang Cao Yufeng Nie
Department of Mathematics, Northwest Polytechnical University, Xian, Shaanxi 710072, P.R.China
国际会议
The Third International Workshop on Applied Matriz Theory(第三届国际矩阵分析与应用会议)
杭州
英文
402-405
2009-07-09(万方平台首次上网日期,不代表论文的发表时间)