Algorithm For Solving Large Sparse Linear Equations

In this article, we mainly discuss two problems:(1)We discuss the iterative algorithm about sparse system of linear equations and give one kind of new iterative algorithm-The homogeneous reduction. It is proven that the algorithm is convergent. At the same time, has made the detail and the realization, the main idea of the algorithm experiment was carried out with the c language, it is shown that this algorithm is stable and has the advantage of sparse and the convergence.(2)We discuss the memory algorithm of large-scale sparse matrix: Three tuples table memory algorithm and cross chain table memory algorithm. Compared the advantage and disadvantage of several kind of compression memory algorithm and discuss their feasibility.