著者

安藤 英俊 藤木 史朗 鳥山 孝司

出版者

一般社団法人日本応用数理学会

雑誌

応用数理 (ISSN:09172270)

巻号頁・発行日

vol.20, no.2, pp.107-116, 2010-06-25

---

Many Preconditioning algorithms for Krylov subspace methods are developed and well tested on parallel computing environment like PC clusters, but performance of those methods on GPU differs from those on clusters. Although incomplete LU decomposition is the most popular preconditioner for Krylov subspace methods on CPU, its implementation on GPU was never successful because of the sequential nature of the algorithm. By using C for CUDA environment, we have efficiently implemented ILU(0) on GPU. We have also implemented and evaluated various kinds of preconditioning methods for Krylov subspace solvers on GPU, including Jacobi, Red-Black Gauss-Seidel, Line-by-Line and ILU(0). ILU(0) preconditioner turned out to be most efficient and fastest among these preconditioners when solving Poisson equation.