Stability theory

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Stability theory" – news · newspapers · books · scholar · JSTOR (December 2024) (Learn how and when to remove this message)

|

Part of mathematics that addresses the stability of solutions

For the branch of model theory, see stable theory.

Stability diagram classifying Poincaré maps of linear autonomous system x ′ = A x , {\displaystyle x'=Ax,} as stable or unstable according to their features. Stability generally increases to the left of the diagram.[1] Some sink, source or node are equilibrium points.

In mathematics, stability theory addresses the stability of solutions of differential equations and of trajectories of dynamical systems under small perturbations of initial conditions. The heat equation, for example, is a stable partial differential equation because small perturbations of initial data lead to small variations in temperature at a later time as a result of the maximum principle. In partial differential equations one may measure the distances between functions using Lp norms or the sup norm, while in differential geometry one may measure the distance between spaces using the Gromov–Hausdorff distance.

In dynamical systems, an orbit is called Lyapunov stable if the forward orbit of any point is in a small enough neighborhood or it stays in a small (but perhaps, larger) neighborhood. Various criteria have been developed to prove stability or instability of an orbit. Under favorable circumstances, the question may be reduced to a well-studied problem involving eigenvalues of matrices. A more general method involves Lyapunov functions. In practice, any one of a number of different stability criteria are applied.

## Overview in dynamical systems

[edit]

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2024) (Learn how and when to remove this message)

|

Many parts of the qualitative theory of differential equations and dynamical systems deal with asymptotic properties of solutions and the trajectories—what happens with the system after a long period of time. The simplest kind of behavior is exhibited by equilibrium points, or fixed points, and by periodic orbits. If a particular orbit is well understood, it is natural to ask next whether a small change in the initial condition will lead to similar behavior. Stability theory addresses the following questions: Will a nearby orbit indefinitely stay close to a given orbit? Will it converge to the given orbit? In the former case, the orbit is called stable; in the latter case, it is called asymptotically stable and the given orbit is said to be attracting.

An equilibrium solution  f e {\displaystyle f_{e}} to an autonomous system of first order ordinary differential equations is called:

* stable if for every (small)  ϵ > 0 {\displaystyle \epsilon >0} , there exists a  δ > 0 {\displaystyle \delta >0} such that every solution  f ( t ) {\displaystyle f(t)} having initial conditions within distance  δ {\displaystyle \delta } i.e.  ‖ f ( t 0 ) − f e ‖ < δ {\displaystyle \|f(t_{0})-f_{e}\|<\delta } of the equilibrium remains within distance  ϵ {\displaystyle \epsilon } i.e.  ‖ f ( t ) − f e ‖ < ϵ {\displaystyle \|f(t)-f_{e}\|<\epsilon } for all  t ≥ t 0 {\displaystyle t\geq t_{0}} .
* asymptotically stable if it is stable and, in addition, there exists  δ 0 > 0 {\displaystyle \delta _{0}>0} such that whenever  ‖ f ( t 0 ) − f e ‖ < δ 0 {\displaystyle \|f(t_{0})-f_{e}\|<\delta _{0}} then  f ( t ) -> f e {\displaystyle f(t)\rightarrow f_{e}} as  t -> ∞ {\displaystyle t\rightarrow \infty } .

Stability means that the trajectories do not change too much under small perturbations. The opposite situation, where a nearby orbit is getting repelled from the given orbit, is also of interest. In general, perturbing the initial state in some directions results in the trajectory asymptotically approaching the given one and in other directions to the trajectory getting away from it. There may also be directions for which the behavior of the perturbed orbit is more complicated (neither converging nor escaping completely), and then stability theory does not give sufficient information about the dynamics.

One of the key ideas in stability theory is that the qualitative behavior of an orbit under perturbations can be analyzed using the linearization of the system near the orbit. In particular, at each equilibrium of a smooth dynamical system with an n-dimensional phase space, there is a certain n×n matrix A whose eigenvalues characterize the behavior of the nearby points (Hartman–Grobman theorem). More precisely, if all eigenvalues are negative real numbers or complex numbers with negative real parts then the point is a stable attracting fixed point, and the nearby points converge to it at an exponential rate, cf Lyapunov stability and exponential stability. If none of the eigenvalues are purely imaginary (or zero) then the attracting and repelling directions are related to the eigenspaces of the matrix A with eigenvalues whose real part is negative and, respectively, positive. Analogous statements are known for perturbations of more complicated orbits.

## Stability of fixed points in 2D

[edit]

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2024) (Learn how and when to remove this message)

|

Schematic visualization of 4 of the most common kinds of fixed points.

The paradigmatic case is the stability of the origin under the linear autonomous differential equation  X ˙ = A X {\displaystyle {\dot {X}}=AX} where  X = [ x y ] {\displaystyle X={\begin{bmatrix}x\\\y\end{bmatrix}}} and  A {\displaystyle A} is a 2-by-2 matrix.

We would sometimes perform change-of-basis by  X ′ = C X {\displaystyle X'=CX} for some invertible matrix  C {\displaystyle C} , which gives  X ˙ ′ = C − 1 A C X ′ {\displaystyle {\dot {X}}'=C^{-1}ACX'} . We say  C − 1 A C {\displaystyle C^{-1}AC} is " A {\displaystyle A} in the new basis". Since  det A = det C − 1 A C {\displaystyle \det A=\det C^{-1}AC} and  tr ⁡ A = tr ⁡ C − 1 A C {\displaystyle \operatorname {tr} A=\operatorname {tr} C^{-1}AC} , we can classify the stability of origin using  det A {\displaystyle \det A} and  tr ⁡ A {\displaystyle \operatorname {tr} A} , while freely using change-of-basis.

### Classification of stability types

[edit]

If  det A = 0 {\displaystyle \det A=0} , then the rank of  A {\displaystyle A} is zero or one.

* If the rank is zero, then  A = 0 {\displaystyle A=0} , and there is no flow.
* If the rank is one, then  ker ⁡ A {\displaystyle \ker A} and  im ⁡ A {\displaystyle \operatorname {im} A} are both one-dimensional.
* If  ker ⁡ A = im ⁡ A {\displaystyle \ker A=\operatorname {im} A} , then let  v {\displaystyle v} span  ker ⁡ A {\displaystyle \ker A} , and let  w {\displaystyle w} be a preimage of  v {\displaystyle v} , then in  { v , w } {\displaystyle \\{v,w\\}} basis,  A = [ 0 1 0 0 ] {\displaystyle A={\begin{bmatrix}0&1\\\0&0\end{bmatrix}}} , and so the flow is a shearing along the  v {\displaystyle v} direction. In this case,  tr ⁡ A = 0 {\displaystyle \operatorname {tr} A=0} .
* If  ker ⁡ A ≠ im ⁡ A {\displaystyle \ker A\neq \operatorname {im} A} , then let  v {\displaystyle v} span  ker ⁡ A {\displaystyle \ker A} and let  w {\displaystyle w} span  im ⁡ A {\displaystyle \operatorname {im} A} , then in  { v , w } {\displaystyle \\{v,w\\}} basis,  A = [ 0 0 0 a ] {\displaystyle A={\begin{bmatrix}0&0\\\0&a\end{bmatrix}}} for some nonzero real number  a {\displaystyle a} .
* If  tr ⁡ A > 0 {\displaystyle \operatorname {tr} A>0} , then it is unstable, diverging at a rate of  a {\displaystyle a} from  ker ⁡ A {\displaystyle \ker A} along parallel translates of  im ⁡ A {\displaystyle \operatorname {im} A} .
* If  tr ⁡ A < 0 {\displaystyle \operatorname {tr} A<0} , then it is stable, converging at a rate of  a {\displaystyle a} to  ker ⁡ A {\displaystyle \ker A} along parallel translates of  im ⁡ A {\displaystyle \operatorname {im} A} .

If  det A ≠ 0 {\displaystyle \det A\neq 0} , we first find the Jordan normal form of the matrix, to obtain a basis  { v , w } {\displaystyle \\{v,w\\}} in which  A {\displaystyle A} is one of three possible forms:

* [ a 0 0 b ] {\displaystyle {\begin{bmatrix}a&0\\\0&b\end{bmatrix}}} where  a , b ≠ 0 {\displaystyle a,b\neq 0} .
* If  a , b > 0 {\displaystyle a,b>0} , then  { 4 det A − ( tr ⁡ A ) 2 = − ( a − b ) 2 ≤ 0 det A = a b > 0 {\displaystyle {\begin{cases}4\det A-(\operatorname {tr} A)^{2}=-(a-b)^{2}\leq 0\\\\\det A=ab>0\end{cases}}} . The origin is a source, with integral curves of form  y = c x b / a {\displaystyle y=cx^{b/a}}
* Similarly for  a , b < 0 {\displaystyle a,b<0} . The origin is a sink.
* If  a > 0 > b {\displaystyle a>0>b} or  a < 0 < b {\displaystyle a<0<b} , then  det A < 0 {\displaystyle \det A<0} , and the origin is a saddle point. with integral curves of form  y = c x − | b / a | {\displaystyle y=cx^{-|b/a|}} .
* [ a 1 0 a ] {\displaystyle {\begin{bmatrix}a&1\\\0&a\end{bmatrix}}} where  a ≠ 0 {\displaystyle a\neq 0} . This can be further simplified by a change-of-basis with  C = [ 1 / a 0 0 1 ] {\displaystyle C={\begin{bmatrix}1/a&0\\\0&1\end{bmatrix}}} , after which  A = a [ 1 1 0 1 ] {\displaystyle A=a{\begin{bmatrix}1&1\\\0&1\end{bmatrix}}} . We can explicitly solve for  X ˙ = A X {\displaystyle {\dot {X}}=AX} with  A = a [ 1 1 0 1 ] {\displaystyle A=a{\begin{bmatrix}1&1\\\0&1\end{bmatrix}}} . The solution is  X ( t ) = e A t X ( 0 ) {\displaystyle X(t)=e^{At}X(0)} with  e A t = e a t [ 1 a t 0 1 ] {\displaystyle e^{At}=e^{at}{\begin{bmatrix}1&at\\\0&1\end{bmatrix}}} . This case is called the "degenerate node". The integral curves in this basis are central dilations of  x = y ln ⁡ y {\displaystyle x=y\ln y} , plus the x-axis.
* If  tr ⁡ A > 0 {\displaystyle \operatorname {tr} A>0} , then the origin is an degenerate source. Otherwise it is a degenerate sink.
* In both cases,  4 det A − ( tr ⁡ A ) 2 = 0 {\displaystyle 4\det A-(\operatorname {tr} A)^{2}=0}
* a [ cos ⁡ θ sin ⁡ θ − sin ⁡ θ cos ⁡ θ ] {\displaystyle a{\begin{bmatrix}\cos \theta &\sin \theta \\\\-\sin \theta &\cos \theta \end{bmatrix}}} where  a > 0 , θ ∈ ( − π , π ] {\displaystyle a>0,\theta \in (-\pi ,\pi ]} . In this case,  4 det A − ( tr ⁡ A ) 2 = ( 2 a sin ⁡ θ ) 2 ≥ 0 {\displaystyle 4\det A-(\operatorname {tr} A)^{2}=(2a\sin \theta )^{2}\geq 0} .
* If  θ ∈ ( − π , − π / 2 ) ∪ ( π / 2 , π ] {\displaystyle \theta \in (-\pi ,-\pi /2)\cup (\pi /2,\pi ]} , then this is a spiral sink. In this case,  { 4 det A − ( tr ⁡ A ) 2 > 0 tr ⁡ A < 0 {\displaystyle {\begin{cases}4\det A-(\operatorname {tr} A)^{2}>0\\\\\operatorname {tr} A<0\end{cases}}} . The integral lines are logarithmic spirals.
* If  θ ∈ ( − π / 2 , π / 2 ) {\displaystyle \theta \in (-\pi /2,\pi /2)} , then this is a spiral source. In this case,  { 4 det A − ( tr ⁡ A ) 2 > 0 tr ⁡ A > 0 {\displaystyle {\begin{cases}4\det A-(\operatorname {tr} A)^{2}>0\\\\\operatorname {tr} A>0\end{cases}}} . The integral lines are logarithmic spirals.
* If  θ = − π / 2 , π / 2 {\displaystyle \theta =-\pi /2,\pi /2} , then this is a rotation ("neutral stability") at a rate of  a {\displaystyle a} , moving neither towards nor away from origin. In this case,  tr ⁡ A = 0 {\displaystyle \operatorname {tr} A=0} . The integral lines are circles.

The summary is shown in the stability diagram on the right. In each case, except the case of  4 det A − ( tr ⁡ A ) 2 = 0 {\displaystyle 4\det A-(\operatorname {tr} A)^{2}=0} , the values  ( tr ⁡ A , det A ) {\displaystyle (\operatorname {tr} A,\det A)} allows unique classification of the type of flow.

For the special case of  4 det A − ( tr ⁡ A ) 2 = 0 {\displaystyle 4\det A-(\operatorname {tr} A)^{2}=0} , there are two cases that cannot be distinguished by  ( tr ⁡ A , det A ) {\displaystyle (\operatorname {tr} A,\det A)} . In both cases,  A {\displaystyle A} has only one eigenvalue, with algebraic multiplicity 2\.

* If the eigenvalue has a two-dimensional eigenspace (geometric multiplicity 2), then the system is a central node (sometimes called a "star", or "dicritical node") which is either a source (when  tr ⁡ A > 0 {\displaystyle \operatorname {tr} A>0} ) or a sink (when  tr ⁡ A < 0 {\displaystyle \operatorname {tr} A<0} ).[2]
* If it has a one-dimensional eigenspace (geometric multiplicity 1), then the system is a degenerate node (if  det A > 0 {\displaystyle \det A>0} ) or a shearing flow (if  det A = 0 {\displaystyle \det A=0} ).

### Area-preserving flow

[edit]

When  tr ⁡ A = 0 {\displaystyle \operatorname {tr} A=0} , we have  det e A t = e tr ⁡ ( A ) t = 1 {\displaystyle \det e^{At}=e^{\operatorname {tr} (A)t}=1} , so the flow is area-preserving. In this case, the type of flow is classified by  det A {\displaystyle \det A} .

* If  det A > 0 {\displaystyle \det A>0} , then it is a rotation ("neutral stability") around the origin.
* If  det A = 0 {\displaystyle \det A=0} , then it is a shearing flow.
* If  det A < 0 {\displaystyle \det A<0} , then the origin is a saddle point.

## Stability of fixed points

[edit]

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2024) (Learn how and when to remove this message)

|

The simplest kind of an orbit is a fixed point, or an equilibrium. If a mechanical system is in a stable equilibrium state then a small push will result in a localized motion, for example, small oscillations as in the case of a pendulum. In a system with damping, a stable equilibrium state is moreover asymptotically stable. On the other hand, for an unstable equilibrium, such as a ball resting on a top of a hill, certain small pushes will result in a motion with a large amplitude that may or may not converge to the original state.

There are useful tests of stability for the case of a linear system. Stability of a nonlinear system can often be inferred from the stability of its linearization.

### Maps

[edit]

Let f: R → R be a continuously differentiable function with a fixed point a, f(a) = a. Consider the dynamical system obtained by iterating the function f:

x n + 1 = f ( x n ) , n = 0 , 1 , 2 , … . {\displaystyle x_{n+1}=f(x_{n}),\quad n=0,1,2,\ldots .}

The fixed point a is stable if the absolute value of the derivative of f at a is strictly less than 1, and unstable if it is strictly greater than 1. This is because near the point a, the function f has a linear approximation with slope f'(a):

f ( x ) ≈ f ( a ) + f ′ ( a ) ( x − a ) . {\displaystyle f(x)\approx f(a)+f'(a)(x-a).}

Thus

x n + 1 − a = f ( x n ) − a ≈ f ( a ) + f ′ ( a ) ( x n − a ) − a = a + f ′ ( a ) ( x n − a ) − a {\displaystyle {\begin{aligned}x_{n+1}-a&=f(x_{n})-a\\\&\approx f(a)+f'(a)(x_{n}-a)-a\\\&=a+f'(a)(x_{n}-a)-a\end{aligned}}}
⇒ f ′ ( a ) ≈ x n + 1 − a x n − a {\displaystyle \Rightarrow f'(a)\approx {\frac {x_{n+1}-a}{x_{n}-a}}}

which means that the derivative measures the rate at which the successive iterates approach the fixed point a or diverge from it. If the derivative at a is exactly 1 or −1, then more information is needed in order to decide stability.

There is an analogous criterion for a continuously differentiable map f: Rn → Rn with a fixed point a, expressed in terms of its Jacobian matrix at a, Ja(f). If all eigenvalues of J are real or complex numbers with absolute value strictly less than 1 then a is a stable fixed point; if at least one of them has absolute value strictly greater than 1 then a is unstable. Just as for n=1, the case of the largest absolute value being 1 needs to be investigated further — the Jacobian matrix test is inconclusive. The same criterion holds more generally for diffeomorphisms of a smooth manifold.

### Linear autonomous systems

[edit]

The stability of fixed points of a system of constant coefficient linear differential equations of first order can be analyzed using the eigenvalues of the corresponding matrix.

An autonomous system

x ′ = A x , {\displaystyle x'=Ax,}

where x(t) ∈ Rn and A is an n×n matrix with real entries, has a constant solution

x ( t ) = 0. {\displaystyle x(t)=0.}

(In a different language, the origin 0 ∈ Rn is an equilibrium point of the corresponding dynamical system.) This solution is asymptotically stable as t → ∞ ("in the future") if and only if for all eigenvalues λ of A, Re(λ) < 0. Similarly, it is asymptotically stable as t → −∞ ("in the past") if and only if for all eigenvalues λ of A, Re(λ) > 0. If there exists an eigenvalue λ of A with Re(λ) > 0 then the solution is unstable for t → ∞.

Application of this result in practice, in order to decide the stability of the origin for a linear system, is facilitated by the Routh–Hurwitz stability criterion. The eigenvalues of a matrix are the roots of its characteristic polynomial. A polynomial in one variable with real coefficients is called a Hurwitz polynomial if the real parts of all roots are strictly negative. The Routh–Hurwitz theorem implies a characterization of Hurwitz polynomials by means of an algorithm that avoids computing the roots.

### Non-linear autonomous systems

[edit]

Asymptotic stability of fixed points of a non-linear system can often be established using the Hartman–Grobman theorem.

Suppose that v is a C1-vector field in Rn which vanishes at a point p, v(p) = 0. Then the corresponding autonomous system

x ′ = v ( x ) {\displaystyle x'=v(x)}

has a constant solution

x ( t ) = p . {\displaystyle x(t)=p.}

Let Jp(v) be the n×n Jacobian matrix of the vector field v at the point p. If all eigenvalues of J have strictly negative real part then the solution is asymptotically stable. This condition can be tested using the Routh–Hurwitz criterion.

## Lyapunov function for general dynamical systems

[edit]

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2024) (Learn how and when to remove this message)

|

Main article: Lyapunov function

A general way to establish Lyapunov stability or asymptotic stability of a dynamical system is by means of Lyapunov functions.

## See also

[edit]

* Chaos theory
* Ship stability
* Lyapunov stability
* Hyperstability
* Linear stability
* Orbital stability
* Stability criterion
* Stability radius
* Structural stability
* von Neumann stability analysis

## References

[edit]

1. ^ Egwald Mathematics - Linear Algebra: Systems of Linear Differential Equations: Linear Stability Analysis Accessed 10 October 2019.
2. ^ "Node - Encyclopedia of Mathematics". encyclopediaofmath.org. Retrieved 2023-03-30.

* Philip Holmes and Eric T. Shea-Brown (ed.). "Stability". Scholarpedia.

## External links

[edit]

* Stable Equilibria by Michael Schreiber, The Wolfram Demonstrations Project.

* v
* t
* e

Chaos theory

Concepts|

Core

* Attractor
* Bifurcation
* Fractal
* Limit set
* Lyapunov exponent
* Orbit
* Periodic point
* Phase space

|

* Anosov diffeomorphism
* Arnold tongue
* axiom A dynamical system
* Bifurcation diagram
* Box-counting dimension
* Correlation dimension
* Conservative system
* Ergodicity
* False nearest neighbors
* Hausdorff dimension
* Invariant measure
* Lyapunov stability
* Measure-preserving dynamical system
* Mixing
* Poincaré section
* Recurrence plot
* SRB measure
* Stable manifold
* Topological conjugacy

Theorems

* Ergodic theorem
* Liouville's theorem
* Krylov–Bogolyubov theorem
* Poincaré–Bendixson theorem
* Poincaré recurrence theorem
* Stable manifold theorem
* Takens's theorem

Theoretical
branches|

* Bifurcation theory
* Control of chaos
* Dynamical system
* Ergodic theory
* Quantum chaos
* Stability theory
* Synchronization of chaos

Chaotic
maps (list)|

Discrete

* Arnold's cat map
* Baker's map
* Complex quadratic map
* Coupled map lattice
* Duffing map
* Dyadic transformation
* Dynamical billiards
* outer
* Exponential map
* Gauss map
* Gingerbreadman map
* Hénon map
* Horseshoe map
* Ikeda map
* Interval exchange map
* Irrational rotation
* Kaplan–Yorke map
* Langton's ant
* Logistic map
* Standard map
* Tent map
* Tinkerbell map
* Zaslavskii map

|

Continuous

* Double scroll attractor
* Duffing equation
* Lorenz system
* Lotka–Volterra equations
* Mackey–Glass equations
* Rabinovich–Fabrikant equations
* Rössler attractor
* Three-body problem
* Van der Pol oscillator

Physical
systems|

* Chua's circuit
* Convection
* Double pendulum
* Elastic pendulum
* FPUT problem
* Hénon–Heiles system
* Kicked rotator
* Multiscroll attractor
* Population dynamics
* Swinging Atwood's machine
* Tilt-A-Whirl
* Weather

Chaos
theorists|

* Michael Berry
* Rufus Bowen
* Mary Cartwright
* Chen Guanrong
* Leon O. Chua
* Mitchell Feigenbaum
* Peter Grassberger
* Celso Grebogi
* Martin Gutzwiller
* Brosl Hasslacher
* Michel Hénon
* Svetlana Jitomirskaya
* Bryna Kra
* Edward Norton Lorenz
* Aleksandr Lyapunov
* Benoît Mandelbrot
* Hee Oh
* Edward Ott
* Henri Poincaré
* Itamar Procaccia
* Mary Rees
* Otto Rössler
* David Ruelle
* Caroline Series
* Yakov Sinai
* Oleksandr Mykolayovych Sharkovsky
* Nina Snaith
* Floris Takens
* Audrey Terras
* Mary Tsingou
* Marcelo Viana
* Amie Wilkinson
* James A. Yorke
* Lai-Sang Young

Related
articles|

* Butterfly effect
* Complexity
* Edge of chaos
* Predictability
* Santa Fe Institute

Authority control databases: National |

* Czech Republic

|

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template