\title{Chains of Recurrences - a method to expedite the evaluation
  of closed-form functions}

\author{
Olaf Bachmann\\
Dept. of Math. and Computer  Science\\
Kent State University\\
Kent, Ohio  44242-0001 USA \\
\verb?obachman@mcs.kent.edu?\\
\and 
Paul S. Wang\thanks{On sabbatical leave from Kent State University} \\
Distributed Computing Department\\
Sandia National Laboratories\\
P.O.Box 969 Mail Stop 9214\\
Livermore, CA 94551-0969\\
\verb?pwang@mcs.kent.edu?
\and
Eugene V. Zima\\
Dept. of Computational Mathematics and Cybernetics (BMK)\\
Moscow State University\\
Moscow, 119899, Russia\\
\verb?zima@cs.msu.su?\\
}

\begin{abstract}
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.
\end{abstract}