Parallel preconditioned conjugate gradient algorithm on GPU. Helfenstein, R. & Koko, J. Journal of Computational and Applied Mathematics, 236(15):3584–3590, 2012.
doi  abstract   bibtex   
We propose a parallel implementation of the Preconditioned Conjugate Gradient algorithm on a GPU platform. The preconditioning matrix is an approximate inverse derived from the SSOR preconditioner. Used through sparse matrix–vector multiplication, the proposed preconditioner is well suited for the massively parallel GPU architecture. As compared to CPU implementation of the conjugate gradient algorithm, our GPU preconditioned conjugate gradient implementation is up to 10 times faster (8 times faster at worst).
@Article{         Helfenstein_2012aa,
  abstract      = {We propose a parallel implementation of the Preconditioned Conjugate Gradient algorithm on a GPU platform. The preconditioning matrix is an approximate inverse derived from the SSOR preconditioner. Used through sparse matrix–vector multiplication, the proposed preconditioner is well suited for the massively parallel GPU architecture. As compared to CPU implementation of the conjugate gradient algorithm, our GPU preconditioned conjugate gradient implementation is up to 10 times faster (8 times faster at worst).},
  author        = {Helfenstein, Rudi and Koko, Jonas},
  doi           = {10.1016/j.cam.2011.04.025},
  file          = {Helfenstein_2012aa.pdf},
  issn          = {0377-0427},
  journal       = {Journal of Computational and Applied Mathematics},
  keywords      = {gpu,pcg,iccam},
  langid        = {english},
  number        = {15},
  pages         = {3584--3590},
  title         = {Parallel preconditioned conjugate gradient algorithm on {GPU}},
  volume        = {236},
  year          = {2012},
  shortjournal  = {J. Comput. Appl. Math.}
}

Downloads: 0