## Abstract

We present a new simple algorithm for efficient, and relatively accurate computation of the Faddeyeva function w(z). The algorithm carefully exploits previous approximations by Hui et al. (1978) and Humlíček (1982) along with asymptotic expressions from Laplace continued fractions. Over a wide and fine grid of the complex argument, z = x + iy, numerical results from the present approximation show a maximum relative error less than 4.0 × 10^{-5} for both real and imaginary parts of w while running in a relatively shorter execution time than other competitive techniques. In addition to the calculation of the Faddeyeva function, w, partial derivatives of the real and imaginary parts of the function can easily be calculated and returned as optional output.

Original language | English |
---|---|

Article number | 22 |

Journal | ACM Transactions on Mathematical Software |

Volume | 44 |

Issue number | 2 |

DOIs | |

Publication status | Published - Aug 2017 |

## Keywords

- Accuracy
- Complex probability function
- Fortran
- Function evaluation
- Matlab

## ASJC Scopus subject areas

- Software
- Applied Mathematics