The Central Idea

A nonlinear system may be complicated globally but nearly linear when viewed sufficiently close to an equilibrium.

The strategy is:

\[ \boxed{ \text{nonlinear system near an equilibrium} \approx \text{linear system} } \]

We then study the linear system using matrices, eigenvalues, and eigenvectors.

Why Linearization Works

The idea comes from linear approximation in calculus.

For a differentiable function \(f(x)\), near \(x=a\),

\[ f(x) \approx f(a)+f'(a)(x-a). \]

The derivative provides the best first-order approximation to the function near the reference point.

Dynamical-systems linearization applies the same idea to evolution laws.

One-Dimensional Continuous Systems

Consider

\[ \frac{dx}{dt}=f(x) \]

with equilibrium

\[ f(x^\ast)=0. \]

Near \(x^\ast\),

\[ f(x) \approx f(x^\ast)+f'(x^\ast)(x-x^\ast). \]

Since

\[ f(x^\ast)=0, \]

we obtain

\[ \boxed{ f(x) \approx f'(x^\ast)(x-x^\ast) }. \]

Introduce a Perturbation Variable

Let

\[ u=x-x^\ast. \]

Then

\[ x=x^\ast+u. \]

Because \(x^\ast\) is constant,

\[ \frac{du}{dt} = \frac{dx}{dt}. \]

The local dynamics become

\[ \boxed{ \frac{du}{dt} \approx f'(x^\ast)u }. \]

The Local Linear Model

The linearized equation

\[ u'=f'(x^\ast)u \]

has solution

\[ u(t)=u_0e^{f'(x^\ast)t}. \]

Therefore:

Example: Linearizing a Nonlinear Scalar System

Consider

\[ x'=x-x^3. \]

The equilibria satisfy

\[ x-x^3=0. \]

Factor:

\[ x(1-x^2)=0. \]

Therefore,

\[ x^\ast=-1,\quad0,\quad1. \]

Linearization at \(x^\ast=0\)

Let

\[ f(x)=x-x^3. \]

Then

\[ f'(x)=1-3x^2. \]

At

\[ x^\ast=0, \]

we have

\[ f'(0)=1. \]

Thus the local perturbation equation is

\[ \boxed{u'=u}. \]

Perturbations grow, so the equilibrium is unstable.

Linearization at \(x^\ast=1\)

At

\[ x^\ast=1, \]

we obtain

\[ f'(1)=1-3=-2. \]

The linearized equation is

\[ \boxed{u'=-2u}. \]

Since perturbations decay exponentially, \(x^\ast=1\) is locally asymptotically stable.

Linearization at \(x^\ast=-1\)

At

\[ x^\ast=-1, \]

we again have

\[ f'(-1)=-2. \]

Therefore,

\[ u'=-2u. \]

The equilibrium \(x^\ast=-1\) is also locally asymptotically stable.

Discrete Linearization

For a discrete system

\[ x_{n+1}=f(x_n) \]

with fixed point

\[ f(x^\ast)=x^\ast, \]

write

\[ x_n=x^\ast+u_n. \]

Then

\[ u_{n+1} \approx f'(x^\ast)u_n. \]

The Discrete Local Multiplier

The quantity

\[ \boxed{f'(x^\ast)} \]

is the local multiplier.

Iterating the linearized perturbation gives

\[ u_n \approx [f'(x^\ast)]^n u_0. \]

Therefore:

Example: Discrete Nonlinear Map

Consider

\[ x_{n+1}=x_n^2. \]

The fixed points satisfy

\[ x^\ast=(x^\ast)^2, \]

so

\[ x^\ast=0 \qquad\text{or}\qquad x^\ast=1. \]

Since

\[ f'(x)=2x, \]

the local multipliers are easy to evaluate.

Classifying the Discrete Fixed Points

At

\[ x^\ast=0, \]

we have

\[ f'(0)=0. \]

Since

\[ |0|<1, \]

the fixed point is locally asymptotically stable.

At

\[ x^\ast=1, \]

we have

\[ f'(1)=2. \]

Therefore \(x^\ast=1\) is unstable.

Multivariable Linear Approximation

Now consider a system

\[ \mathbf{x}'=\mathbf{F}(\mathbf{x}), \]

where

\[ \mathbf{x}\in\mathbb{R}^m. \]

Near an equilibrium \(\mathbf{x}^\ast\),

\[ \mathbf{F}(\mathbf{x}) \approx \mathbf{F}(\mathbf{x}^\ast) + D\mathbf{F}(\mathbf{x}^\ast) (\mathbf{x}-\mathbf{x}^\ast). \]

Since

\[ \mathbf{F}(\mathbf{x}^\ast)=\mathbf{0}, \]

only the derivative matrix remains.

The Jacobian Matrix

The derivative matrix of a vector-valued function is called the Jacobian matrix.

For

\[ \mathbf{F}(x,y)= \begin{pmatrix} f(x,y)\\ g(x,y) \end{pmatrix}, \]

the Jacobian is

\[ \boxed{ J(x,y) = \begin{pmatrix} \dfrac{\partial f}{\partial x} & \dfrac{\partial f}{\partial y} \\ \dfrac{\partial g}{\partial x} & \dfrac{\partial g}{\partial y} \end{pmatrix} }. \]

The Linearized Vector System

Define the perturbation

\[ \mathbf{u} = \mathbf{x}-\mathbf{x}^\ast. \]

Near the equilibrium,

\[ \boxed{ \mathbf{u}' \approx J(\mathbf{x}^\ast)\mathbf{u} }. \]

The nonlinear system has therefore been replaced locally by a linear system whose matrix is the Jacobian evaluated at the equilibrium.

Why the Jacobian Matters

The Jacobian records how each component of the vector field changes with respect to each state variable.

Near an equilibrium, those partial derivatives determine the first-order response to small perturbations.

Eigenvalues and eigenvectors of the Jacobian then reveal local rates, directions, contraction, expansion, and rotation.

Example: Computing a Jacobian

Consider

\[ \begin{aligned} x'&=x-x^2-xy,\\ y'&=-y+xy. \end{aligned} \]

Define

\[ f(x,y)=x-x^2-xy \]

and

\[ g(x,y)=-y+xy. \]

We compute the four required partial derivatives.

Jacobian of the Example

The partial derivatives are

\[ \frac{\partial f}{\partial x} = 1-2x-y, \] \[ \frac{\partial f}{\partial y} = -x, \] \[ \frac{\partial g}{\partial x} = y, \] \[ \frac{\partial g}{\partial y} = -1+x. \]

Therefore,

\[ \boxed{ J(x,y)= \begin{pmatrix} 1-2x-y & -x\\ y & -1+x \end{pmatrix} }. \]

Find the Equilibria First

Linearization is performed around an equilibrium, so the equilibrium must be found before evaluating the Jacobian.

For

\[ x'=x-x^2-xy, \] \[ y'=-y+xy, \]

equilibrium requires

\[ x(1-x-y)=0 \]

and

\[ y(x-1)=0. \]

Equilibria of the Example

From

\[ y(x-1)=0, \]

either

\[ y=0 \]

or

\[ x=1. \]

Combining with

\[ x(1-x-y)=0 \]

gives the equilibria

\[ \boxed{(0,0)} \]

and

\[ \boxed{(1,0)}. \]

Linearization at \((0,0)\)

Evaluate

\[ J(x,y)= \begin{pmatrix} 1-2x-y & -x\\ y & -1+x \end{pmatrix} \]

at

\[ (0,0). \]

We obtain

\[ J(0,0) = \begin{pmatrix} 1 & 0\\ 0 & -1 \end{pmatrix}. \]

The eigenvalues are

\[ \lambda_1=1, \qquad \lambda_2=-1. \]

Interpretation at \((0,0)\)

One eigenvalue is positive and one is negative.

Therefore the linearized system has one expanding direction and one contracting direction.

The equilibrium is locally a

\[ \boxed{\text{saddle}}. \]

Because the eigenvalues have nonzero real parts, the nonlinear system has the same basic local saddle character.

Linearization at \((1,0)\)

Evaluate the Jacobian at

\[ (1,0). \]

We obtain

\[ J(1,0) = \begin{pmatrix} -1 & -1\\ 0 & 0 \end{pmatrix}. \]

Its eigenvalues are

\[ \lambda_1=-1, \qquad \lambda_2=0. \]

The zero eigenvalue means the standard first-order classification is inconclusive.

Hyperbolic Equilibria

A continuous-time equilibrium is called hyperbolic when no eigenvalue of the Jacobian has zero real part.

Thus,

\[ \boxed{ \operatorname{Re}(\lambda_i)\ne0 \quad\text{for every }i } \]

is the hyperbolicity condition for a continuous system.

Why Hyperbolicity Is Important

At a hyperbolic equilibrium, the local nonlinear dynamics generally have the same qualitative structure as the linearized system.

Nodes remain node-like, saddles remain saddle-like, and spiraling attraction or repulsion is preserved locally.

This is one of the central reasons linearization is so powerful.

Hartman-Grobman Idea

The Hartman-Grobman theorem formalizes the local relationship between a nonlinear system and its linearization near a hyperbolic equilibrium.

Informally,

\[ \boxed{ \text{hyperbolic nonlinear equilibrium} \sim \text{its linearized phase portrait locally} } \]

The trajectories need not be identical, but their local qualitative organization is preserved.

Nonhyperbolic Equilibria

An equilibrium is nonhyperbolic when at least one continuous-time eigenvalue has zero real part.

Examples include

\[ \lambda=0 \]

and

\[ \lambda=\pm i\omega. \]

In such cases, nonlinear terms that were discarded during linearization may determine the actual behavior.

Example: Linearization Can Be Inconclusive

Consider

\[ x'=-x^3. \]

The equilibrium is

\[ x^\ast=0. \]

Since

\[ f'(0)=0, \]

the linearized equation is

\[ u'=0. \]

This approximation does not reveal the true asymptotic stability of the nonlinear system.

Why Higher-Order Terms Matter

Near \(x=0\),

\[ -x^3 \]

is smaller than a typical linear term, but if the linear term vanishes, the cubic term becomes the leading contribution.

Thus a term that normally looks negligible can become decisive when first-order information disappears.

Continuous Linearization Classification

For a two-dimensional continuous system with Jacobian eigenvalues \(\lambda_1,\lambda_2\):

Discrete Multivariable Linearization

Consider a discrete nonlinear system

\[ \mathbf{x}_{n+1} = \mathbf{F}(\mathbf{x}_n). \]

Let \(\mathbf{x}^\ast\) satisfy

\[ \mathbf{F}(\mathbf{x}^\ast)=\mathbf{x}^\ast. \]

With

\[ \mathbf{u}_n = \mathbf{x}_n-\mathbf{x}^\ast, \]

the local approximation is

\[ \boxed{ \mathbf{u}_{n+1} \approx J(\mathbf{x}^\ast)\mathbf{u}_n }. \]

Discrete Eigenvalue Criterion

For the linearized discrete system,

\[ \mathbf{u}_{n+1}=A\mathbf{u}_n, \]

stability is controlled by eigenvalue magnitudes.

Hyperbolicity in Discrete Time

A discrete fixed point is hyperbolic when no eigenvalue of the Jacobian lies on the unit circle.

\[ \boxed{ |\lambda_i|\ne1 \quad\text{for every }i } \]

The unit circle is therefore the critical stability boundary for discrete linearization.

Stable and Unstable Subspaces

Eigenvectors associated with contracting eigenvalues span locally stable directions.

Eigenvectors associated with expanding eigenvalues span locally unstable directions.

These linear subspaces provide first approximations to stable and unstable manifolds of nonlinear systems.

Example: Continuous Saddle Directions

Suppose the Jacobian at an equilibrium is

\[ J= \begin{pmatrix} -2 & 0\\ 0 & 3 \end{pmatrix}. \]

The eigenvalue

\[ -2 \]

corresponds to contraction, while

\[ 3 \]

corresponds to expansion.

The associated eigenvectors identify the stable and unstable local directions.

Example: Spiral Linearization

Suppose

\[ J= \begin{pmatrix} -1 & -2\\ 2 & -1 \end{pmatrix}. \]

The eigenvalues are

\[ \lambda=-1\pm2i. \]

The negative real part causes contraction.

The imaginary part produces rotation.

Therefore the local phase portrait is a stable spiral.

Trace and Determinant

For a two-dimensional matrix

\[ A= \begin{pmatrix} a & b\\ c & d \end{pmatrix}, \]

define the trace

\[ \tau=\operatorname{tr}(A)=a+d \]

and determinant

\[ \Delta=\det(A)=ad-bc. \]

These quantities help classify two-dimensional linearizations.

Characteristic Equation

The eigenvalues satisfy

\[ \lambda^2-\tau\lambda+\Delta=0. \]

Therefore,

\[ \boxed{ \lambda = \frac{\tau\pm\sqrt{\tau^2-4\Delta}}{2} }. \]

The discriminant

\[ \tau^2-4\Delta \]

determines whether the eigenvalues are real or complex.

Trace-Determinant Classification

For a continuous two-dimensional linearization:

Boundary cases require additional care.

Example: Trace and Determinant

Suppose

\[ J= \begin{pmatrix} -3 & 1\\ -2 & -2 \end{pmatrix}. \]

Then

\[ \tau=-5 \]

and

\[ \Delta=8. \]

The discriminant is

\[ \tau^2-4\Delta = 25-32=-7. \]

The eigenvalues are complex with negative real part, indicating a stable spiral.

Linearization Is Local

A linearized system describes behavior near the equilibrium.

It does not automatically describe the entire state space.

A nonlinear system may have:

None of these global structures is guaranteed to be captured by one local linearization.

Local versus Global Approximation

The approximation

\[ \mathbf{F}(\mathbf{x}) \approx J(\mathbf{x}^\ast) (\mathbf{x}-\mathbf{x}^\ast) \]

becomes better as

\[ \mathbf{x}\to\mathbf{x}^\ast. \]

Far from the equilibrium, higher-order nonlinear terms may dominate and produce very different behavior.

Linearization and Phase Portraits

Near a hyperbolic equilibrium, the eigenstructure of the Jacobian provides a local template for the nonlinear phase portrait.

It predicts whether nearby trajectories:

Linearization and Timescales

Eigenvalues also reveal local rates of motion.

A mode with

\[ \lambda=-10 \]

decays much faster than one with

\[ \lambda=-0.1. \]

Systems with very different eigenvalue magnitudes may contain multiple characteristic timescales.

Fast and Slow Directions

Suppose a stable linearization has eigenvalues

\[ \lambda_1=-1 \]

and

\[ \lambda_2=-100. \]

Motion associated with \(\lambda_2\) decays much more rapidly.

After a short transient, the slower \(\lambda_1\)-direction may dominate the visible trajectory.

Linearization and Parameter Changes

The Jacobian itself may depend on a parameter.

As that parameter changes, an eigenvalue may cross a stability boundary.

In continuous time, important boundaries include

\[ \operatorname{Re}(\lambda)=0. \]

In discrete time, the corresponding boundary is

\[ |\lambda|=1. \]

Such crossings are often associated with bifurcations.

Example: Parameter-Dependent Scalar System

Consider

\[ x'=\mu x-x^3. \]

The equilibrium

\[ x^\ast=0 \]

exists for every \(\mu\).

Since

\[ f'(x)=\mu-3x^2, \]

the linearization at zero is

\[ \boxed{u'=\mu u}. \]

Stability Changes at a Critical Parameter

For

\[ u'=\mu u, \]

the equilibrium is locally stable when

\[ \mu<0 \]

and unstable when

\[ \mu>0. \]

At

\[ \mu=0, \]

the linearization becomes nonhyperbolic.

This signals that a qualitative change may occur.

Linearization and Control

In control systems, nonlinear plant dynamics are often linearized near a desired operating point.

The resulting local model can be used to:

The controller must still be interpreted within the region where the linear approximation is valid.

Linearization in Mechanical Systems

Mechanical systems often contain nonlinear force laws.

Near an equilibrium configuration, those forces can frequently be approximated by their first derivatives.

This produces linear oscillators, damped systems, or coupled matrix models that approximate small motions.

Small-Angle Pendulum as a Familiar Example

The nonlinear pendulum equation is

\[ \theta'' + \frac{g}{L}\sin\theta = 0. \]

Near

\[ \theta=0, \]

we use

\[ \sin\theta\approx\theta. \]

The linearized equation becomes

\[ \boxed{ \theta'' + \frac{g}{L}\theta = 0 }. \]

This approximation is accurate for sufficiently small angular displacements.

Common Error: Linearizing Before Finding the Equilibrium

The Jacobian can be computed anywhere, but local equilibrium classification requires evaluating it at an equilibrium.

The correct workflow is:

\[ \boxed{ \text{find equilibrium} \rightarrow \text{compute Jacobian} \rightarrow \text{evaluate Jacobian} \rightarrow \text{analyze eigenvalues} }. \]

Common Error: Forgetting to Shift the Equilibrium

If an equilibrium is

\[ x^\ast\ne0, \]

the natural perturbation is

\[ u=x-x^\ast. \]

Linearization describes deviations from the equilibrium, not necessarily the original coordinate itself.

Common Error: Treating Linearization as Exact

A nonlinear system and its linearization are generally not identical.

The linearization neglects second-order and higher terms.

It should therefore be interpreted as a local approximation, not an exact global replacement.

Common Error: Trusting a Nonhyperbolic Linearization Too Far

If a continuous Jacobian has an eigenvalue with zero real part, or a discrete Jacobian has an eigenvalue on the unit circle, first-order classification may fail.

Higher-order nonlinear terms may decide stability, periodic behavior, or bifurcation structure.

Common Error: Using Continuous Eigenvalue Rules for Discrete Systems

In continuous time, stability is linked to negative eigenvalue real parts.

In discrete time, stability is linked to eigenvalue magnitudes less than \(1\).

Thus

\[ \lambda=-2 \]

is stable for the scalar continuous equation

\[ u'=-2u, \]

but unstable for the scalar discrete update

\[ u_{n+1}=-2u_n. \]

Common Error: Ignoring the Model Domain

A locally valid mathematical trajectory may extend into states that are not meaningful for the application.

Population, concentration, financial, and physical models often impose constraints such as

\[ x\ge0. \]

Linearized conclusions should be interpreted within the admissible state space.

A Reliable Procedure for One-Dimensional Linearization

  1. Write the dynamical equation.
  2. Find all equilibria.
  3. Choose one equilibrium \(x^\ast\).
  4. Compute \(f'(x)\).
  5. Evaluate \(f'(x^\ast)\).
  6. Introduce \(u=x-x^\ast\).
  7. Write the local linear equation \(u'=f'(x^\ast)u\) or \(u_{n+1}=f'(x^\ast)u_n\).
  8. Classify the local behavior.
  9. If the linear coefficient lies on a critical boundary, use higher-order analysis.

A Reliable Procedure for Continuous Vector Systems

  1. Write \(\mathbf{x}'=\mathbf{F}(\mathbf{x})\).
  2. Find every equilibrium \(\mathbf{x}^\ast\).
  3. Compute the Jacobian \(J(\mathbf{x})\).
  4. Evaluate \(J(\mathbf{x}^\ast)\).
  5. Compute its eigenvalues and, when useful, eigenvectors.
  6. Determine whether the equilibrium is hyperbolic.
  7. Classify the local linear phase portrait.
  8. Transfer that qualitative classification to the nonlinear system when justified.
  9. Use nonlinear methods when the equilibrium is nonhyperbolic.

A Reliable Procedure for Discrete Vector Systems

  1. Write \(\mathbf{x}_{n+1}=\mathbf{F}(\mathbf{x}_n)\).
  2. Find fixed points from \(\mathbf{F}(\mathbf{x}^\ast)=\mathbf{x}^\ast\).
  3. Compute the Jacobian of \(\mathbf{F}\).
  4. Evaluate it at the fixed point.
  5. Compute the eigenvalues.
  6. Compare every eigenvalue magnitude with \(1\).
  7. Classify contracting and expanding directions.
  8. Use additional analysis when eigenvalues lie on the unit circle.

Practice 1: Scalar Linearization

Consider

\[ x'=2x-x^2. \]

Find the equilibria and compute \(f'(x^\ast)\) at each one.

Practice 2: Classify the Scalar Equilibria

Using

\[ x'=2x-x^2, \]

classify the equilibria found in Practice 1.

Practice 3: Discrete Linearization

Consider

\[ x_{n+1}=0.5x_n+x_n^2. \]

Show that \(x^\ast=0\) is a fixed point and determine its local multiplier.

Practice 4: Compute a Jacobian

For

\[ x'=x^2+y, \] \[ y'=xy-y, \]

compute the Jacobian matrix.

Practice 5: Evaluate a Jacobian

Using the Jacobian from Practice 4, evaluate it at

\[ (x,y)=(0,0). \]

Practice 6: Classify from Eigenvalues

A continuous system has Jacobian eigenvalues

\[ -2,\qquad -5. \]

Classify the local equilibrium.

Practice 7: Saddle Linearization

A continuous system has Jacobian eigenvalues

\[ -1,\qquad 4. \]

Classify the equilibrium.

Practice 8: Spiral Linearization

A continuous system has eigenvalues

\[ -3\pm2i. \]

What local phase portrait should be expected?

Practice 9: Discrete Eigenvalues

A discrete fixed point has Jacobian eigenvalues

\[ 0.4,\qquad -0.8. \]

Classify the fixed point locally.

Practice 10: Inconclusive Linearization

Consider

\[ x'=x^3. \]

Explain why linearization at

\[ x^\ast=0 \]

is inconclusive, and use sign analysis to determine the true local stability.

Practice Answers

Practice 1

Let

\[ f(x)=2x-x^2=x(2-x). \]

The equilibria are

\[ x^\ast=0 \]

and

\[ x^\ast=2. \]

Since

\[ f'(x)=2-2x, \]

we obtain

\[ f'(0)=2 \]

and

\[ f'(2)=-2. \]

Practice 2

At

\[ x^\ast=0, \]

the derivative is positive:

\[ f'(0)=2>0. \]

Therefore \(0\) is unstable.

At

\[ x^\ast=2, \]

we have

\[ f'(2)=-2<0. \]

Therefore \(2\) is locally asymptotically stable.

Practice 3

Let

\[ f(x)=0.5x+x^2. \]

Since

\[ f(0)=0, \]

the origin is a fixed point.

Also,

\[ f'(x)=0.5+2x. \]

Thus

\[ \boxed{f'(0)=0.5}. \]

Because

\[ |0.5|<1, \]

the fixed point is locally asymptotically stable.

Practice 4

Let

\[ f(x,y)=x^2+y \]

and

\[ g(x,y)=xy-y. \]

Then

\[ \frac{\partial f}{\partial x}=2x, \qquad \frac{\partial f}{\partial y}=1, \] \[ \frac{\partial g}{\partial x}=y, \qquad \frac{\partial g}{\partial y}=x-1. \]

Therefore,

\[ \boxed{ J(x,y)= \begin{pmatrix} 2x & 1\\ y & x-1 \end{pmatrix} }. \]

Practice 5

At

\[ (0,0), \]

the Jacobian becomes

\[ \boxed{ J(0,0)= \begin{pmatrix} 0 & 1\\ 0 & -1 \end{pmatrix} }. \]

Practice 6

Both eigenvalues are real and negative.

Therefore the equilibrium is locally asymptotically stable and has node-like behavior.

\[ \boxed{\text{stable node}} \]

Practice 7

One eigenvalue is negative and one is positive.

Therefore,

\[ \boxed{\text{the equilibrium is a saddle and is unstable}}. \]

Practice 8

The eigenvalues have negative real part and nonzero imaginary part.

Therefore,

\[ \boxed{\text{the equilibrium is locally a stable spiral}}. \]

Practice 9

Both eigenvalues satisfy

\[ |\lambda|<1. \]

Therefore,

\[ \boxed{\text{the fixed point is locally asymptotically stable}}. \]

The negative eigenvalue corresponds to alternating behavior in its associated direction.

Practice 10

For

\[ f(x)=x^3, \]

we have

\[ f'(x)=3x^2. \]

Therefore,

\[ f'(0)=0, \]

so the first-order linearization is

\[ u'=0 \]

and is inconclusive.

If \(x>0\), then

\[ x^3>0, \]

so the state moves farther right.

If \(x<0\), then

\[ x^3<0, \]

so the state moves farther left.

Therefore,

\[ \boxed{x^\ast=0\text{ is unstable}}. \]

What to Remember

Linearization replaces a nonlinear system by its first-order approximation near an equilibrium.

For a scalar continuous system,

\[ \boxed{ u' \approx f'(x^\ast)u }. \]

For a continuous vector system,

\[ \boxed{ \mathbf{u}' \approx J(\mathbf{x}^\ast)\mathbf{u} }. \]

For a discrete system,

\[ \boxed{ \mathbf{u}_{n+1} \approx J(\mathbf{x}^\ast)\mathbf{u}_n }. \]

The method works because sufficiently close to an equilibrium, derivatives often reveal the dominant structure of the dynamics.

Where We Go Next

Linearization allows us to classify the local behavior of an equilibrium for a fixed set of parameter values.

But equilibria and their eigenvalues can change as parameters vary. A stable equilibrium can become unstable, new equilibria can appear, existing ones can disappear, and periodic behavior can emerge.

These qualitative transitions are called bifurcations.

The next lesson, Bifurcations, studies how changes in parameters reorganize the structure and long-term behavior of dynamical systems.