A fast parallel Poisson solver on irregular domains applied to beam dynamics simulations

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 resultin...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational physics Vol. 229; no. 12; pp. 4554 - 4566
Main Authors: Adelmann, A., Arbenz, P., Ineichen, Y.
Format: Journal Article
Language:English
Published: Kidlington Elsevier Inc 20.06.2010
Elsevier
Subjects:
AGGLOMERATION
Algebraic multigrid
ALGORITHMS
BEAM DYNAMICS
CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS
COMPARATIVE EVALUATIONS
Computational techniques
Computer simulation
DIRICHLET PROBLEM
Distributed memory
Dynamics
ELECTRON BEAMS
Exact sciences and technology
Irregular domains
ITERATIVE METHODS
Mathematical analysis
Mathematical methods in physics
MATHEMATICAL SOLUTIONS
Microprocessors
Physics
POISSON EQUATION
Preconditioned conjugate gradient algorithm
SIMULATION
Solvers
SPACE CHARGE
Poisson equation
Irregular domains
Beam dynamics
Preconditioned conjugate gradient algorithm
Space-charge
Algebraic multigrid
Particle beams
Preconditioned conjugate gradient
Space charge
Calculation methods
Particle accelerators
Algorithms
Electron beams
Dynamics
Multigrid
Calculation
Preconditioning
algorithm
ISSN:0021-9991, 1090-2716
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0021-9991
1090-2716
DOI:10.1016/j.jcp.2010.02.022