Parallel Algorithm for Solving Banded Linear Systems
Sanyang Liu · 2010
The work presented in this paper focused on alternating-direction parallel iterative method for solving banded-linear systems on distributed-memory multi-computers.Firstly,the matrix was splitted by using the feature of the coefficient matrix,thus the communication only need twice between the adjacent processors per iteration step.Furthermore,the sufficient conditions for convergence were given when the coefficient matrix A is a Hermite positive definite matrix or M-matrix respectively.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.