Parallel Algorithm's Optimization of Sparse Linear Equations

In this paper,the optimal storage method of coefficient matrix of sparse linear equations under the circumstance of single computer is introduced,with an emphasis on the achievement of distributed optimal storage method under the parallel circumstance and the achievement of Multi-splitting parallel algorithm of sparse linear equations.Optimal algorithm and notoptimal algorithm are adopted in HP RX2600 cluster to carry out numerical experiments based on MPI(Message Passing Interface) C program language parallel program.It is indicated through the results that optimal algorithm not only saves storage,but also reduces computational time.At the same time,the algorithm has certain applied value because it extends the scale of processing problem because of the decrease of storage.