Recurrence relation

Recurrent redirects here; for the meaning of "recurrent" in contemporary hit radio, see Recurrent rotation.
In mathematics, a recurrence relation, also known as a difference equation, is an equation which defines a sequence recursively: each term of the sequence is defined as a function of the preceding terms.
For example (the logistic map):
 <math>x_{n+1} = r x_n (1  x_n) \,<math>
Some simply defined recurrence relations can have very complex (chaotic) behaviours and are sometimes studied by physicists and mathematicians in a field of mathematics known as nonlinear analysis.
Solving a recurrence relation means obtaining a nonrecursive function of n.
Contents 
Linear homogeneous recurrence relations with constant coefficients
The term linear means that each term of the sequence is defined as a linear function of the preceding terms. The coefficients and the constants may depend on n, even nonlinearly.
A special case is when the coefficients do not depend on n.
Homogeneous means that the constant term of the relation is zero.
In order to obtain a unique solution to the linear recurrence there must be some initial conditions, as the first number in the sequence can not depend on other numbers in the sequence and must be set to some value.
Solving linear recurrence relations
Solutions to recurrence relations are found by systematic means, often by using generating functions (formal power series) or by noticing the fact that r^{n} is a solution for particular values of r.
For secondorder recurrence relations in the form:
 <math>a_{n}=Aa_{n1}+Ba_{n2} \,<math>
we have the solution r^{n}:
 <math>r^{n}=Ar^{n1}+Br^{n2} \,<math>
Dividing through by <math>r^{n2}<math> we get:
 <math>r^2=Ar+B \,<math>
 <math>r^2ArB=0 \,<math>
This is known as the characteristic equation of the recurrence relation. Solve for r to obtain the two roots <math>\lambda_1, \lambda_2 <math>, and if these roots are distinct, we have the solution
 <math>a_n = C\lambda_1^n+D\lambda_2^n \,<math>
while if they are identical (when A^{2}+4B=0), we have
 <math>a_n = C\lambda^n+Dn\lambda^n \,<math>
where C and D are constants.
Additionally, if the equation is of the form <math>a_{n}=Aa_{n1}+B<math> you can substitute 2 for n and get <math>r^2=Ar+B<math> as above. The constants C and D can be found from the "side conditions" that are often given as <math>a_0=a<math>, <math>a_1=b<math>.
Different solutions are obtained depending on the nature of the roots of the characteristic equation.
If the recurrence is inhomogeneous, a particular solution can be found by the method of undetermined coefficients and the solution is the sum of the solution of the homogeneous and the particular solutions.
Interestingly, the method for solving linear differential equations is similar to the method above — the "intelligent guess" for linear differential equations is e^{x}.
This is not a coincidence. If you consider the Taylor series of the solution to a linear differential equation:
 <math>
\sum_{n=0}^{\infin} \frac{f^{(n)}(a)}{n!} (xa)^{n} <math>
you see that the coefficients of the series are given by the nth derivative of f(x) evaluated at the point a. The differential equation provides a linear difference equation relating these coefficients.
This equivalence can be used to quickly solve for the recurrence relationship for the coefficients in the power series solution of a linear differential equation.
Example: Fibonacci numbers
The Fibonacci numbers are defined using a linear recurrence relation:
 <math>F_{n} = F_{n1}+F_{n2} \,<math>
 <math>F_{0} = 0 \,<math>
 <math>F_{1} = 1 \,<math>
and has solution (letting <math>\Phi = {1+\sqrt{5} \over 2}<math> be the golden ratio)
 <math>F_n = {\Phi^n \over \sqrt{5}}  {(1\Phi)^n \over \sqrt{5}}<math>
The initial conditions are:
 <math>F_{0} = 0 \,<math>
 <math>F_{1} = 1 \,<math>
Therefore, the sequence of Fibonacci numbers is:
 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ...
Relationship to differential equations
When solving an ordinary differential equation numerically, one typically encounters a recurrence relation. For example, when solving the initial value problem
 <math>y'(t) = f(t,y(t)), \qquad y(t_0)=y_0, \qquad\qquad<math>
with Euler's method and a step size h, one calculates the values <math>y_0=y(t_0)<math>, <math>y_1=y(t_0+h),<math> <math>y_2=y(t_0+2h),...<math> by the recurrence
 <math> y_{n+1} = y_n + hf(t_n,y_n). <math>
Systems of linear first order differential equations can be discretized exactly analytically using the methods shown in the discretization article.
See also
External links
 Difference and Functional Equations: Exact Solutions (http://eqworld.ipmnet.ru/en/solutions/fe.htm) at EqWorld  The World of Mathematical Equations.
 Difference and Functional Equations: Methods (http://eqworld.ipmnet.ru/en/education/edufe.htm) at EqWorld  The World of Mathematical Equations.de:Differenzengleichung