Chains of Recurrences (CR's) are introduced as an effective method to evaluate functions at regular intervals. Algebraic properties of CR's are examined and an algorithm that constructs a CR for a given function is explained. Finally, an implementation of the method in MAXIMA/Common Lisp is discussed.

Скачать книгу бесплатно (djvu, 194 Kb)

---

Читать «Chains of recurrences for evaluation of functions at regular grids»