What is the relationship between stability and the derivative of a fixed point?

Click For Summary
SUMMARY

The stability of a fixed point in dynamic systems is determined by the condition |f'(a)| < 1, where f is the function iterating to the fixed point a. The discussion explores a more complex dynamic system defined as x_{n+1} = x_n + λ(f(x_n, x_{n-1}) - f(x_{n-1}, x_{n-2})), which incorporates multiple previous points. The stability condition for this system is derived from the Jacobian matrix, where stability is achieved if |λ ∂f/∂y(ȳ, ȳ)| < 1. The conversation also references the use of Bifurcation diagrams and linear higher-order difference equations to analyze stability.

PREREQUISITES
  • Understanding of fixed points in dynamic systems
  • Familiarity with Jacobian matrices and their role in stability analysis
  • Knowledge of partial derivatives and their computation
  • Basic concepts of Bifurcation theory in dynamical systems
NEXT STEPS
  • Study the properties of Bifurcation diagrams in dynamic systems
  • Learn about linear higher-order difference equations and their stability conditions
  • Explore Elaydi's "Intro to Difference Equations" for a comprehensive understanding
  • Investigate numerical methods for simulating dynamic systems with multiple previous points
USEFUL FOR

Mathematicians, researchers in dynamical systems, and anyone involved in stability analysis of complex iterative functions.

smehdi
Messages
16
Reaction score
0
Dear friends,

I want to find the conditions of stability of a fixed point. consider the function "f" iterates to obtain fixed point "a":
x_{n+1}= f(x_n)

for this dynamic system, the fixed point "a" is stable if we have:
|f ^{\prime}(a)| &lt; 1

Currently I'm working on a bit different dynamic system that made me confused to determine the stability conditions for an arbitrary point, say "a". This dynamic system is:

x_{n+1}= x_n + \lambda \left( f(x_n, x_{n-1}) - f(x_{n-1}, x_{n-2})\right).

this system is not only related to time "n", but also related to times "n-1" and "n-2".

Can anybody help me or give me clue to find the conditions?

suppose f(x_n)= c * x_n + d* x_{n-1}
 
Last edited:
Physics news on Phys.org
For me, it seems the problem lies in defining stability of a fixed point for a function that is a function of times before "n", like, in your case, "n-1" and "n-2".

For a function that is a function only of the previous value of x, a fixed point a is said stable if, for a given initial condition x_0 near a, x_1 is nearer of a than x_0 (and x_2 is nearer of a than x_1 and so on).

Writing "near" and "nearer" as matemathical expressions leads to the condition |f^{&#039;}(a)&lt;1|.

But how to do the same thing for a function that is a function of several previous points? In your case, the first point we would be able to calculate is the point x_3, as it is a function of x_2, x_1 and x_0, and they must be given as initial conditions.

How would we say that all this initial conditions are "near" the fixed point, so the following points (x_4, x_5, etc) are "nearer"?

Should we say that x_2=x_1=x_0, x_0 being near to a and derive some condition from there?

Should we say that |x_2-a|&lt;|x_1-a|&lt;|x_0-a|?

Should we say that x_2, x_1 and x_0 are arbitrary, but all of them are "near" a?

I don't know, and so i can't give an answer. But at least i think i understand the problem you posed.
 
Last edited:
Dear coelho,
Really thanks for reply.
The big problem is that this function is a function of several previous points!

For this function suppose that we have x_1 , x_2, x_3 near a and also |x_2−a|&lt;|x_1−a|&lt;|x_0−a|, i.e., different points are get closer and closer to the final point a. I want to find a general rule for stability of this function.

What do you think about "Bifurcation diagram"?

I don't know Bifurcation diagram exactly and I'm not sure if Bifurcation diagram can help me to analyze the stability of this function.
 
Your equation, with your given f, is linear. There exists a well developed theory of linear higher order difference equations, very similar to that of ode's. The equation can actually be solved exactly. The bottom line is that any solution is stable if the roots of the characteristic equation are all less than 1 in magnitude. Stable in this sense means either a stable fixed point or a stable orbit. I found a good little tutorial to get you started:

http://www.economics.utoronto.ca/osborne/MathTutorial/SODF.HTM

What you quickly realize is that linear equations are rather boring. They can't do much. Change your parameters and you can get a change of stability, not much else. If you change your function f so that the equation is non-linear then you can get all sorts of interesting things but I know of no general result for higher order non-linear equations. Typically you would write code to play with it and get a feel for it first, then look at it more.
 
Dear alan,

Thanks for this useful link. The link you mentioned belongs to prof. Osborne and the interesting point is that currently I'm working on game theory and my function "f", is for a dynamic game! This link seems pretty good. Really thanks.

Thank you friends. I'm following your comments and notes.
 
You're welcome. Elaydi's "Intro to Difference Equations" is very thorough yet readable if you need more. If you google it you can find a downloadable pdf of the whole book.
 
smehdi said:
Currently I'm working on a bit different dynamic system that made me confused to determine the stability conditions for an arbitrary point, say "a". This dynamic system is:

x_{n+1}= x_n + \lambda \left( f(x_n, x_{n-1}) - f(x_{n-1}, x_{n-2})\right).

this system is not only related to time "n", but also related to times "n-1" and "n-2".

Can anybody help me or give me clue to find the conditions?

Here, your difference equation is of order 3 (it connects 3 consequtive values of the series \lbrace x_n \rbrace. It is equivalent to the following system of 3 simultaneous equations of order 1:
<br /> \left\lbrace \begin{array}{rcl}<br /> x_{n + 1} &amp; = &amp; x_n + \lambda \, \left( f(x_n, y_n) - f(y_n, z_n) \right) \equiv F(x_n, y_n, z_n) \\<br /> <br /> y_{n + 1} &amp; = &amp; x_n \equiv G(x_n, y_n, z_n) \\<br /> <br /> z_{n + 1} &amp; = &amp; y_n \equiv H(x_n, y_n, z_n)<br /> \end{array} \right.<br />

A point (\bar{x}, \bar{y}, \bar{z}) is fixed for this system when:
<br /> \left\lbrace \begin{array}{rcl}<br /> \bar{x} &amp; = &amp; \bar{x} + \lambda \, \left( f(\bar{x}, \bar{y}) - f(\bar{y}, \bar{z}) \right) \\<br /> <br /> \bar{y} &amp; = &amp; \bar{x} \\<br /> <br /> \bar{z} &amp; = &amp; \bar{y}<br /> \end{array} \right. \Leftrightarrow \bar{x} = \bar{x} + \lambda \, \left( f(\bar{x}, \bar{x}) - f(\bar{x}, \bar{x}) \right)<br />
which is always satisfied!

The Jacobian of this system is:
<br /> \frac{\partial(F, G, H)}{\partial(x, y, z)} = \left| \begin{array}{ccc}<br /> 1 + \lambda \, \frac{\partial f}{\partial x}(x, y) &amp; \lambda \, \left( \frac{\partial f}{\partial y}(x, y) - \frac{\partial f}{\partial x}(y, z) \right) &amp; -\lambda \, \frac{\partial f}{\partial y}(y, z) \\<br /> <br /> 1 &amp; 0 &amp; 0 \\<br /> <br /> 0 &amp; 1 &amp; 0<br /> \end{array}\right| = - \lambda \, \frac{\partial f}{\partial y}(y, z)<br />

The fixed point is stable if the absolute value of this Jacobian is zero. In your case, whenever:
<br /> \vert \lambda \, \frac{\partial f}{\partial y}(\bar{x}, \bar{x}) \vert &lt; 1<br />
 
Thanks Dickfore. I owe you big time!

When you said:
Dickfore said:
A point (\bar{x}, \bar{y}, \bar{z}) is fixed for this system when:
<br /> \left\lbrace \begin{array}{rcl}<br /> \bar{x} &amp; = &amp; \bar{x} + \lambda \, \left( f(\bar{x}, \bar{y}) - f(\bar{y}, \bar{z}) \right) \\<br /> <br /> \bar{y} &amp; = &amp; \bar{x} \\<br /> <br /> \bar{z} &amp; = &amp; \bar{y}<br /> \end{array} \right. \Leftrightarrow \bar{x} = \bar{x} + \lambda \, \left( f(\bar{x}, \bar{x}) - f(\bar{x}, \bar{x}) \right)<br />
which is always satisfied!

You mean this system always has a fixed point?

And this point is stable if we have the last condition (which is calculated based on Jacobian matrix)?
 
Yes, I mean every x is a fixed point of the system. Try it! And yes, when the derivative of f w.r.t. the second variable is smaller by absolute value than 1/|lambda|.
 
  • #10
Dear Dickfore, another question. In the last condition:
Dickfore said:
The fixed point is stable if the absolute value of this Jacobian is zero. In your case, whenever:
<br /> \vert \lambda \, \frac{\partial f}{\partial y}(\bar{x}, \bar{x}) \vert &lt; 1<br />

the function f depends on \hat{x}, but how to calculate derivative respect to y? I think the last condition can be written as the following condition too:
<br /> \vert \lambda \, \frac{\partial f}{\partial x}(\bar{x}, \bar{x}) \vert &lt; 1<br />
am I right?
 
  • #11
No:

<br /> \frac{\partial f}{\partial y}(x, x)<br />
means you calculate the partial derivative of f w.r.t. to the second argument which you call y, and, after the differentiation you substitute y = x.

This is quite different from substituting y = x in f, after which you get another function of x only:
<br /> f(x, y = x) \equiv g(x)<br />
and then to evaluate the derivative w.r.t. x.
 

Similar threads

  • · Replies 16 ·
Replies
16
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 65 ·
3
Replies
65
Views
8K
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K