CAJ | 학술논문

以Galerkin原理为基础,提出了求解循环块三对角线性方程组的并行算法.根据系数矩阵的稀疏性,选取适当的子空间的基,使算法不但不会发生中断,并从理论上证明了当系数矩阵对称正定时,该并行算法收敛.最后,在HP rx2600集群上进行的数值实验结果表明,该算法的并行效率很高,理论和实际计算相一致.
이Galerkin원리위기출,제출료구해순배괴삼대각선성방정조적병행산법.근거계수구진적희소성,선취괄당적자공간적기,사산법불단불회발생중단,병종이론상증명료당계수구진대칭정정시,해병행산법수렴.최후,재HP rx2600집군상진행적수치실험결과표명,해산법적병행효솔흔고,이론화실제계산상일치.
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 subspaee 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.