The problem of expediting the evaluation of closed-form functions at regular intervals is considered. The Chain of Recurrences technique to expedite computations is extended by rational simplifications and examined as a form of internal representation, oriented towards fast evaluation. Optimizing transformations of Chains of Recurrences are proposed.