Journal of Jilin University Science Edition

Previous Articles     Next Articles

Iterative Algorithm for Complex Linear Equations ofSymmetric Positive Definite Sparse Matrices Based on GPU

LI Weiwei   

  1. School of Information Engineering, Shandong Youth University of Political Science, Jinan 250103, China;Key Laboratory of Information Security and Intelligent Control in Universities of Shandong, Jinan 250103, China
  • Received:2015-04-10 Online:2016-03-26 Published:2016-03-23
  • Contact: LI Weiwei E-mail:lww@sdyu.edu.cn

Abstract:

The author proposed an iterative algorithm for complex linear equations of   symmetric positive definite sparse matrices based on GPU. First, the author used the conjugate gradient method and double conjugate gradient algorithm based on GPU to achieve  the operation of matrix vector multiplication, and  optimized the corresponding algorithm steps fully. Second, in order to realize the 3 pretreatment methods, which were  diagonal element preprocessing step based on GPU, incomplete Cholesky decomposition and symmetric super relaxation, the author proposed  a parallel algorithm for solving triangular systems based on GPU. Finally, the advantage and disadvantage of various pretreatment methods were analyzed through experiments. The experimental results show that the speed of the algorithm is higher than the  CPU serial iterative algorithm and the classical direct method, and the maximum speed is up to 76 times faster than that of two methods.

Key words: complex linear equation, iterative method, GPU computing

CLC Number: 

  • TP391