节点文献
改进的求解线性方程组的并行Arnoldi方法
Improved parallel Arnoldi method for solving linear equations
【摘要】 以Galerkin原理为基础,提出了求解循环块三对角线性方程组的并行算法。根据系数矩阵的稀疏性,选取适当的子空间的基,使算法不但不会发生中断,并从理论上证明了当系数矩阵对称正定时,该并行算法收敛。最后,在HPrx2600集群上进行的数值实验结果表明,该算法的并行效率很高,理论和实际计算相一致。
【Abstract】 A parallel algorithm based on Galerkin method for cycle block-tridiagonal linear equations on distributed-memory multi-computers is presented.A group of vectors spanning subspace chosen properly,the algorithm is no disrupted.In theory,convergence is proved when the coefficient matrix A is a symmetric positive definite matrix.Finally,some numerical results on HP rx2600 cluster show that practice computing is consistent with theory.
【关键词】 循环块三对角线性方程组;
并行算法;
Arnoldi方法;
【Key words】 cycle block-tridiagonal linear equations; parallel algorithm; Arnoldi method;
【Key words】 cycle block-tridiagonal linear equations; parallel algorithm; Arnoldi method;
【基金】 陕西省自然科学基金No.2006A05~~
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2009年22期
- 【分类号】TP301.6
- 【被引频次】1
- 【下载频次】149