The most popular methods to solve large sparse problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require using the matrix by vector multiplications. We give the implementations of PCG、GMRES、Lanczos's method and Davidson's method on YH-1.We then compare their advantages and disadvantages. Finally we discuss the parallel implementations as possible as we can.