In natural science and Engineering technology, the resolutions of many problems are reduced to solving linear algebraic With the development of science and technology, the complexity of a problem to be solved is Therefore, highly efficient solution of large scale sparse matrices is of universal meaning in scientific General numerical solutions of linear equations are direct methods and iterative This article mainly analyzes such direct methods as Gaussian Elimination and LU-Factorization, then proproses a square-rooting method to find the symmetrical positive definite The iterative methods, Jacobi method iterative method, Gauss-Seidel Method, and Successive Over Relaxation (SOR) method, are also We finally discuss the Conjugate Gradient method based on the analysis of SOR We also provide detailed derivation of these methods using mathematical Matlab programs are developed and tested for solving linear Keywords: linear equations, direct methods, square-rooting, iterative methods, conjugate gradient