Difference and functional equations Definition
Recurrence relation
Definition
Let be a set and let be a positive integer. A recurrence relation of order on is an equation for a sequence in , where is a given function.
A solution is a sequence that satisfies the equation for all .
Remarks
For each choice of initial values there is exactly one solution. This follows by induction on . Examples: the factorial satisfies of order . The Fibonacci sequence satisfies of order . An important special case is a linear recurrence with constant coefficients.
Where this leads
16 pages build on this one.
- Space of solutions of a linear recurrence
- Linear recurrence with constant coefficients
- Geometric solutions come from roots of the characteristic polynomial
- Characteristic polynomial of a linear recurrence
- Solution of a linear recurrence
- Equilibrium of a difference equation
- Linear recurrence with polynomial coefficients
- Linear difference equation
- Solution of recurrences by generating functions
- Initial value problem for a recurrence
- Order of a difference equation
- Dimension of the solution space of a linear recurrence
- Homogeneous and inhomogeneous linear recurrences
- Nonlinear difference equation
- Uniqueness of solutions given initial values
- Skolem–Mahler–Lech theorem
Further reading
About this page
| Tag | 07TZV87Y0T |
|---|---|
| URI | m2://07TZV87Y0T |
| Kind | definition |
| Writing | W1 stated |
| MSC | 39A05 |
| Defines | Recurrence relation |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.