Rational difference equation

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

A rational difference equation is a nonlinear difference equation of the form[1][2][3][4]

xn+1=α+i=0kβixniA+i=0kBixni,

where the initial conditions x0,x1,,xk are such that the denominator never vanishes for any n.

First-order rational difference equation

[edit | edit source]

A first-order rational difference equation is a nonlinear difference equation of the form

wt+1=awt+bcwt+d.

When a,b,c,d and the initial condition w0 are real numbers, this difference equation is called a Riccati difference equation.[3]

Such an equation can be solved by writing wt as a nonlinear transformation of another variable xt which itself evolves linearly. Then standard methods can be used to solve the linear difference equation in xt.

Equations of this form arise from the infinite resistor ladder problem.[5][6]

Solving a first-order equation

[edit | edit source]

First approach

[edit | edit source]

One approach[7] to developing the transformed variable xt, when adbc0, is to write

yt+1=αβyt

where α=(a+d)/c and β=(adbc)/c2 and where wt=ytd/c.

Further writing yt=xt+1/xt can be shown to yield

xt+2αxt+1+βxt=0.

Second approach

[edit | edit source]

This approach[8] gives a first-order difference equation for xt instead of a second-order one, for the case in which (da)2+4bc is non-negative. Write xt=1/(η+wt) implying wt=(1ηxt)/xt, where η is given by η=(da+r)/2c and where r=(da)2+4bc. Then it can be shown that xt evolves according to

xt+1=(dηcηc+a)xt+cηc+a.

Third approach

[edit | edit source]

The equation

wt+1=awt+bcwt+d

can also be solved by treating it as a special case of the more general matrix equation

Xt+1=(E+BXt)(C+AXt)1,

where all of A, B, C, E, and X are n × n matrices (in this case n = 1); the solution of this is[9]

Xt=NtDt1

where

(NtDt)=(BEAC)t(X0I).

Application

[edit | edit source]

It was shown in [10] that a dynamic matrix Riccati equation of the form

Ht1=K+AHtAAHtC(CHtC)1CHtA,

which can arise in some discrete-time optimal control problems, can be solved using the second approach above if the matrix C has only one more row than column.

References

[edit | edit source]
  1. ^ Skellam, J.G. (1951). “Random dispersal in theoretical populations”, Biometrika 38 196−–218, eqns (41,42)
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Newth, Gerald, "World order from chaotic beginnings", Mathematical Gazette 88, March 2004, 39-45 gives a trigonometric approach.
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  7. ^ Brand, Louis, "A sequence defined by a difference equation," American Mathematical Monthly 62, September 1955, 489–492. online
  8. ^ Mitchell, Douglas W., "An analytic Riccati solution for two-target discrete-time control," Journal of Economic Dynamics and Control 24, 2000, 615–622.
  9. ^ Martin, C. F., and Ammar, G., "The geometry of the matrix Riccati equation and associated eigenvalue method," in Bittani, Laub, and Willems (eds.), The Riccati Equation, Springer-Verlag, 1991.
  10. ^ Balvers, Ronald J., and Mitchell, Douglas W., "Reducing the dimensionality of linear quadratic control problems," Journal of Economic Dynamics and Control 31, 2007, 141–159.

Further reading

[edit | edit source]
  • Simons, Stuart, "A non-linear difference equation," Mathematical Gazette 93, November 2009, 500–504.