Difference between revisions of "Recurrence relation"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In mathematics, a '''recurrence relation''' is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: e...") |
(No difference)
|
Latest revision as of 12:33, 4 April 2017
In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: each further term of the sequence or array is defined as a function of the preceding terms.
The term difference equation sometimes (and for the purposes of this article) refers to a specific type of recurrence relation. However, "difference equation" is frequently used to refer to any recurrence relation.
See also
- Circle points segments proof
- Combinatorial principles
- Continued fraction
- Holonomic sequences
- Integrodifference equation
- Iterated function
- Lagged Fibonacci generator
- Master theorem
- Orthogonal polynomials
- Recursion
- Recursion (computer science)
- Time scale calculus
External links
- Recurrence relation @ Wikipedia
