When uncertainty is given in parametric form, the QFT templates computation requires time if the number of parameters is high. The latest methods do not solve the problem efficiently. The present note shows a new way to calculate templates by means of analytic functions. The discrete template is replaced by an analytic template, so operations are done with functions, not with points. In such a way, the computation time is reduced and the results can be used to solve other problems such as bounds computation.