Author: Hegglin, S.
Paper Title Page
WEPOY044 Review of CPU and GPU Faddeeva Implementations 3090
  • A. Oeftiger, R. De Maria, L. Deniau, K.S.B. Li, E. McIntosh, L. Moneta
    CERN, Geneva, Switzerland
  • A. Aviral
    BITS Pilani, Pilani, India
  • S. Hegglin
    ETH, Zurich, Switzerland
  • A. Oeftiger
    EPFL, Lausanne, Switzerland
  Funding: CERN, Doctoral Studentship EPFL, Doctorate
The Faddeeva error function is frequently used when computing electric fields generated by two-dimensional Gaussian charge distributions. Numeric evaluation of the Faddeeva function is particularly challenging since there is no single expansion that converges rapidly over the whole complex domain. Various algorithms exist, even in the recent literature there have been new proposals. The many different implementations in computer codes offer different trade-offs between speed and accuracy. We present an extensive benchmark of selected algorithms and implementations for accuracy, speed and memory footprint, both for CPU and GPU architectures.
DOI • reference for this paper ※ DOI:10.18429/JACoW-IPAC2016-WEPOY044  
Export • reference for this paper using ※ BibTeX, ※ LaTeX, ※ Text/Word, ※ RIS, ※ EndNote (xml)