Difference and functional equations Difference equations: basic notions Concept
Recurrence relation
Summary
A recurrence relation defines each term of a sequence from earlier terms. Recurrences are a main tool to describe counting sequences, and solving one means finding a closed formula for its terms. The node recurrence relation gives the precise definition.
Where this leads
8 pages build on this one.
Further reading
About this page
| Tag | 0FYX44GP92 |
|---|---|
| URI | m2://0FYX44GP92 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 39A05 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (1 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Definitions
Instances
Special cases
- Linear recurrence with constant coefficients
- Nonlinear difference equation
- Homogeneous and inhomogeneous linear recurrences
- Matrix difference equation
- Linear difference equation
- Linear recurrence with polynomial coefficients
Used by
- Dynamic equation on time scales
- Favard's theorem
- Clenshaw algorithm
- Enumerative combinatorics
- Zeilberger's algorithm
- Akra–Bazzi theorem
- Gosper's algorithm
- Three-term recurrence for orthogonal polynomials