Scalable high-order algorithms for wakefield simulations

Misun Min, Paul F. Fischer

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We developed a high-order algorithm in time for our spectral-element discontinuous Galerkin time-domain electromagnetic code NekCEM. High-order spatial approximations are known to be the most efficient scheme guaranteeing a certain level of accuracy after long simulation time due to less numerical dispersion. We investigate an explicit type time stepping method, exponential timeintegration method, based on Krylov approximation which can possibly accel efficiency by allowing larger time step size with the total number of timestep reduction for accelerator applications. Computational results are compared to those by the fourth-order Runge-Kutta method that has been widely used for high-order spatial operator for the Maxwell's equations. We demonstrate the parallel performance of the high-order time-integration scheme up to 8,192 processors achieving efficiency of 72%.

Original languageEnglish (US)
Title of host publicationIPAC 2010 - 1st International Particle Accelerator Conference
Number of pages3
StatePublished - 2010
Externally publishedYes
Event1st International Particle Accelerator Conference, IPAC 2010 - Kyoto, Japan
Duration: May 23 2010May 28 2010

Publication series

NameIPAC 2010 - 1st International Particle Accelerator Conference


Other1st International Particle Accelerator Conference, IPAC 2010

ASJC Scopus subject areas

  • Nuclear and High Energy Physics


Dive into the research topics of 'Scalable high-order algorithms for wakefield simulations'. Together they form a unique fingerprint.

Cite this