<xml>
  <records>
    <record>
       <contributors>
          <authors>
             <author>Planche, T.</author>
             <author>Jung, P. M.</author>
          </authors>
       </contributors>
       <titles>
          <title>
             Symplectic and Self-Consistent Algorithms for Particle Accelerator Simulation
          </title>
       </titles>
		 <publisher>JACoW Publishing</publisher>
       <pub-location>Geneva, Switzerland</pub-location>
		 <isbn>978-3-95450-200-4</isbn>
		 <electronic-resource-num>10.18429/JACoW-ICAP2018-SUPAF04</electronic-resource-num>
		 <language>English</language>
		 <pages>42-45</pages>
       <pages>SUPAF04</pages>
       <keywords>
          <keyword>plasma</keyword>
          <keyword>simulation</keyword>
          <keyword>space-charge</keyword>
          <keyword>betatron</keyword>
          <keyword>resonance</keyword>
       </keywords>
       <work-type>Contribution to a conference proceedings</work-type>
       <dates>
          <year>2019</year>
          <pub-dates>
             <date>2019-01</date>
          </pub-dates>
       </dates>
       <urls>
          <related-urls>
              <url>https://doi.org/10.18429/JACoW-ICAP2018-SUPAF04</url>
              <url>http://jacow.org/icap2018/papers/supaf04.pdf</url>
          </related-urls>
       </urls>
       <abstract>
          This paper is a review of algorithms, applicable to particle accelerator simulation, which share the following two characteristics: (1) they preserve to machine precision the symplectic geometry of the particle dynamics, and (2) they track the evolution of the self-field consistently with the evolution of the charge distribution. This review includes, but is not limited to, algorithms using a Particle-in-Cell discretization scheme. At the end of this review we discuss to possibility to derived algorithms from an electrostatic Hamiltonian.
       </abstract>
    </record>
  </records>
</xml>
