摘要
A parallel solver for cyclic tridiagonal systems on distributed-memory multi- computers is presented. The complexity of the algorithm is analyzed. We prove that the processes will not break down if the cyclic tridiagonal systems’ coefficient matrix is strictly diagonally dominant. The results of numerical experiments on a distributed-memory multicomputer YH3E show that the algorithm has a high parallel efficiency.
A parallel solver for cyclic tridiagonal systems on distributed-memory multi- computers is presented. The complexity of the algorithm is analyzed. We prove that the processes will not break down if the cyclic tridiagonal systems' coefficient matrix is strictly diagonally dominant. The results of numerical experiments on a distributed-memory multicomputer YH3E show that the algorithm has a high parallel efficiency.
出处
《数值计算与计算机应用》
CSCD
北大核心
2001年第4期254-261,共8页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金重点项目(项目编号 69933030)
国家高技术研究发展计划(项目编号 863-306-ZD-01-03-4)
