A Self Consistent Multiprocessor Space Charge Algorithm that is Almost Embarrassingly Parallel
We present a space charge code that is self consistent, massively parallelizeable, and requires very little communication between computer nodes; making the calculation almost embarrassingly parallel. This method is implemented in the code COSY Infinity where the differential algebras used in this code are important to the algorithm's proper functioning. The method works by calculating the self consistent space charge distribution using the statistical moments of the test particles, and converting them into polynomial series coefficients. These coefficients are combined with differential algebraic integrals to form the potential, and electric fields. The result is a map which contains the effects of space charge. This method allows for massive parallelization since its statistics based solver doesn't require any binning of particles, and only requires a vector containing the partial sums of the statistical moments for the different nodes to be passed. All other calculations are done independently. The resulting maps can be used to analyze the system using normal form analysis, as well as advance particles in numbers and at speeds that were previously impossible.
- Research Organization:
- Thomas Jefferson National Accelerator Facility (TJNAF), Newport News, VA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- AC05-06OR23177
- OSTI ID:
- 1048114
- Report Number(s):
- JLAB-ACP-12-1541; DOE/OR/23177-2125; TRN: US1204091
- Resource Relation:
- Conference: IPAC 2012, 20-25 May 2012, New Orleans, Louisiana
- Country of Publication:
- United States
- Language:
- English
Similar Records
Space Charge Simulation in COSY using The Fast Multipole Method
SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation