Relaxation methods for systems of linear equations and applications
Received:September 30, 2019  Revised:September 30, 2019
Key Word: iterative methods   relaxation methods   linear systems   saddle point problem   PageRank problem  
Fund ProjectL:The National Natural Science Foundation of China (General Program, Key Program, Major Research Plan)
Author NameAffiliationE-mail
Xinzhu Zhao School of Mathematical Sciences, Dalian University of Technology mathzhaoxinzhu@mail.dlut.edu.cn 
Bo Dong School of Mathematical Sciences, Dalian University of Technology dongbo@dlut.edu.cn 
Bo Yu School of Mathematical Sciences, Dalian University of Technology yubo@dlut.edu.cn 
Hits: 8
Download times: 
Abstract:
      The relaxation methods have been 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.
Citation:
DOI:
  View/Add Comment  Download reader