吉林大学学报(理学版)

• 计算机科学 • 上一篇    下一篇

基于GPU的对称正定稀疏矩阵复线性方程组迭代算法

李伟伟   

  1. 山东青年政治学院 信息工程学院, 济南 250103; 山东省高校信息安全与智能控制重点实验室, 济南 250103
  • 收稿日期:2015-04-10 出版日期:2016-03-26 发布日期:2016-03-23
  • 通讯作者: 李伟伟 E-mail:lww@sdyu.edu.cn

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

摘要:

提出一种基于图形处理器(GPU)的对称正定稀疏矩阵复线性方程组迭代算法. 首先, 采用基于GPU的共轭梯度法和双共轭梯度法, 实现GPU上的矩阵向量乘操作, 并充分优化相应的算法步骤; 其次, 实现基于GPU的对角元预处理、 不完全Cholesky分解和对称超松弛3种预处理方法, 提出一种基于GPU的求解三角方程组并行算法; 最后, 实验分析各种预处理方法的优劣. 实验结果表明, 该算法较CPU串行迭代算法与经典的直接法速度提升较大, 最高可达到76倍的加速比.

关键词: 复线性方程组, 迭代法, GPU计算

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

中图分类号: 

  • TP391