recurrence relation

Computing Dictionary

recurrence relation definition

An equation that defines each element of a sequence in terms of one or more earlier elements. E.g. The Fibonacci sequence,
X[1] = 1 X[2] = 1 X[n] = X[n-1] + X[n-2]
Some recurrence relations can be converted to "closed form" where X[n] is defined purely in terms of n, without reference to earlier elements.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: recurrence formulae
Next Definition: recurrence risk
More from
Synonyms and Antonyms for recurrence relation
More from
Search for articles containing recurrence relation Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature