The relaxation methods have served as very efficient tools for solving linear system and have many important applications in the field of science and engineering.In this paper,we study an efficient relaxation method based on the well-known Gauss-Seidel iteration method.Theoretical analysis shows our method can converge to the unique solution of the linear system.In addition,our method is applied to solve the saddle point problem and PageRank problem,and the numerical results show our method is more powerful than the existent relaxation methods.