Movatterモバイル変換

Jump to content

Recurrence relation

From Wikipedia, the free encyclopedia

(Redirected fromDifference operator)

Pattern defining an infinite sequence of numbers

Inmathematics, arecurrence relation is anequation according to which the $n {\displaystyle n}$ th term of asequence of numbers is equal to some combination of the previous terms. Often, only $k {\displaystyle k}$ previous terms of the sequence appear in the equation, for a parameter $k {\displaystyle k}$ that is independent of $n {\displaystyle n}$ ; this number $k {\displaystyle k}$ is called theorder of the relation. If the values of the first $k {\displaystyle k}$ numbers in the sequence have been given, the rest of the sequence can be calculated by repeatedly applying the equation.

Inlinear recurrences, thenth term is equated to alinear function of the $k {\displaystyle k}$ previous terms. A famous example is the recurrence for theFibonacci numbers, $F_{n}=F_{n-1}+F_{n-2}$ where the order $k {\displaystyle k}$ is two and the linear function merely adds the two previous terms. This example is alinear recurrence with constant coefficients, because the coefficients of the linear function (1 and 1) are constants that do not depend on $n . {\displaystyle n.}$ For these recurrences, one can express the general term of the sequence as aclosed-form expression of $n {\displaystyle n}$ . As well,linear recurrences with polynomial coefficients depending on $n {\displaystyle n}$ are also important, because many commonelementary functions andspecial functions have aTaylor series whose coefficients satisfy such a recurrence relation (seeholonomic function).

Solving a recurrence relation means obtaining aclosed-form solution: a non-recursive function of $n {\displaystyle n}$ .

The concept of a recurrence relation can be extended tomultidimensional arrays, that is,indexed families that are indexed bytuples ofnatural numbers.

Definition

Arecurrence relation is an equation that expresses each element of asequence 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_{n-1})\quad {\text{for}}\quad n>0,

where

\varphi :\mathbb {N} \times X\to X

is a function, whereX 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 theinitial value.^[1]

It is easy to modify the definition for getting sequences starting from the term of index 1 or higher.

This defines recurrence relation offirst order. A recurrence relation oforderk has the form

u_{n}=\varphi (n,u_{n-1},u_{n-2},\ldots ,u_{n-k})\quad {\text{for}}\quad n\geq k,

where $\varphi :\mathbb {N} \times X^{k}\to X$ is a function that involvesk consecutive elements of the sequence.In this case,k initial values are needed for defining a sequence.

Examples

Factorial

Thefactorial is defined by the recurrence relation

n!=n\cdot (n-1)!\quad {\text{for}}\quad n>0,

and the initial condition

0!=1.

This is an example of alinear recurrence with polynomial coefficients of order 1, with the simple polynomial (inn)

n {\displaystyle n}

as its only coefficient.

Logistic map

An example of a recurrence relation is thelogistic map defined by

x_{n+1}=rx_{n}(1-x_{n}),

for a given constant $r . {\displaystyle r.}$ The behavior of the sequence depends dramatically on $r, {\displaystyle r,}$ but is stable when the initial condition $x_{0}$ varies.

Fibonacci numbers

The recurrence of order two satisfied by theFibonacci numbers is the canonical example of a homogeneouslinear recurrence relation with constant coefficients (see below). The Fibonacci sequence is defined using the recurrence

F_{n}=F_{n-1}+F_{n-2}

withinitial conditions

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 yieldingBinet's formula, which involves powers of the two roots of the characteristic polynomial $t^{2}=t+1$ ; thegenerating function of the sequence is therational function

{\frac {t}{1-t-t^{2}}}.

Binomial coefficients

A simple example of a multidimensional recurrence relation is given by thebinomial coefficients ${\tbinom {n}{k}}$ , which count the ways of selecting $k {\displaystyle k}$ elements out of a set of $n {\displaystyle n}$ elements.They can be computed by the recurrence relation

{\binom {n}{k}}={\binom {n-1}{k-1}}+{\binom {n-1}{k}},

with the base cases ${\tbinom {n}{0}}={\tbinom {n}{n}}=1$ . Using this formula to compute the values of all binomial coefficients generates an infinite array calledPascal's triangle. The same values can also be computed directly by a different formula that is not a recurrence, but usesfactorials, multiplication and division, not just additions:

{\binom {n}{k}}={\frac {n!}{k!(n-k)!}}.

The binomial coefficients can also be computed with a uni-dimensional recurrence:

{\binom {n}{k}}={\binom {n}{k-1}}(n-k+1)/k,

with the initial value ${\textstyle {\binom {n}{0}}=1}$ (The division is not displayed as a fraction for emphasizing that it must be computed after the multiplication, for not introducing fractional numbers).This recurrence is widely used in computers because it does not require to build a table as does the bi-dimensional recurrence, and does not involve very large integers as does the formula with factorials (if one uses ${\textstyle {\binom {n}{k}}={\binom {n}{n-k}},}$ all involved integers are smaller than the final result).

Difference operator and difference equations

Thedifference operator is anoperator that mapssequences to sequences, and, more generally,functions to functions. It is commonly denoted $\Delta ,$ and is defined, infunctional notation, as

(\Delta f)(x)=f(x+1)-f(x).

It is thus a special case offinite difference.

When using the index notation for sequences, the definition becomes

(\Delta a)_{n}=a_{n+1}-a_{n}.

The parentheses around $\Delta f$ and $\Delta a$ are generally omitted, and $\Delta a_{n}$ must be understood as the term of indexn in the sequence $\Delta a,$ and not $\Delta$ applied to the element $a_{n}.$

Givensequence $a=(a_{n})_{n\in \mathbb {N} },$ thefirst difference ofa is $\Delta a.$

Thesecond difference is $\Delta ^{2}a=(\Delta \circ \Delta )a=\Delta (\Delta a).$ A simple computation shows that

\Delta ^{2}a_{n}=a_{n+2}-2a_{n+1}+a_{n}.

More generally: thekth difference is defined recursively as $\Delta ^{k}=\Delta \circ \Delta ^{k-1},$ and one has

\Delta ^{k}a_{n}=\sum _{t=0}^{k}(-1)^{t}{\binom {k}{t}}a_{n+k-t}.

This relation can be inverted, giving

a_{n+k}=a_{n}+{k \choose 1}\Delta a_{n}+\cdots +{k \choose k}\Delta ^{k}(a_{n}).

Adifference equation of orderk is an equation that involves thek first differences of a sequence or a function, in the same way as adifferential equation of orderk relates thek firstderivatives of a function.

The two above relations allow transforming a recurrence relation of orderk into a difference equation of orderk, and, conversely, a difference equation of orderk into recurrence relation of orderk. Each transformation is theinverse of the other, and the sequences that are solution of the difference equation are exactly those that satisfies the recurrence relation.

For example, the difference equation

3\Delta ^{2}a_{n}+2\Delta a_{n}+7a_{n}=0

is equivalent to the recurrence relation

3a_{n+2}=4a_{n+1}-8a_{n},

in the sense that the two equations are satisfied by the same sequences.

As it is equivalent for a sequence to satisfy a recurrence relation or to be the solution of a difference equation, the use of the term "difference equation" is not limited to equations using a difference operator,^[2]^[3] and the two terms "recurrence relation" and "difference equation" can be used interchangeably.^[4] SeeRational difference equation,Linear constant-coefficient difference equation andMatrix difference equation for examples of using "difference equation" instead of "recurrence relation".

Difference equations resemble differential equations, and this resemblance is often used to mimic methods for solving differentiable equations to apply to solving difference equations, and therefore recurrence relations.

Summation equations relate to difference equations asintegral equations relate to differential equations. Seetime scale calculus for a unification of the theory of difference equations with that of 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 {\displaystyle n}$ -dimensional grids. Functions defined on $n {\displaystyle n}$ -grids can also be studied with partial difference equations.^[5]

Solving

Solving linear recurrence relations with constant coefficients

Main article:Linear recurrence with constant coefficients

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_{n+1}=f_{n}a_{n}+g_{n},\qquad f_{n}\neq 0,

there is also a nice method to solve it:^[6]

a_{n+1}-f_{n}a_{n}=g_{n}

{\frac {a_{n+1}}{\prod _{k=0}^{n}f_{k}}}-{\frac {f_{n}a_{n}}{\prod _{k=0}^{n}f_{k}}}={\frac {g_{n}}{\prod _{k=0}^{n}f_{k}}}

{\frac {a_{n+1}}{\prod _{k=0}^{n}f_{k}}}-{\frac {a_{n}}{\prod _{k=0}^{n-1}f_{k}}}={\frac {g_{n}}{\prod _{k=0}^{n}f_{k}}}

Let

A_{n}={\frac {a_{n}}{\prod _{k=0}^{n-1}f_{k}}},

Then

A_{n+1}-A_{n}={\frac {g_{n}}{\prod _{k=0}^{n}f_{k}}}

\sum _{m=0}^{n-1}(A_{m+1}-A_{m})=A_{n}-A_{0}=\sum _{m=0}^{n-1}{\frac {g_{m}}{\prod _{k=0}^{m}f_{k}}}

{\frac {a_{n}}{\prod _{k=0}^{n-1}f_{k}}}=A_{0}+\sum _{m=0}^{n-1}{\frac {g_{m}}{\prod _{k=0}^{m}f_{k}}}

a_{n}=\left(\prod _{k=0}^{n-1}f_{k}\right)\left(A_{0}+\sum _{m=0}^{n-1}{\frac {g_{m}}{\prod _{k=0}^{m}f_{k}}}\right)

If we apply the formula to $a_{n+1}=(1+hf_{nh})a_{n}+hg_{nh}$ and take the limit $h\to 0$ , we get the formula for first orderlinear 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 thegeneralized hypergeometric series. Special cases of these lead to recurrence relations for theorthogonal polynomials, and manyspecial functions. For example, the solution to

J_{n+1}={\frac {2n}{z}}J_{n}-J_{n-1}

is given by

J_{n}=J_{n}(z),

theBessel function, while

(b-n)M_{n-1}+(2n-b+z)M_{n}-nM_{n+1}=0

is solved by

M_{n}=M(n,b;z)

theconfluent hypergeometric series. Sequences which are the solutions oflinear difference equations with polynomial coefficients are calledP-recursive. For these specific recurrence equations algorithms are known which findpolynomial,rational orhypergeometric solutions.

Solving general non-homogeneous linear recurrence relations with constant coefficients

Furthermore, for the general non-homogeneous linear recurrence relation with constant coefficients, one can solve it based on variation of parameter.^[7]

Solving first-order rational difference equations

Main article:Rational difference equation

A first order rational difference equation has the form $w_{t+1}={\tfrac {aw_{t}+b}{cw_{t}+d}}$ . 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 {\displaystyle d}$ ,

a_{n}=c_{1}a_{n-1}+c_{2}a_{n-2}+\cdots +c_{d}a_{n-d},

has thecharacteristic equation

\lambda ^{d}-c_{1}\lambda ^{d-1}-c_{2}\lambda ^{d-2}-\cdots -c_{d}\lambda ^{0}=0.

The recurrence isstable, meaning that the iterates converge asymptotically to a fixed value, if and only if theeigenvalues (i.e., the roots of the characteristic equation), whether real or complex, are all less thanunity in absolute value.

Stability of linear first-order matrix recurrences

Main article:Matrix difference equation

In the first-order matrix difference equation

[x_{t}-x^{*}]=A[x_{t-1}-x^{*}]

with state vector $x {\displaystyle x}$ and transition matrix $A {\displaystyle A}$ , $x {\displaystyle x}$ converges asymptotically to the steady state vector $x^{*}$ if and only if all eigenvalues of the transition matrix $A {\displaystyle A}$ (whether real or complex) have anabsolute value which is less than 1.

Stability of nonlinear first-order recurrences

Consider the nonlinear first-order recurrence

x_{n}=f(x_{n-1}).

This recurrence islocally stable, meaning that itconverges to a fixed point $x^{*}$ from points sufficiently close to $x^{*}$ , if the slope of $f {\displaystyle f}$ in the neighborhood of $x^{*}$ is smaller thanunity 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 continuousf two adjacent fixed points cannot both be locally stable.

A nonlinear recurrence relation could also have a cycle of period $k {\displaystyle 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 {\displaystyle f}$ appearing $k {\displaystyle k}$ times is locally stable according to the same criterion:

|g'(x^{*})|<1,

where $x^{*}$ is any point on the cycle.

In achaotic recurrence relation, the variable $x {\displaystyle 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 alsologistic map,dyadic transformation, andtent map.

Relationship to differential equations

When solving anordinary differential equation numerically, one typically encounters a recurrence relation. For example, when solving theinitial value problem

y'(t)=f(t,y(t)),\ \ y(t_{0})=y_{0},

withEuler's method and a step size $h {\displaystyle 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_{n+1}=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 thediscretization article.

Applications

Mathematical biology

Some of the best-known difference equations have their origins in the attempt to modelpopulation dynamics. For example, theFibonacci numbers were once used as a model for the growth of a rabbit population.

Thelogistic 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 morepopulations. For example, theNicholson–Bailey model for a host-parasite interaction is given by

N_{t+1}=\lambda N_{t}e^{-aP_{t}}

P_{t+1}=N_{t}(1-e^{-aP_{t}}),

with $N_{t}$ representing the hosts, and $P_{t}$ the parasites, at time $t {\displaystyle t}$ .

Integrodifference equations are a form of recurrence relation important to spatialecology. These and other difference equations are particularly suited to modelingunivoltine populations.

Computer science

Recurrence relations are also of fundamental importance inanalysis of algorithms.^[8]^[9] If analgorithm 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 {\displaystyle 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 {\displaystyle n}$ .

A better algorithm is calledbinary 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_{n/2}

thetime complexity of which will be $O(\log _{2}(n))$ .

Digital signal processing

Indigital signal processing, recurrence relations can model feedback in a system, where outputs at one time become inputs for future time. They thus arise ininfinite impulse response (IIR)digital filters.

For example, the equation for a "feedforward" IIRcomb filter of delay $T {\displaystyle T}$ is:

y_{t}=(1-\alpha )x_{t}+\alpha y_{t-T},

where $x_{t}$ is the input at time $t {\displaystyle t}$ , $y_{t}$ is the output at time $t {\displaystyle t}$ , and $\alpha$ 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_{t-T}+\alpha y_{t-2T})

y_{t}=(1-\alpha )x_{t}+(\alpha -\alpha ^{2})x_{t-T}+\alpha ^{2}y_{t-2T}

etc.

Economics

See also:time series analysis andsimultaneous equations model

Recurrence relations, especially linear recurrence relations, are used extensively in both theoretical and empirical economics.^[10]^[11] 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, realGDP, etc.) in terms of past and current values of other variables.

See also

References

Footnotes

^Jacobson, Nathan, Basic Algebra 2 (2nd ed.), § 0.4. pg 16.
^S. Barnard and J. M. Child,Higher Algebra (1936) page 369. "An equation of the formau_n + bu_n−1 + cu_n−2 + ... + ku_n−r = l is called alinear difference equation."
^C. R. Wylie,Advanced Engineering Mathematics (1960) page 167. "However, in the study of difference equations we do not ordinarily consider equations of the formf(Δ)y = 𝜙(x) ... but rather equations of the formf(E)y = 𝜙(x)" where Δ is the difference operator andE is ashift operator.
^J. Bradley,Introduction to Discrete Mathematics (1988) page 266. "Older texts on this topic tend to talk primarily about difference equations; newer ones talk about recurrence equations or relations. This reflects an important change in mathematical thinking since the 1950s; difference equations are primarily seen as an approximation of differential equations, a calculus topic. Recurrence equations are seen as an important topic in their own right. The shift in names suggests the growing recognition of the importance of discrete mathematics."
^Partial difference equations, Sui Sun Cheng, CRC Press, 2003,ISBN 978-0-415-29884-1
^"Archived copy"(PDF).Archived(PDF) from the original on 2010-07-05. Retrieved2010-10-19.{{cite web}}: CS1 maint: archived copy as title (link)
^Solution of Nonhomogeneous Linear Recurrence Relations with Constant Coefficient based on Variation of Parameter, Haoran Han, 2025
^Cormen, T. et al,Introduction to Algorithms, MIT Press, 2009
^R. Sedgewick, F. Flajolet,An Introduction to the Analysis of Algorithms, Addison-Wesley, 2013
^Stokey, Nancy L.;Lucas, Robert E. Jr.;Prescott, Edward C. (1989).Recursive Methods in Economic Dynamics. Cambridge: Harvard University Press.ISBN 0-674-75096-9.
^Ljungqvist, Lars;Sargent, Thomas J. (2004).Recursive Macroeconomic Theory (Second ed.). Cambridge: MIT Press.ISBN 0-262-12274-X.

Bibliography

Batchelder, Paul M. (1967).An introduction to linear difference equations. Dover Publications.
Miller, Kenneth S. (1968).Linear difference equations. W. A. Benjamin.
Fillmore, Jay P.; Marx, Morris L. (1968). "Linear recursive sequences".SIAM Rev. Vol. 10, no. 3. pp. 324–353.JSTOR 2027658.
Brousseau, Alfred (1971).Linear Recursion and Fibonacci Sequences. Fibonacci Association.
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest, andClifford Stein.Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 1990.ISBN 0-262-03293-7. Chapter 4: Recurrences, pp. 62–90.
Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren (1994).Concrete Mathematics: A Foundation for Computer Science (2 ed.). Addison-Wesley.ISBN 0-201-55802-5.
Enders, Walter (2010).Applied Econometric Times Series (3 ed.). Archived fromthe original on 2014-11-10.
Cull, Paul;Flahive, Mary; Robson, Robbie (2005).Difference Equations: From Rabbits to Chaos. Springer.ISBN 0-387-23234-6. chapter 7.
Jacques, Ian (2006).Mathematics for Economics and Business (Fifth ed.). Prentice Hall. pp. 551–568.ISBN 0-273-70195-9. Chapter 9.1: Difference Equations.
Minh, Tang; Van To, Tan (2006)."Using generating functions to solve linear inhomogeneous recurrence equations"(PDF).Proc. Int. Conf. Simulation, Modelling and Optimization, SMO'06. pp. 399–404. Archived fromthe original(PDF) on 2016-03-04. Retrieved2014-08-07.
Polyanin, Andrei D."Difference and Functional Equations: Exact Solutions". at EqWorld - The World of Mathematical Equations.
Polyanin, Andrei D."Difference and Functional Equations: Methods". at EqWorld - The World of Mathematical Equations.
Wang, Xiang-Sheng; Wong, Roderick (2012). "Asymptotics of orthogonal polynomials via recurrence relations".Anal. Appl.10 (2):215–235.arXiv:1101.4371.doi:10.1142/S0219530512500108.S2CID 28828175.

External links

"Recurrence relation",Encyclopedia of Mathematics,EMS Press, 2001 [1994]
Weisstein, Eric W."Recurrence Equation".MathWorld.
"OEIS Index Rec".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)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Recurrence_relation&oldid=1333742476#difference_operator"

Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp