Fast poisson solvers for graphics processing units

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double precision floating-point arithmetic. The numerical results indicate up to 6-fold speed increase in the case of the two-dimensional problems and up to 3-fold speed increase in the case of the three-dimensional problems when compared to equivalent CPU implementations run on a Intel Core i7 quad-core CPU. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Myllykoski, M., Rossi, T., & Toivanen, J. (2013). Fast poisson solvers for graphics processing units. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7782 LNCS, pp. 265–279). https://doi.org/10.1007/978-3-642-36803-5_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free