1000/1000

Hot
Most Recent

Submitted Successfully!

To reward your contribution, here is a gift for you: A free trial for our video production service.

Thank you for your contribution! You can also upload a video entry or images related to this topic.

Do you have a full video?

Are you sure to Delete?

Cite

If you have any further questions, please contact Encyclopedia Editorial Office.

HandWiki. Linear Difference Equation. Encyclopedia. Available online: https://encyclopedia.pub/entry/36534 (accessed on 13 June 2024).

HandWiki. Linear Difference Equation. Encyclopedia. Available at: https://encyclopedia.pub/entry/36534. Accessed June 13, 2024.

HandWiki. "Linear Difference Equation" *Encyclopedia*, https://encyclopedia.pub/entry/36534 (accessed June 13, 2024).

HandWiki. (2022, November 25). Linear Difference Equation. In *Encyclopedia*. https://encyclopedia.pub/entry/36534

HandWiki. "Linear Difference Equation." *Encyclopedia*. Web. 25 November, 2022.

Copy Citation

In mathematics and in particular dynamical systems, a linear difference equation:ch. 17:ch. 10 or linear recurrence relation sets equal to 0 a polynomial that is linear in the various iterates of a variable—that is, in the values of the elements of a sequence. The polynomial's linearity means that each of its terms has degree 0 or 1. Usually the context is the evolution of some variable over time, with the current time period or discrete moment in time denoted as t, one period earlier denoted as t − 1, one period later as t + 1, etc. An nth order linear difference equation is one that can be written in terms of parameters a1, …, an and b as or equivalently as The equation is called homogeneous if b = 0 and nonhomogeneous if b ≠ 0. Since the longest time lag between iterates appearing in the equation is n, this is an nth order equation, where n could be any positive integer. When the longest lag is specified numerically so n does not appear notationally as the longest time lag, n is occasionally used instead of t to index iterates. In the most general case the coefficients ai and b could themselves be functions of t; however, this article treats the most common case, that of constant coefficients. If the coefficients ai are polynomials in t the equation is called a linear recurrence equation with polynomial coefficients. The solution of such an equation is a function of t, and not of any iterate values, giving the value of the iterate at any time. To find the solution it is necessary to know the specific values (known as initial conditions) of n of the iterates, and normally these are the n iterates that are oldest. The equation or its variable is said to be stable if from any set of initial conditions the variable's limit as time goes to infinity exists; this limit is called the steady state. Difference equations are used in a variety of contexts, such as in economics to model the evolution through time of variables such as gross domestic product, the inflation rate, the exchange rate, etc. They are used in modeling such time series because values of these variables are only measured at discrete intervals. In econometric applications, linear difference equations are modeled with stochastic terms in the form of autoregressive (AR) models and in models such as vector autoregression (VAR) and autoregressive moving average (ARMA) models that combine AR with other features.

linear recurrence
modeling
model

Solving the homogeneous equation

- [math]\displaystyle{ x_t= a_1x_{t-1} + \cdots + a_nx_{t-n} }[/math]

involves first solving its characteristic equation

- [math]\displaystyle{ \lambda^n = a_1\lambda^{n-1} + \cdots + a_{n-2}\lambda^2+a_{n-1} \lambda + a_n }[/math]

for its characteristic roots *λ*_{1}, ..., *λ*_{n}. These roots can be solved for algebraically if *n* ≤ 4, but not necessarily otherwise. If the solution is to be used numerically, all the roots of this characteristic equation can be found by numerical methods. However, for use in a theoretical context it may be that the only information required about the roots is whether any of them are greater than or equal to 1 in absolute value.

It may be that all the roots are real or instead there may be some that are complex numbers. In the latter case, all the complex roots come in complex conjugate pairs.

If all the characteristic roots are distinct, the solution of the homogeneous linear difference equation

- [math]\displaystyle{ x_t= a_1x_{t-1} + \cdots + a_nx_{t-n} }[/math]

can be written in terms of the characteristic roots as

- [math]\displaystyle{ x_t=c_1\lambda_1^t +\cdots + c_n\lambda_n^t }[/math]

where the coefficients *c*_{i} can be found by invoking the initial conditions. Specifically, for each time period for which an iterate value is known, this value and its corresponding value of t can be substituted into the solution equation to obtain a linear equation in the n as-yet-unknown parameters; n such equations, one for each initial condition, can be solved simultaneously for the n parameter values. If all characteristic roots are real, then all the coefficient values *c*_{i} will also be real; but with non-real complex roots, in general some of these coefficients will also be non-real.

If there are complex roots, they come in conjugate pairs and so do the complex terms in the solution equation. If two of these complex terms are *c*_{j}*λ**t**j* and *c*_{j+1}*λ**t**j*+1, the roots *λ*_{j} can be written as

- [math]\displaystyle{ \lambda_j, \lambda_{j+1}=\alpha \pm \beta i =M\left(\frac{\alpha}{M} \pm \frac{\beta}{M}i\right) }[/math]

where i is the imaginary unit and M is the modulus of the roots:

- [math]\displaystyle{ M = \sqrt{\alpha^2+\beta^2}. }[/math]

Then the two complex terms in the solution equation can be written as

- [math]\displaystyle{ \begin{align} c_j\lambda_j^t + c_{j+1}\lambda_{j+1}^t & = M^t\left(c_j\left(\frac{\alpha}{M} + \frac{\beta}{M}i\right)^t + c_{j+1}\left(\frac{\alpha}{M} - \frac{\beta}{M}i\right)^t\right) \\[6pt] & = M^t\left(c_j\left(\cos\theta + i\sin\theta\right)^t + c_{j+1}\left(\cos \theta - i\sin\theta\right)^t\right) \\[6pt] & = M^t\bigl(c_j\left(\cos\theta t + i\sin \theta t\right) + c_{j+1}\left(\cos\theta t - i\sin\theta t\right) \bigr) \end{align} }[/math]

where θ is the angle whose cosine is *α*/*M* and whose sine is *β*/*M*; the last equality here made use of de Moivre's formula.

Now the process of finding the coefficients *c*_{j} and *c*_{j+1} guarantees that they are also complex conjugates, which can be written as *γ* ± *δi*. Using this in the last equation gives this expression for the two complex terms in the solution equation:

- [math]\displaystyle{ 2M^t\left(\gamma \cos\theta t - \delta \sin\theta t\right) }[/math]

which can also be written as

- [math]\displaystyle{ 2\sqrt{\gamma^2+\delta^2}M^t \cos(\theta t + \psi) }[/math]

where ψ is the angle whose cosine is *γ*/√*γ*^{2} + *δ*^{2} and whose sine is *δ*/√*γ*^{2} + *δ*^{2}.

Depending on the initial conditions, even with all roots real the iterates can experience a transitory tendency to go above and below the steady state value. But true cyclicity involves a permanent tendency to fluctuate, and this occurs if there is at least one pair of complex conjugate characteristic roots. This can be seen in the trigonometric form of their contribution to the solution equation, involving cos *θt* and sin *θt*.

In the second-order case, if the two roots are identical (*λ*_{1} = *λ*_{2}), they can both be denoted as λ and a solution may be of the form

- [math]\displaystyle{ x_t = c_1 \lambda^t + c_2 t \lambda^t. }[/math]

If *b* ≠ 0, the equation

- [math]\displaystyle{ y_t = a_1y_{t-1} + \cdots + a_ny_{t-n} + b }[/math]

is said to be *nonhomogeneous*. To solve this equation it is convenient to convert it to homogeneous form, with no constant term. This is done by first finding the equation's *steady state value*—a value *y** such that, if n successive iterates all had this value, so would all future values. This value is found by setting all values of y equal to *y** in the difference equation, and solving, thus obtaining

- [math]\displaystyle{ y^* = \frac{b}{1-a_1-\cdots - a_n} }[/math]

assuming the denominator is not 0. If it is zero, the steady state does not exist.

Given the steady state, the difference equation can be rewritten in terms of deviations of the iterates from the steady state, as

- [math]\displaystyle{ \left(y_t -y^*\right)= a_1\left(y_{t-1}-y^*\right) + \cdots + a_n\left(y_{t-n}-y^*\right) }[/math]

which has no constant term, and which can be written more succinctly as

- [math]\displaystyle{ x_t= a_1x_{t-1} + \cdots + a_nx_{t-n} }[/math]

where x equals *y* − *y**. This is the homogeneous form.

If there is no steady state, the difference equation

- [math]\displaystyle{ y_t = a_1y_{t-1} + \cdots + a_ny_{t-n} + b }[/math]

can be combined with its equivalent form

- [math]\displaystyle{ y_{t-1}= a_1y_{t-2}+ \cdots + a_ny_{t-(n+1)}+ b }[/math]

to obtain (by solving both for b)

- [math]\displaystyle{ y_t - a_1y_{t-1} - \cdots - a_ny_{t-n} = y_{t-1}- a_1y_{t-2}- \cdots - a_ny_{t-(n+1)} }[/math]

in which like terms can be combined to give a homogeneous equation of one order higher than the original.

In the solution equation

- [math]\displaystyle{ x_t = c_1\lambda_1^t +\cdots + c_n\lambda_n^t, }[/math]

a term with real characteristic roots converges to 0 as t grows indefinitely large if the absolute value of the characteristic root is less than 1. If the absolute value equals 1, the term will stay constant as t grows if the root is +1 but will fluctuate between two values if the root is −1. If the absolute value of the root is greater than 1 the term will become larger and larger over time. A pair of terms with complex conjugate characteristic roots will converge to 0 with dampening fluctuations if the absolute value of the modulus M of the roots is less than 1; if the modulus equals 1 then constant amplitude fluctuations in the combined terms will persist; and if the modulus is greater than 1, the combined terms will show fluctuations of ever-increasing magnitude.

Thus the evolving variable x will converge to 0 if all of the characteristic roots have magnitude less than 1.

If the largest root has absolute value 1, neither convergence to 0 nor divergence to infinity will occur. If all roots with magnitude 1 are real and positive, x will converge to the sum of their constant terms *c*_{i}; unlike in the stable case, this converged value depends on the initial conditions; different starting points lead to different points in the long run. If any root is −1, its term will contribute permanent fluctuations between two values. If any of the unit-magnitude roots are complex then constant-amplitude fluctuations of x will persist.

Finally, if any characteristic root has magnitude greater than 1, then x will diverge to infinity as time goes to infinity, or will fluctuate between increasingly large positive and negative values.

A theorem of Issai Schur states that all roots have magnitude less than 1 (the stable case) if and only if a particular string of determinants are all positive.^{[1]}^{:247}

If a non-homogeneous linear difference equation has been converted to homogeneous form which has been analyzed as above, then the stability and cyclicality properties of the original non-homogeneous equation will be the same as those of the derived homogeneous form, with convergence in the stable case being to the steady-state value *y** instead of to 0.

An alternative solution method involves converting the nth order difference equation to a first-order matrix difference equation. This is accomplished by writing *w*_{1,t} = *y*_{t}, *w*_{2,t} = *y*_{t−1} = *w*_{1,t−1}, *w*_{3,t} = *y*_{t−2} = *w*_{2,t−1}, and so on. Then the original single nth-order equation

- [math]\displaystyle{ y_t = a_1y_{t-1} + a_2y_{t-2} + \cdots + a_ny_{t-n} + b }[/math]

can be replaced by the following n first-order equations:

- [math]\displaystyle{ \begin{align} w_{1, t} & = a_1w_{1, t-1} + a_2w_{2, t-1}+\cdots + a_nw_{n, t-1} + b \\ w_{2, t} & = w_{1, t-1} \\ & \,\,\,\vdots \\ w_{n,t} & =w_{n-1, t-1}. \end{align} }[/math]

Defining the vector **w**_{i} as

- [math]\displaystyle{ \mathbf{w}_i = \begin{bmatrix}w_{1,i} \\ w_{2,i} \\ \vdots \\ w_{n,i} \end{bmatrix} }[/math]

this can be put in matrix form as

- [math]\displaystyle{ \mathbf{w}_t = \mathbf{A}\mathbf{w}_{t-1}+\mathbf{b} }[/math]

Here **A** is an *n* × *n* matrix in which the first row contains *a*_{1}, ..., *a*_{n} and all other rows have a single 1 with all other elements being 0, and **b** is a column vector with first element b and with the rest of its elements being 0.

This matrix equation can be solved using the methods in the article Matrix difference equation.

- Baumol, William (1970). Economic Dynamics (Third ed.). New York: Macmillan. ISBN 0-02-306660-1. https://archive.org/details/economicdynamics0000baum_c7i2.

More

Information

Subjects:
Others

Contributor
MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register
:

View Times:
252

Entry Collection:
HandWiki

Update Date:
25 Nov 2022