Recurrence Relation
A mathematical relationship expressing 
as some combination of 
with 
. The solutions to linear recurrence canbe computed straightforwardly, but Quadratic Recurrences are not so well understood. Thesequence generated by a recurrence relation is called a Recurrence Sequence. Perhaps the most famous example of arecurrence relation is the one defining the Fibonacci Numbers,
for
and with 
.See also Argument Addition Relation, Argument Multiplication Relation, Clenshaw Recurrence Formula,Quadratic Recurrence, Recurrence Sequence, Reflection Relation, Translation Relation
References
Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. ``Recurrence Relations and Clenshaw's Recurrence Formula.'' §5.5 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 172-178, 1992.
- Onduloid
- One
- One-Form
- One-Mouth Theorem
- One-Ninth Constant
- One-to-One
- One-Way Function
- Only Critical Point in Town Test
- Onto
- Open Disk
- Open Interval
- Open Map
- Open Mapping Theorem
- Open Set
- Operad
- Operand
- Operational Mathematics
- Operations Research
- Operator
- Optimization Theory
- Or
- Orbifold
- Orbison's Illusion
- Orbit (Group)
- Orbit (Map)