Parallel strategy for solving block-tridiagonal linear systems
Xinrong Ma · Computer Engineering and Applications Journal · 2011
This paper focuses on a parallel iterative method for solving block-tridiagonal linear systems on distributed-memory multi-computers.Through choosing the base of subspace based on Galerkin theory,the communication only need twice between the adjacent processors per iteration step.Furthermore,the sufficient condition for convergence is given when the coefficient matrix A is a symmetric positive definite matrix.Finally,the numerical experiments implemented on HP rx2600 cluster indicate that the algorithm’s parallel acceleration rates and efficiency are higher than the multi-splitting method’s.