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 tridiago...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.
