  Various approaches to the numerical representation of the Incomplete Gamma
Function F_m(z) for complex arguments z and small integer indexes m are
compared with respect to numerical fitness (accuracy and speed). We consider
power series, Laurent series, Gautschi's approximation to the Faddeeva
function, classical numerical methods of treating the standard integral
representation, and others not yet covered by the literature. The most suitable
scheme is the construction of Taylor expansions around nodes of a regular,
fixed grid in the z-plane, which stores a static matrix of higher derivatives.
This is the obvious extension to a procedure often in use for real-valued z.
