GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Computer simulation using particles
Computer simulation using particles
SIAM Journal on Scientific and Statistical Computing
Iterative methods for solving linear systems
Iterative methods for solving linear systems
Parallel smoothed aggregation multigrid: aggregation strategies on massively parallel machines
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Multigrid
Parallel multigrid smoothing: polynomial versus Gauss--Seidel
Journal of Computational Physics
A node-centered local refinement algorithm for Poisson's equation in complex geometries
Journal of Computational Physics
An overview of the Trilinos project
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Finite Difference Methods for Ordinary and Partial Differential Equations: Steady-State and Time-Dependent Problems (Classics in Applied Mathematics Classics in Applied Mathemat)
Improvements of a fast parallel poisson solver on irregular domains
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume Part I
Computer Science - Research and Development
Hi-index | 31.45 |
We discuss the scalable parallel solution of the Poisson equation within a Particle-In-Cell (PIC) code for the simulation of electron beams in particle accelerators of irregular shape. The problem is discretized by Finite Differences. Depending on the treatment of the Dirichlet boundary the resulting system of equations is symmetric or 'mildly' nonsymmetric positive definite. In all cases, the 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. We demonstrate good scalability of the solver on distributed memory parallel processor with up to 2048 processors. We also compare our iterative solver with an FFT-based solver that is more commonly used for applications in beam dynamics.