Advertisement

Abstract

Recurrence relations are traditionally divided into two classes: A recurrence with “finite history” depends on a fixed number of earlier values,
$$ x_n = f(x_{n - 1} ,x_{n - 2} ,...,x_{n - m} ), n \geqslant m. $$
(2.1)
An equation that depends on all preceding values has a “full history.”

Keywords

Recurrence Relation Continue Fraction Linear Recurrence Binomial Theorem Full History 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 2008

Personalised recommendations