[{"type":"article-journal","title":"Efficient approximation of the incomplete gamma function for use in cloud model applications","issued":{"date-parts":[["2010"]]},"volume":"3","issue":"2","page":"329 - 336","container-title":"Geoscientific model development","DOI":"10.5194\/gmd-3-329-2010","author":[{"family":"Blahak","given":"U."}],"ISSN":"1991-959X, 1991-9603","abstract":"This paper describes an approximation to the lower incomplete gamma function \u03b3l(a,x) which has been obtained by nonlinear curve fitting. It comprises a fixed number of terms and yields moderate accuracy (the absolute approximation error of the corresponding normalized incomplete gamma function P is smaller than 0.02 in the range 0.9 \u2264 \u03b1 \u2264 45 and \u03c7 \u2265 0). Monotonicity and asymptotic behaviour of the original incomplete gamma function is preserved. While providing a slight to moderate performance gain on scalar machines (depending on whether a stays the same for subsequent function evaluations or not) compared to established and more accurate methods based on series- or continued fraction expansions with a variable number of terms, a big advantage over these more accurate methods is the applicability on vector CPUs. Here the fixed number of terms enables proper and efficient vectorization. The fixed number of terms might be also beneficial on massively parallel machines to avoid load imbalances, caused by a possibly vastly different number of terms in series expansions to reach convergence at different grid points. For many cloud microphysical applications, the provided moderate accuracy should be enough. However, on scalar machines and if a is the same for subsequent function evaluations, the most efficient method to evaluate incomplete gamma functions is perhaps interpolation of pre-computed regular lookup tables (most simple example: equidistant tables).","kit-publication-id":"1000020643"}]