This remark describes efficiency improvements to Algorithm 916 [Zaghloul and Ali 2011]. It is shown that the execution time required by the algorithm, when run at its highest accuracy, may be improved by more than a factor of 2. A better accuracy vs efficiency tradeoff scheme is also implemented; this requires the user to supply the number of significant figures desired in the computed values as an extra input argument to the function. Using this tradeoff, it is shown that the efficiency of the algorithm may be further improved significantly while maintaining reasonably accurate and safe results that are free of the pitfalls and complete loss of accuracy seen in other competitive techniques. The current version of the code is provided in Matlab and Scilab in addition to a Fortran translation prepared to meet the needs of real-world problems where very large numbers of function evaluations would require the use of a compiled language. To fulfill this last requirement, a recently proposed reformed version of Humlíček's w4 routine, shown to maintain the claimed accuracy of the algorithm over a wide and fine grid, is implemented in the present Fortran translation for the case of four significant figures. This latter modification assures the reliability of the code in the solution of practical problems requiring numerous evaluation of the function for applications requiring low-accuracy computations (<10-4).
|Journal||ACM Transactions on Mathematical Software|
|Publication status||Published - May 1 2016|
- Faddeyeva function
- Function evaluation
ASJC Scopus subject areas
- Applied Mathematics