Improvements of a fast parallel poisson solver on irregular domains

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

Abstract

We discuss the scalable parallel solution of the Poisson equation on irregularly shaped domains discretized by finite differences. The symmetric positive definite system is solved by the preconditioned conjugate gradient algorithm with smoothed aggregation (SA) based algebraic multigrid (AMG) preconditioning. We investigate variants of the implementation of SA-AMG that lead to considerable improvements in the execution times. The improvements are due to a better data partitioning and the iterative solution of the coarsest level system in AMG. We demonstrate good scalability of the solver on a distributed memory parallel computer with up to 2048 processors. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Adelmann, A., Arbenz, P., & Ineichen, Y. (2012). Improvements of a fast parallel poisson solver on irregular domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7133 LNCS, pp. 65–74). https://doi.org/10.1007/978-3-642-28151-8_7

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