HOME
        TheInfoList



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.

Definition

A ''recurrence relation'' is an equation that expresses each element of a sequence as a function of the preceding ones. More precisely, in the case where only the immediately preceding element is involved, a recurrence relation has the form :u_n=\varphi(n, u_)\quad\text\quad n>0, where :\varphi:\mathbb N\times X \to X is a function, where is a set to which the elements of a sequence must belong. For any u_0\in X, this defines a unique sequence with u_0 as its first element, called the ''initial value''. It is easy to modify the definition for getting sequences starting from the term of index 1 or higher. This defines recurrence relation of ''first order''. A recurrence relation of ''order'' has the form :u_n=\varphi(n, u_, u_, \ldots, u_)\quad\text\quad n\ge k, where \varphi: \mathbb N\times X^k \to X is a function that involves consecutive elements of the sequence. In this case, initial values are needed for defining a sequence.

Examples



Factorial

The factorial is defined by the recurrence relation :n!=n(n-1)!\quad\text\quad n>0, and the initial condition :0!=1.

Logistic map

An example of a recurrence relation is the logistic map: :x_ = r x_n (1 - x_n), with a given constant ''r''; given the initial term ''x''0 each subsequent term is determined by this relation. Solving a recurrence relation means obtaining a closed-form solution: a non-recursive function of ''n''.

Fibonacci numbers

The recurrence of order two satisfied by the Fibonacci numbers is the archetype of a homogeneous linear recurrence relation with constant coefficients (see below). The Fibonacci sequence is defined using the recurrence :F_n = F_+F_ with initial conditions (seed values) :F_0 = 0 :F_1 = 1. Explicitly, the recurrence yields the equations :F_2 = F_1 + F_0 :F_3 = F_2 + F_1 :F_4 = F_3 + F_2 etc. We obtain the sequence of Fibonacci numbers, which begins :0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... The recurrence can be solved by methods described below yielding Binet's formula, which involves powers of the two roots of the characteristic polynomial ''t''2 = ''t'' + 1; the generating function of the sequence is the rational function : \frac.

Binomial coefficients

A simple example of a multidimensional recurrence relation is given by the binomial coefficients \tbinom, which count the number of ways of selecting ''k'' elements out of a set of ''n'' elements. They can be computed by the recurrence relation :\binom=\binom+\binom, with the base cases \tbinom=\tbinom=1. Using this formula to compute the values of all binomial coefficients generates an infinite array called Pascal's triangle. The same values can also be computed directly by a different formula that is not a recurrence, but that requires multiplication and not just addition to compute: \binom=\frac.


Relationship to difference equations narrowly defined


Given an ordered sequence \left\_^\infty of real numbers: the first difference \Delta(a_n) is defined as :\Delta(a_n) = a_ - a_n. The second difference \Delta^2(a_n) is defined as :\Delta^2(a_n) = \Delta(a_) - \Delta(a_n), which can be simplified to :\Delta^2(a_n) = a_ - 2a_ + a_n. More generally: the ''k''-th difference of the sequence ''an'' written as \Delta^k(a_n) is defined recursively as :\Delta^k(a_n) = \Delta^(a_) - \Delta^(a_n)=\sum_^k \binom (-1)^t a_. (The sequence and its differences are related by a binomial transform.) The more restrictive definition of difference equation is an equation composed of ''an'' and its ''k''th differences. (A widely used broader definition treats "difference equation" as synonymous with "recurrence relation". See for example rational difference equation and matrix difference equation.) Actually, it is easily seen that, :a_ = a_n + \Delta(a_n) + \cdots + \Delta^k(a_n). Thus, a difference equation can be defined as an equation that involves ''a''''n'', ''a''''n''−1, ''a''''n''−2 etc. (or equivalently ''a''''n'', ''a''''n''+1, ''a''''n''+2 etc.) Since difference equations are a very common form of recurrence, some authors use the two terms interchangeably. For example, the difference equation :3\Delta^2(a_n) + 2\Delta(a_n) + 7a_n = 0 is equivalent to the recurrence relation :3a_ = 4a_ - 8a_n. Thus one can solve many recurrence relations by rephrasing them as difference equations, and then solving the difference equation, analogously to how one solves ordinary differential equations. However, the Ackermann numbers are an example of a recurrence relation that do not map to a difference equation, much less points on the solution to a differential equation. See time scale calculus for a unification of the theory of difference equations with that of differential equations. Summation equations relate to difference equations as integral equations relate to differential equations.

From sequences to grids

Single-variable or one-dimensional recurrence relations are about sequences (i.e. functions defined on one-dimensional grids). Multi-variable or n-dimensional recurrence relations are about n-dimensional grids. Functions defined on n-grids can also be studied with partial difference equations.


Solving





Solving homogeneous linear recurrence relations with constant coefficients




Roots of the characteristic polynomial

An order-''d'' homogeneous linear recurrence with constant coefficients is an equation of the form :a_n = c_1a_ + c_2a_+\cdots+c_da_, where the ''d'' coefficients ''ci'' (for all ''i'') are constants, and c_d\ne0. A constant-recursive sequence is a sequence satisfying a recurrence of this form. There are ''d'' degrees of freedom for solutions to this recurrence, i.e., the initial values a_0,\dots,a_ can be taken to be any values but then the recurrence determines the sequence uniquely. The same coefficients yield the characteristic polynomial (also "auxiliary polynomial") :p(t)= t^d - c_1t^ - c_2t^-\cdots-c_ whose ''d'' roots play a crucial role in finding and understanding the sequences satisfying the recurrence. If the roots ''r''1, ''r''2, ... are all distinct, then each solution to the recurrence takes the form :a_n = k_1 r_1^n + k_2 r_2^n + \cdots + k_d r_d^n, where the coefficients ''ki'' are determined in order to fit the initial conditions of the recurrence. When the same roots occur multiple times, the terms in this formula corresponding to the second and later occurrences of the same root are multiplied by increasing powers of ''n''. For instance, if the characteristic polynomial can be factored as (''x''−''r'')3, with the same root ''r'' occurring three times, then the solution would take the form :a_n = k_1 r^n + k_2 n r^n + k_3 n^2 r^n. As well as the Fibonacci numbers, other constant-recursive sequences include the Lucas numbers and Lucas sequences, the Jacobsthal numbers, the Pell numbers and more generally the solutions to Pell's equation. For order 1, the recurrence :a_=r a_ has the solution ''an'' = ''rn'' with ''a''0 = 1 and the most general solution is ''an'' = ''krn'' with ''a''0 = ''k''. The characteristic polynomial equated to zero (the characteristic equation) is simply ''t'' − ''r'' = 0. Solutions to such recurrence relations of higher order are found by systematic means, often using the fact that ''an'' = ''rn'' is a solution for the recurrence exactly when ''t'' = ''r'' is a root of the characteristic polynomial. This can be approached directly or using generating functions (formal power series) or matrices. Consider, for example, a recurrence relation of the form :a_=Aa_+Ba_. When does it have a solution of the same general form as ''an'' = ''rn''? Substituting this guess (ansatz) in the recurrence relation, we find that :r^=Ar^+Br^ must be true for all ''n'' > 1. Dividing through by ''r''''n''−2, we get that all these equations reduce to the same thing: :r^2=Ar+B, :r^2-Ar-B=0, which is the characteristic equation of the recurrence relation. Solve for ''r'' to obtain the two roots ''λ''1, ''λ''2: these roots are known as the characteristic roots or eigenvalues of the characteristic equation. Different solutions are obtained depending on the nature of the roots: If these roots are distinct, we have the general solution :a_n = C\lambda_1^n+D\lambda_2^n while if they are identical (when ), we have :a_n = C\lambda^n+Dn\lambda^n This is the most general solution; the two constants ''C'' and ''D'' can be chosen based on two given initial conditions ''a''0 and ''a''1 to produce a specific solution. In the case of complex eigenvalues (which also gives rise to complex values for the solution parameters ''C'' and ''D''), the use of complex numbers can be eliminated by rewriting the solution in trigonometric form. In this case we can write the eigenvalues as \lambda_1, \lambda_2 = \alpha \pm \beta i. Then it can be shown that :a_n = C\lambda_1^n+D\lambda_2^n can be rewritten as :a_n = 2 M^n \left( E \cos(\theta n) + F \sin(\theta n)\right) = 2 G M^n \cos(\theta n - \delta), where :\begin M = \sqrt & \cos (\theta) =\tfrac & \sin( \theta) = \tfrac \\ C,D = E \mp F i & & \\ G = \sqrt & \cos (\delta ) = \tfrac & \sin (\delta )= \tfrac \end Here ''E'' and ''F'' (or equivalently, ''G'' and δ) are real constants which depend on the initial conditions. Using :\lambda_1+\lambda_2=2 \alpha = A, :\lambda_1 \cdot \lambda_2=\alpha^2+\beta^2=-B, one may simplify the solution given above as :a_n = (-B)^ \left( E \cos(\theta n) + F \sin(\theta n)\right), where ''a''1 and ''a''2 are the initial conditions and :\begin E &=\frac \\ F &=-i \frac \\ \theta &=\arccos \left (\frac \right ) \end In this way there is no need to solve for λ1 and λ2. In all cases—real distinct eigenvalues, real duplicated eigenvalues, and complex conjugate eigenvalues—the equation is stable (that is, the variable ''a'' converges to a fixed value pecifically, zero if and only if ''both'' eigenvalues are smaller than one in absolute value. In this second-order case, this condition on the eigenvalues can be shown to be equivalent to |''A''| < 1 − ''B'' < 2, which is equivalent to |''B''| < 1 and |''A''| < 1 − ''B''. The equation in the above example was homogeneous, in that there was no constant term. If one starts with the non-homogeneous recurrence :b_=Ab_+Bb_+K with constant term ''K'', this can be converted into homogeneous form as follows: The steady state is found by setting ''bn'' = ''b''''n''−1 = ''b''''n''−2 = ''b''* to obtain : b^ = \frac. Then the non-homogeneous recurrence can be rewritten in homogeneous form as :_n - b^*A_-b^*B_-b^* which can be solved as above. The stability condition stated above in terms of eigenvalues for the second-order case remains valid for the general ''n''th-order case: the equation is stable if and only if all eigenvalues of the characteristic equation are less than one in absolute value. Given a homogeneous linear recurrence relation with constant coefficients of order ''d'', let ''p''(''t'') be the characteristic polynomial (also "auxiliary polynomial") :t^d - c_1t^ - c_2t^ - \cdots - c_ = 0 such that each ''ci'' corresponds to each ''ci'' in the original recurrence relation (see the general form above). Suppose λ is a root of ''p''(''t'') having multiplicity ''r''. This is to say that (''t''−λ)''r'' divides ''p''(''t''). The following two properties hold: # Each of the ''r'' sequences \lambda^n, n\lambda^n, n^2\lambda^n,\dots,n^\lambda^n satisfies the recurrence relation. # Any sequence satisfying the recurrence relation can be written uniquely as a linear combination of solutions constructed in part 1 as ''λ'' varies over all distinct roots of ''p''(''t''). As a result of this theorem a homogeneous linear recurrence relation with constant coefficients can be solved in the following manner: # Find the characteristic polynomial ''p''(''t''). # Find the roots of ''p''(''t'') counting multiplicity. # Write ''an'' as a linear combination of all the roots (counting multiplicity as shown in the theorem above) with unknown coefficients ''bi''. #::a_n = \left (b_1\lambda_1^n + b_2n\lambda_1^n + b_3n^2\lambda_1^n+\cdots+b_r n^\lambda_1^n \right )+\cdots+ \left (b_\lambda_^n + \cdots + b_n^\lambda_^n \right ) #:This is the general solution to the original recurrence relation. (''q'' is the multiplicity of λ*) # Equate each a_0, a_1, \dots,a_d from part 3 (plugging in ''n'' = 0, ..., ''d'' into the general solution of the recurrence relation) with the known values a_0, a_1, \dots,a_d from the original recurrence relation. However, the values ''an'' from the original recurrence relation used do not usually have to be contiguous: excluding exceptional cases, just ''d'' of them are needed (i.e., for an original homogeneous linear recurrence relation of order 3 one could use the values ''a''0, ''a''1, ''a''4). This process will produce a linear system of ''d'' equations with ''d'' unknowns. Solving these equations for the unknown coefficients b_1, b_2, \dots,b_d of the general solution and plugging these values back into the general solution will produce the particular solution to the original recurrence relation that fits the original recurrence relation's initial conditions (as well as all subsequent values a_0,a_1,a_2,\dots of the original recurrence relation). The method for solving linear differential equations is similar to the method above—the "intelligent guess" (ansatz) for linear differential equations with constant coefficients is ''e''λ''x'' where λ is a complex number that is determined by substituting the guess into the differential equation. This is not a coincidence. Considering the Taylor series of the solution to a linear differential equation: :\sum_^\infin \frac (x-a)^n it can be seen that the coefficients of the series are given by the ''n''th 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. The rule of thumb (for equations in which the polynomial multiplying the first term is non-zero at zero) is that: :y^ \to f+k/math> and more generally :x^m*y^ \to n(n-1)...(n-m+1)f+k-m/math> Example: The recurrence relationship for the Taylor series coefficients of the equation: : (x^2 + 3x -4)y^ -(3x+1)y^ + 2y = 0 is given by : n(n-1)f+1+ 3nf+2-4f+3-3nf+1-f+2 2f= 0 or :-4f+3+2nf+2+ n(n-4)f+1+2f= 0. This example shows how problems generally solved using the power series solution method taught in normal differential equation classes can be solved in a much easier way. Example: The differential equation :ay'' + by' +cy = 0 has solution : y=e^. The conversion of the differential equation to a difference equation of the Taylor coefficients is :af + 2+ bf + 1+ cf= 0. It is easy to see that the ''n''th derivative of ''e''''ax'' evaluated at 0 is ''a''''n''.

Solving via linear algebra

A linearly recursive sequence y of order n :y_ - c_y_ - c_y_ + \cdots - c_0 y_k = 0 is identical to :y_n = c_y_ + c_y_ + \cdots +c_0 y_0. Expanded with ''n''−1 identities of kind y_ = y_, this ''n''-th order equation is translated into a matrix difference equation system of n first-order linear equations, :\mathbf y_n = \beginy_n \\ y_\\ \vdots \\ \vdots \\ y_1 \end = \begin c_ & c_ & \cdots & \cdots & c_0 \\ 1 & 0 & \cdots & \cdots & 0 \\ 0 & \ddots & \ddots & &\vdots \\ \vdots & \ddots & \ddots & \ddots &\vdots \\ 0 & \cdots & 0 & 1 & 0 \end \beginy_ \\y_ \\ \vdots \\ \vdots \\ y_0 \end = C \mathbf y_ = C^n \mathbf y_0. Observe that the vector \mathbf y_n can be computed by ''n'' applications of the companion matrix, ''C'', to the initial state vector, y_0. Thereby, ''n''-th entry of the sought sequence y, is the top component of \mathbf y_n, y_n = \mathbf y_n/math>. Eigendecomposition, \mathbf y_n = C^n\, \mathbf y_0 = a_1\,\lambda_1^n\,\mathbf e_1 + a_2\,\lambda_2^n\,\mathbf e_2 + \cdots + a_n\,\lambda_n^n\,\mathbf e_n into eigenvalues, \lambda_1, \lambda_2, \ldots, \lambda_n, and eigenvectors, \mathbf e_1, \mathbf e_2, \ldots, \mathbf e_n, is used to compute \mathbf y_n. Thanks to the crucial fact that system ''C'' time-shifts every eigenvector, ''e'', by simply scaling its components ''λ'' times, :C\,\mathbf e_i = \lambda_i \mathbf e_i = C \begine_ \\e_ \\ \vdots \\ e_\end = \begin\lambda_i\,e_ \\ \lambda_i\,e_ \\ \vdots \\ \lambda_i\,e_\end that is, time-shifted version of eigenvector, e, has components ''λ'' times larger, the eigenvector components are powers of ''λ'', \mathbf e_i = \begin\lambda_i^ & \cdots & \lambda_i^2 & \lambda_i & 1\end^\mathrm, and, thus, recurrent homogeneous linear equation solution is a combination of exponential functions, \mathbf y_n = \sum_1^n . The components c_i can be determined out of initial conditions: :\mathbf y_0 = \beginy_0\\ y_ \\ \vdots\\ y_\end = \sum_^n = \begin\mathbf e_1 & \mathbf e_2 & \cdots & \mathbf e_n\end\,\beginc_1 \\ c_2 \\ \vdots \\ c_n\end = E\, \beginc_1 \\ c_2 \\ \vdots \\ c_n\end Solving for coefficients, :\beginc_1 \\ c_2 \\ \vdots \\ c_n\end = E^ \mathbf y_0 = \begin\lambda_1^ & \lambda_2^ & \cdots & \lambda_n^ \\ \vdots & \vdots & \ddots & \vdots \\ \lambda_1 & \lambda_2 & \cdots & \lambda_n \\ 1 & 1 & \cdots & 1\end^\,\beginy_\\ y_ \\ \vdots\\ y_\end. This also works with arbitrary boundary conditions \underbrace_n, not necessary the initial ones, :\beginy_a \\ y_b \\ \vdots\end = \begin\mathbf y_a\\ \mathbf y_b\\ \vdots\end = \begin\sum_^n \\ \sum_^n \\ \vdots\end =\begin\sum_^n \\ \sum_^n \\ \vdots\end : = \begin\sum \\ \sum \\ \vdots\end = \begin\lambda_1^ & \lambda_2^ & \cdots & \lambda_n^ \\ \lambda_1^ & \lambda_2^ & \cdots & \lambda_n^ \\ \vdots & \vdots & \ddots & \vdots \end\,\beginc_1 \\ c_2 \\ \vdots \\ c_n\end. This description is really no different from general method above, however it is more succinct. It also works nicely for situations like :\begin a_n =a_-b_\\ b_n =2a_+b_. \end where there are several linked recurrences.

Solving with z-transforms

Certain difference equations - in particular, linear constant coefficient difference equations - can be solved using z-transforms. The ''z''-transforms are a class of integral transforms that lead to more convenient algebraic manipulations and more straightforward solutions. There are cases in which obtaining a direct solution would be all but impossible, yet solving the problem via a thoughtfully chosen integral transform is straightforward.

Solving non-homogeneous linear recurrence relations with constant coefficients

If the recurrence is non-homogeneous, 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. Another method to solve a non-homogeneous recurrence is the method of ''symbolic differentiation''. For example, consider the following recurrence: :a_ = a_ + 1 This is a non-homogeneous recurrence. If we substitute ''n'' ↦ ''n''+1, we obtain the recurrence :a_ = a_ + 1 Subtracting the original recurrence from this equation yields :a_ - a_ = a_ - a_ or equivalently :a_ = 2 a_ - a_n This is a homogeneous recurrence, which can be solved by the methods explained above. In general, if a linear recurrence has the form : a_ = \lambda_ a_ + \lambda_ a_ + \cdots + \lambda_1 a_ + \lambda_0 a_ + p(n) where \lambda_0, \lambda_1, \dots, \lambda_ are constant coefficients and ''p''(''n'') is the inhomogeneity, then if ''p''(''n'') is a polynomial with degree ''r'', then this non-homogeneous recurrence can be reduced to a homogeneous recurrence by applying the method of symbolic differencing ''r'' times. If :P(x) = \sum_^\infty p_n x^n is the generating function of the inhomogeneity, the generating function :A(x) = \sum_^\infty a(n) x^n of the non-homogeneous recurrence : a_n = \sum_^s c_i a_+p_n,\quad n\ge n_r, with constant coefficients is derived from : \left (1-\sum_^sc_ix^i \right )A(x)=P(x)+\sum_^_n-p_n^n-\sum_^s c_ix^i\sum_^a_nx^n. If ''P''(''x'') is a rational generating function, ''A''(''x'') is also one. The case discussed above, where ''pn'' = ''K'' is a constant, emerges as one example of this formula, with ''P''(''x'') = ''K''/(1−''x''). Another example, the recurrence a_n=10 a_+n with linear inhomogeneity, arises in the definition of the schizophrenic numbers. The solution of homogeneous recurrences is incorporated as ''p'' = ''P'' = 0.

Solving first-order non-homogeneous recurrence relations with variable coefficients

Moreover, for the general first-order non-homogeneous linear recurrence relation with variable coefficients: :a_ = f_n a_n + g_n, \qquad f_n \neq 0, there is also a nice method to solve it: :a_ - f_n a_n = g_n :\frac - \frac = \frac :\frac - \frac = \frac Let :A_n = \frac, Then :A_ - A_n = \frac :\sum_^(A_ - A_m) = A_n - A_0 = \sum_^\frac :\frac = A_0 + \sum_^\frac :a_n = \left(\prod_^ f_k \right) \left(A_0 + \sum_^\frac\right) If we apply the formula to a_ = (1 + h f_) a_n + hg_ and take the limit h→0, we get the formula for first order linear differential equations with variable coefficients; the sum becomes an integral, and the product becomes the exponential function of an integral.

Solving general homogeneous linear recurrence relations

Many homogeneous linear recurrence relations may be solved by means of the generalized hypergeometric series. Special cases of these lead to recurrence relations for the orthogonal polynomials, and many special functions. For example, the solution to :J_=\fracJ_n-J_ is given by :J_n=J_n(z), the Bessel function, while :(b-n)M_ +(2n-b-z)M_n - nM_=0 is solved by :M_n=M(n,b;z) the confluent hypergeometric series. Sequences which are the solutions of linear difference equations with polynomial coefficients are called P-recursive. For these specific recurrence equations algorithms are known which find polynomial, rational or hypergeometric solutions.

Solving first-order rational difference equations

A first order rational difference equation has the form w_ = \tfrac. Such an equation can be solved by writing w_t as a nonlinear transformation of another variable x_t which itself evolves linearly. Then standard methods can be used to solve the linear difference equation in x_t.

Stability



Stability of linear higher-order recurrences

The linear recurrence of order ''d'', :a_n = c_1a_ + c_2a_+\cdots+c_da_, has the characteristic equation :\lambda^d - c_1 \lambda^ - c_2 \lambda^ - \cdots - c_d \lambda^0 =0. The recurrence is stable, meaning that the iterates converge asymptotically to a fixed value, if and only if the eigenvalues (i.e., the roots of the characteristic equation), whether real or complex, are all less than unity in absolute value.

Stability of linear first-order matrix recurrences

In the first-order matrix difference equation :_t - x^*= A_-x^*/math> with state vector ''x'' and transition matrix ''A'', ''x'' converges asymptotically to the steady state vector ''x''* if and only if all eigenvalues of the transition matrix ''A'' (whether real or complex) have an absolute value which is less than 1.

Stability of nonlinear first-order recurrences

Consider the nonlinear first-order recurrence :x_n=f(x_). This recurrence is locally stable, meaning that it converges to a fixed point ''x''* from points sufficiently close to ''x''*, if the slope of ''f'' in the neighborhood of ''x''* is smaller than unity in absolute value: that is, : | f' (x^*) | < 1. A nonlinear recurrence could have multiple fixed points, in which case some fixed points may be locally stable and others locally unstable; for continuous ''f'' two adjacent fixed points cannot both be locally stable. A nonlinear recurrence relation could also have a cycle of period ''k'' for ''k'' > 1. Such a cycle is stable, meaning that it attracts a set of initial conditions of positive measure, if the composite function :g(x) := f \circ f \circ \cdots \circ f(x) with ''f'' appearing ''k'' times is locally stable according to the same criterion: : | g' (x^*) | < 1, where ''x''* is any point on the cycle. In a chaotic recurrence relation, the variable ''x'' stays in a bounded region but never converges to a fixed point or an attracting cycle; any fixed points or cycles of the equation are unstable. See also logistic map, dyadic transformation, and tent map.


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 :y'(t) = f(t,y(t)), \ \ y(t_0)=y_0, with Euler's method and a step size ''h'', one calculates the values :y_0=y(t_0), \ \ y_1=y(t_0+h), \ \ y_2=y(t_0+2h), \ \dots by the recurrence :\, y_ = y_n + hf(t_n,y_n), t_n = t_0 + nh Systems of linear first order differential equations can be discretized exactly analytically using the methods shown in the discretization article.


Applications





Biology


Some of the best-known difference equations have their origins in the attempt to model population dynamics. For example, the Fibonacci numbers were once used as a model for the growth of a rabbit population. The logistic map is used either directly to model population growth, or as a starting point for more detailed models of population dynamics. In this context, coupled difference equations are often used to model the interaction of two or more populations. For example, the Nicholson–Bailey model for a host-parasite interaction is given by :N_ = \lambda N_t e^ :P_ = N_t(1-e^), with ''N''''t'' representing the hosts, and ''P''''t'' the parasites, at time ''t''. Integrodifference equations are a form of recurrence relation important to spatial ecology. These and other difference equations are particularly suited to modeling univoltine populations.

Computer science

Recurrence relations are also of fundamental importance in analysis of algorithms. If an algorithm is designed so that it will break a problem into smaller subproblems (divide and conquer), its running time is described by a recurrence relation. A simple example is the time an algorithm takes to find an element in an ordered vector with n elements, in the worst case. A naive algorithm will search from left to right, one element at a time. The worst possible scenario is when the required element is the last, so the number of comparisons is n. A better algorithm is called binary search. However, it requires a sorted vector. It will first check if the element is at the middle of the vector. If not, then it will check if the middle element is greater or lesser than the sought element. At this point, half of the vector can be discarded, and the algorithm can be run again on the other half. The number of comparisons will be given by :c_1=1 :c_n=1+c_ the time complexity of which will be O(\log_2(n)).


Digital signal processing


In digital signal processing, recurrence relations can model feedback in a system, where outputs at one time become inputs for future time. They thus arise in infinite impulse response (IIR) digital filters. For example, the equation for a "feedforward" IIR comb filter of delay ''T'' is: :y_t = (1 - \alpha) x_t + \alpha y_, where x_t is the input at time ''t'', y_t is the output at time ''t'', and α controls how much of the delayed signal is fed back into the output. From this we can see that :y_t = (1 - \alpha) x_t + \alpha ((1-\alpha) x_ + \alpha y_) :y_t = (1 - \alpha) x_t + (\alpha-\alpha^2) x_ + \alpha^2 y_ etc.

Economics

Recurrence relations, especially linear recurrence relations, are used extensively in both theoretical and empirical economics. In particular, in macroeconomics one might develop a model of various broad sectors of the economy (the financial sector, the goods sector, the labor market, etc.) in which some agents' actions depend on lagged variables. The model would then be solved for current values of key variables (interest rate, real GDP, etc.) in terms of past and current values of other variables.

See also

* Holonomic sequences * Iterated function * Orthogonal polynomials * Recursion * Recursion (computer science) * Lagged Fibonacci generator * Master theorem (analysis of algorithms) * Circle points segments proof * Continued fraction * Time scale calculus * Combinatorial principles * Infinite impulse response * Integration by reduction formulae * Mathematical induction


References





Footnotes





Bibliography


* * * * * Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. ''Introduction to Algorithms'', Second Edition. MIT Press and McGraw-Hill, 1990. . Chapter 4: Recurrences, pp. 62–90. * * * chapter 7. * Chapter 9.1: Difference Equations. * * at EqWorld - The World of Mathematical Equations. * at EqWorld - The World of Mathematical Equations. *


External links


* * * OEIS index to a few thousand examples of linear recurrences, sorted by order (number of terms) and signature (vector of values of the constant coefficients) {{Authority control Category:Algebra Category:Combinatorics