0% found this document useful (0 votes)
113 views18 pages

First Order ODEs: Solutions & Analysis

This document provides an overview of techniques for solving first-order ordinary differential equations (ODEs). It discusses special forms of ODEs that can be solved explicitly, including separable, homogeneous, and linear equations. It also describes using phase space analysis and studying fixed points to understand qualitative behavior when exact solutions cannot be found. Fixed points can be stable, meaning nearby trajectories approach the point, or unstable, meaning nearby trajectories diverge from the point.

Uploaded by

Abhiyan Paudel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
113 views18 pages

First Order ODEs: Solutions & Analysis

This document provides an overview of techniques for solving first-order ordinary differential equations (ODEs). It discusses special forms of ODEs that can be solved explicitly, including separable, homogeneous, and linear equations. It also describes using phase space analysis and studying fixed points to understand qualitative behavior when exact solutions cannot be found. Fixed points can be stable, meaning nearby trajectories approach the point, or unstable, meaning nearby trajectories diverge from the point.

Uploaded by

Abhiyan Paudel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

1D/ first order ODEs

Koushik Viswanathan

August 28, 2019

Our study of 1D or first order ODEs will set the stage for studying higher-order, nonlinear
equations. Consider the following prototypical first order ODE system (IVP)

dx
= f (x, t) x(t0 ) = x0 (1)
dt

In general, this system is not solvable in closed form so that we will take one of two
approaches—either we will solve explicitly for x(t; x0 ) for certain special forms of f (x, t)
or we will semi-quantitatively study the behaviour of the solution without actually solving
the differential equation.

1 Solutions for special forms of f (x, t)

When the RHS f (x, t) takes on certain forms, the first order IVP becomes easier to handle.
Here are some examples

1.1 Separable: f (x, t) = g(x)h(t)

When the RHS is of the separable form, we can write down a formal solution as follows:

Z Z
dx
= h(t)dt + C (2)
g(x)

where the constant C is determined from the initial conditions. This expression is often
implicit, i.e., cannot be inverted to obtain an expression x(t), even if the integral on the
LHS can be performed in closed form. Several examples may be written down at once—for
dx √ xt
instance dt
= 1+x2
etc.

1
Homogeneous: f (x, t) ≡ f˜ x

1.2 t

When the dependence of f on x, t is of the form f (x, t) = f˜( xt ), the ODE may be simplified
x
by making the substitution y = t
to obtain

dx dy dy f˜(y) − y
=t +y =⇒ = (3)
dt dt dt t

which is of the separable form. Now the solution may be written down again in the form of
an integral as
Z Z
dy dt x
= +C for y = (4)
f˜(y) − y t t

Just as in the previous case, even if the LHS can be integrated in closed form, the solution
x(t) is obtained in implicit form.

1.3 Linear: f (x, t) = −p(t)x + q(t)

This is the easiest of all first order ODEs because it can be solved in explicit form. There are
two ways to go about this—either using an integrating factor or using variation of parameters.
We will illustrate the former. First, multiply both sides of the ODE by some well-behaved
function r(t) to obtain
dx
r(t) + r(t)p(t)x = r(t)q(t) (5)
dt

If we choose a function r(t) such that the LHS of this ODE is reduced to an exact differential
d
of the form dt
(r(t)x(t)), then we can make the identification that

dr R
p(t)dt
= p(t)r =⇒ r(t) = e (6)
dt

This r(t) is called the integrating factor. Consequently, the original differential equation now

2
becomes

R
p(t)dt Z
d e x(t) R
p(t)dt −
R
p(t)dt
R
p(t)dt
=e q(t) =⇒ x(t) = e dt e q(t) + C (7)
dt

R
Notice the constant C now appears along with a t−dependent term e− p(t)dt
so that one
must be careful in applying the initial conditions.

1.4 Substitutional techniques

There are several additional special substitutional techniques that one can discuss vis-á-vis
first order ODEs. These usually intricately depend on the nature of the RHS f (x, t). One
prominent example is the equation

dx
+ p(t)x = q(t)xn (8)
dt

which is called the Bernoulli equation. By substituting y = x1−n , this ODE can be reduced
to the following linear ODE in y

dy
+ (1 − n)p(t)y = (1 − n)q(t) (9)
dt

which can again be solved using an integrating factor.


Several ODEs can be reduced to one of these forms described above by making suitable
change of variables. However, this can often be a hit-or-miss procedure, in which case one
often has to resort to numerical solution (via quadrature) or semi-quantitative techniques.

2 Phase space analysis

When the ODE IVP is not easily solved via integration, we resort to semi-quantitative tech-
niques to obtain information about the solution. This is done using the construct of phase

3
space discussed earlier. For the time being, we will restrict ourselves to autonomous 1D
ODEs. The non-autonomous case can be treated using analogous techniques when we study
second-order systems.
Phase space for a 1D/ first order system is just a line, corresponding to the only independent
variable x(t). Furthermore, we define the trajectory taken by the solution curve to an ODE
problem as the integral curve or flow in phase space. The fixed points x∗ are determined
by the relation f (x∗ ) = 0. These points, being dependent on the form of f (x) alone (and
not the initial conditions x(t0 ) = x0 ), determine the behaviour of all solution curves for first
order ODEs.

Figure 1: Examples of 1D trajectories or flows. Phase space is the x axis and the sign of
f (x) determines the direction that the trajectory takes.

If the function f (x) is linear, i.e., f (x) = px+q, then there is only one fixed point x∗ = −q/p.
Consequently, any solution curve or trajectory that starts at x0 near x∗ = −q/p must either
come towards the fixed point or go away from it, depending on the sign of f (x) at that point.
As an example, see Fig. 1(left). The phase space is the horizontal axis, and the function f (x)
is shown on the vertical axis for convenience. Consider the only fixed point x∗ in this system.
For all values of x to the right of x∗ , f (x) > 0 so that dx
dt
> 0 and x should increase with

4
t. Hence any trajectory that starts to the right of x∗ should go away to +∞. Likewise, for
a trajectory starting to the left of x∗ in the figure, f (x) < 0 always so that all trajectories
to the left must eventually go away to −∞. That this is also quantitatively true may be
checked at once from the solution of the ODE x(t) = − pq + x0 exp(pt). Hence all trajectories
that start ‘sufficiently close’ to x∗ diverge away from it. This fixed point is consequently an
unstable fixed point.
On the other hand, if f (x) is non-linear, multiple solutions x∗ exist for the algebraic equation
f (x∗ ) = 0. An example is shown in Fig. 1(right). In this case, there are two fixed points,
marked red and blue. The system’s behaviour near the red fixed point is the same as in the
linear case—any trajectories starting sufficiently close to the red fixed point tend to diverge
away. However, the opposite happens in the case of the blue fixed point. Here, any trajectory
that starts to its right (between the two fixed points) has f (x) < 0 so that x(t) decreases with
t. Similarly, for trajectories to the left of the blue fixed point, f (x) > 0 so all trajectories
should have x(t) increasing with t and eventually approach x∗ . Hence the blue fixed point is
a stable fixed point in that it tends to ‘attract’ all nearby trajectories.

3 Stability and Linearization

In order to make general statements about trajectories close to a fixed point, we must first
define what we mean by ‘stability’. Two definitions are often used:

Lyapunov stability: For a fixed point x∗ , if we start a trajectory at x0 such that |x0 −x∗ | < δ
for some small δ > 0, then the fixed point x∗ is said to be Lyapunov stable if ∀t > 0,
|x(t) − x∗ | < for some small > 0. Lyapunov stability only guarantees that any trajectory
that starts sufficiently close to a fixed point stays sufficiently close to it forever.

Absolute stability: For a fixed point x∗ , if we start a trajectory at x0 such that |x0 −x∗ | < δ

5
for some small δ > 0, then the fixed point x∗ is said to be absolutely stable if for t → ∞,
x(t) → x∗ . Absolute stability of a fixed point is clearly a more stringent condition than
Lyapunov stability. For first order systems, it is easy to see that absolute stability implies
Lyapunov stability.
In order to obtain a quantitative measure of stability, we will resort to a technique called
linearization about the fixed point x∗ . Consider a fixed point x∗ and let η(t) = x(t) − x∗
denote a trajectory that is near x∗ . Then

dη dx
= = f (x∗ + η) (10)
dt dt

by expanding the RHS in a Taylor series, and using the fact that f (x∗ ) = 0, η(t) obeys the
resulting linearized equation:

= ηf 0 (x∗ ) + O(η 2 ) (11)
dt

where f 0 denotes df /dx, evaluated at x∗ .


The linear Eq. (11) describes the flow in the vicinity of x∗ , irrespective of the starting point
x0 . It is clear from this that the direction taken by the trajectory is determined by f 0 (x∗ )—if
f 0 (x∗ ) < 0, the fixed point x∗ is a stable node This is the case when all trajectories that are
‘near’ x∗ eventually end up at x∗ . On the other hand, if f 0 (x∗ ) > 0, all trajectories starting
near x∗ eventually go far away from it (unless there are other x∗ values nearby which attract
the trajectory). In such a case, the fixed point x∗ is said to be an unstable node
In certain special cases, one may have f 0 (x∗ ) = 0, which can happen when the fixed point
x∗ is a saddle node. Visually, this means that f (x) has a minimum at x = x∗ simultaneous
with f (x∗ ) = 0. Consequently, from one direction, the fixed point is stable (f 0 (x) < 0) and
from another direction it is unstable (f 0 (x) > 0). There are other situations where x∗ is not
df
a saddle but dx
= 0. In these situations, linearization fails only at these points and one must
resort to other techniques.
Hence by linearization of the governing ODE near a fixed point x∗ , we can determine the

6
stability of the fixed point for trajectories that start sufficiently close to it. This is a very
useful technique in understanding the behaviour of nonlinear order ODEs and we will often
take recourse to it.

4 Bifurcations

Once the system Eq. (1) is specified, along with x0 , the features of interest of the system
are completely determined. However, an interesting situation arises when families of such
equations are considered instead. For instance, let us consider the case when the function
f (x) depends on a real–valued parameter λ. We denote this dependence explicitly as f (x; λ).
In general, as the value of λ changes, the fixed points x∗ can be expected to alter their
position. It is possible that at some value λ = λc , the fixed points can change stability or
even cease to exist altogether. At such a value of λ, a bifurcation is said to have occurred.
A necessary condition for bifurcations in 1D systems is:

df
=0 (12)
dx |x∗ ,λC

Please note that this condition does not hold for 2D and higher order systems.
Different types of bifurcations exist and some of them will be enumerated shortly, but it must
first be mentioned that nonlinearity is an essential condition for them to occur—for linear
f (x) = px + q, change in stability is often trivial since it only depends on the sign of p and
there is only one fixed point x∗ = −q/p.

4.1 A nonlinear example

Consider the nonlinear example shown in Fig. 2 for a f (x; λ) = λ + x2 . When λ > λC , f (x)
lies entirely above the horizontal axis so that there are no fixed points at all, see black curve
in the figure. As λ is reduced, the function f (x) changes and at a critical value λ = λC = 0,
a single fixed point appears at x∗ = 0. For all λ < λC , two distinct fixed points occur at

7

x∗ = ± −λ, see red curve in the figure. This is a typical example of a bifurcation, with λC
acting as a bifurcation point.

Figure 2: Variation in f (x) with change in λ

4.2 Saddle-node bifurcation

Another way to visualize this bifurcation is to plot the fixed point x∗ as a function of λ, in
what is called a bifurcation diagram, see Fig. 3. In the figure, a solid line corresponds to an
stable fixed point while a dashed line depicts the position of an unstable fixed point. This
stability is determined using linearization by evaluating f 0 (x) at the fixed points x∗ .

Figure 3: Change in fixed point x∗ vs. parameter λ for a saddle–node bifurcation.

By just observing the values of x∗ , one can conclude that as λ varies, the two fixed points

8
‘come towards each other and annihilate’. This is called a saddle node bifurcation. In a saddle
node bifurcation, fixed points are either created or destroyed as the parameter λ is varied.
The form of the function in the vicinity of a node or critical point can be obtained from a
Taylor series expansion and is called the corresponding normal form for the function near
the critical point. By expanding the function f (x; λ) in both x and λ near a fixed point x∗
and near a bifurcation point λC , one obtains

∂f ∂f 1 ∂ 2f
f (x; λ) = f (x∗ ) + (x − x∗ ) + (λ − λC ) + (x − x∗ )2 + · · · (13)
∂x |(x∗ ,λC ) ∂λ |(x∗ ,λC ) 2 ∂x2 |(x∗ ,λC )

At a saddle node bifurcation, both f (x) = 0 and f 0 (x) = 0 simultaneously so that any
function that shows such a bifurcation necessarily has the form:

f (x) = a(λ − λC ) + b(x − x∗ )2 (14)

∂f ∂ 2 f
near (x∗ , λC ), with a, b corresponding to ,
∂λ ∂x2
, respectively.
As an example, consider the ODE

dx
= λ − x − e−x (15)
dt


the fixed points x∗ obey λ − x∗ = e−x which may be graphically obtained by plotting the
functions f1 (x) = λ − x and f2 (x) = e−x and seeing where they intersect. This function is
shown in Fig. 4 for three different λ. At λ = λC = 1, f1 (x) = λ − x becomes tangent to
f2 (x) = exp(−x) so that only one fixed point exists.
This conclusion can be put on firmer ground by expanding exp(−x) for small x. This gives

f (x) ' λ − 1 − x2 (16)

which is the same as the normal form for a saddle node bifurcation in Eq. 14.

9
Figure 4: Variation in f (x) = λ − x − exp(−x) with λ

4.3 Transcritical bifurcation

In addition to saddle-node bifurcations, first order nonlinear ODEs can also exhibit other
types of bifurcations. These have their own normal forms, and any f (x) that exhibits such
bifurcations can be brought into the corresponding normal form, just as we did in the saddle
node case.
Consider the ODE
dx
= λx − x2 (17)
dt

which has two fixed points x∗ = 0 and x∗ = λ. The bevahiour of this f (x) is shown in Fig. 5

Figure 5: Variation in f (x) = λx − x2 with λ

Just as in the saddle node case, we now see that there are two fixed points for λ < λC .

10
However, now these exist for all values of λ, the only change being their stability. It can be
checked from linearization of f (x) that the fixed point x∗ = 0 is stable for λ < λC = 0 and
becomes unstable for other λ. On the contrary, the point x∗ = λ is unstable for λ < λC and
stable otherwise. The value λC = 0 is known as a transcritical bifurcation point.

Figure 6: Variation in f (x) = λx − x2 with λ

The corresponding bifurcation diagram for a transcritical bifurcation is shown in Fig. 6.


Again, the stable branches are marked in solid lines and the unstable ones using dashed
lines. If we look solely at the branches, we can see that near a transcritical bifurcation point,
two fixed points of opposing stability approach each other. At λC , they ‘contact’ each other
and ‘exchange’ stabilities. This is typical for a transcritical bifurcation.
As an example, and in order to illustrate a more general principle, consider the following
system
dx
= x(1 − x2 ) − λ(a − e−µx ) (18)
dt

which has two parameters µ, λ. Notice that for this system, x∗ = 0 is always a fixed point
∀µ, λ. If we expand the RHS near this fixed point, we see that the ODE may be expressed
as
dx x2
= (1 − λµ)x + λµ2 + O(x3 ) (19)
dt 2

which shows a transcritical bifurcation for λµ = 1, cf. the normal form for a transcritical
bifurcation in Eq. 17. For this 2-parameter system (λ, µ), one may think of a bifurcation

11
occurring along the ‘hyperbola’ λµ = 1. We will often encounter such situations.

4.4 Pitchfork bifurcation

A third type of bifurcation in 1D systems occurs often when the ODE has a symmetry.
Unlike the transcritical type, this bifurcation involves the appearance of two fixed points
(both stable or unstable) when the parameter λ is changed. Two cases must be distinguished

Supercritical case

Consider the normal form:


dx
= λx − x3 (20)
dt

where the RHS is as in Fig. 7 for three different values of λ. First notice that x∗ = 0 is
always a fixed point ∀λ. When λ ≤ 0, this is the only fixed point possible. It can be seen
by linearization that this fixed point is stable for λ < 0 and unstable for λ > 0. However, at
df
λ = λC = 0, a change occurs. Firstly, the function f (x∗ ) and both become zero. Secondly,
dx

two additional fixed points become possible for small λ > λC , and they occur at x∗ = ± λ.
For λ = 1, these are shown in Fig. 7 (black curve). Their stability is again determined by
linearlization, and both fixed points are stable.

Figure 7: Variation in f (x) = λx − x3 with change in λ

The corresponding bifurcation diagram is shown in Fig. 8. Firstly, the fixed point x∗ = 0

12
changes stability at λ = λC = 0. Additionally as λ crosses λC from below, two new fixed
points, both stable, appear alongside x∗ = 0. This type of bifurcation is called a supercritical
pitchfork bifurcation, the name being derived from its obvious shape in Fig. 8. The term
supercritical indicates that this type of bifurcation does not show any hysteresis. We will
understand the full meaning of this term when we study the subcritical case next.

Figure 8: Bifurcation diagram for supercritical pitchfork

df
One other feature of the supercritical pitchfork is the fact that dx
= 0 at the critical point
λC . However, contrary to the saddle node case, the point x∗ = 0 does not become a saddle
here but retains its stability (recall that x∗ = 0 is stable for λ < λC ). However, this problem
demonstrates a shortcoming of the linearization technique in that it does not provide a
necessary condition for the stability of fixed points. Furthermore, it is worth noting that
in the normal form Eq. 20, the x3 term ‘stabilizes’ the linear term, for it is this term that

determines the stability of x∗ = ± λ

Subcritical case

In contrast to the supercritical case, a different type of pitchfork bifurcation occurs when the
ODE has the following normal form

dx
= λx + x3 (21)
dt

13
The corresponding behaviour of the RHS is shown in Fig. 9. This is a mirror image of Fig. 7.
Again, x∗ = 0 is a fixed point ∀λ, and its stability is the same as in the supercritical case.
This may be checked easily by linearization. However, now this is the only fixed point for

λ > 0 so that at λ < 0, two additional fixed points appear at x∗ = ± −λ. In contrast to
the supercritical case, both these fixed points are now unstable.

Figure 9: Variation in f (x) = λx + x3 with change in λ

The bifurcation diagram corresponding to this normal form in shown in Fig. 10. Firstly, the

location of the symmetric fixed points ± −λ has changed compared to Fig. 8. Secondly,
they are now both unstable, even though the qualitative shape of the diagram is unchanged.
This type of a bifurcation at λ = λC = 0 is called a subcritical pitchfork bifurcation.

Figure 10: Bifurcation diagram for subcritical pitchfork

It will often be seen that subcritical pitchfork bifurcations have a higher order stabilizing

14
term. When this higher order term is taken into account, a phenomenon known as hysteresis
appears, giving subcritical pitchfork bifurcations their practical importance, as illustrated in
the following example.
Consider the ODE:
df
= λx + x3 − x5 (22)
dx

For x ∼ 0, the higher order term does not contribute any fixed points and the ODE shows
a subcritical pitchfork bifurcation as in Eq. 21. However, for larger |x|, the higher order
term becomes more dominant. Evaluating the fixed points for this system gives the following
solutions:

r !1/2
∗ 1 1
λ>0 =⇒ x = 0, ± + +λ (23)
2 4

λ=0 =⇒ x∗ = 0, ±1
r !1/2
1 1
−1/4 ≤ λ < 0 =⇒ x∗ = 0, ± ± +λ
2 4

λ < −1/4 =⇒ x∗ = 0

By linearization, one again obtains stability criteria for each of these fixed points, from which
the bifurcation diagram in Fig. 11 may be derived.

Figure 11: Bifurcation diagram for subcritical pitchfork

15
This shows a subcritical pitchfork bifurcation at λ = λC = 0, However, there are two distinct
differences. Firstly, for λ > 0, apart from the unstable x∗ = 0, there are two additional stable
fixed points far awar from x∗ = 0. Secondly, as we lower λ → λC , these two stable points
approach each other but they do not meet even at λ = λC . At λ = λC = 0, as subcritical
pitchfork bifurcation occurs—the x∗ = 0 fixed point becomes unstable and two additional
unstable fixed points appear. All this while , the two new fixed points continue to exist
without any change in their stability. Finally, as λ → λ0C = −1/4, the two pairs of fixed
points (two positive and two negative) approach each other so that at λ = −1/4, two saddle
node bifurcations occur and all four fixed points annihilate each other. For all λ < −1/4,
there is only one fixed point remaining at x∗ = 0, which remains stable.
This example illustrates two phenomena—existence of multiple types of bifurcations in the
same system (here 2 saddle-node bifurcations at λ = −1/4 and a subcritical pitchfork at
λ = 0), and the occurrence of hysteresis. The latter may be observed as follows. Consider
a system with an initial λ > 0. If we study the nature of solutions of this system, we will
q 1/2
observe that all solutions x(t) → ± 2 + 14 + λ2
1
as t → ∞. These are the two outer
fixed points for λ > 0 in Fig. 11. Depending on whether x0 is positive or negative, x(t) tends
to the positive or negative fixed point.
As we lower λ, the solutions continue to decay to these fixed points as before, even when we
cross the pitchfork bifurcation point λ = λC ! If we a priori knew of this bifurcation point, we
would expect that x∗ = 0 should change its stability and attract all trajectories towards it,
but this does not happen. The reason for this is the existence of the two unstable fixed points
between the outer fixed points and x∗ = 0 which repels any trajectories. However, when we
reach λ = λ0C , these unstable trajectories go away and the solution now starts decaying to
x∗ = 0 as we expect. So the switch to the stable branch x∗ = 0 occurs not at λ = 0 as we’d
expect but at λ0C = −1/4.
On the other hand, if we went the other way, i.e., increased λ from −∞ → +∞, we would
see a different picture. Solutions x(t) that start close to x∗ = 0 continue to converge to it as

16
t → ∞ as λ → λC = 0. For all λ ≥ λC , all solutions x(t) would then start diverging towards
the two outer fixed points. The reverse transition, remember, occured only at λ = −1/4
in the other direction. This phenomenon is known as hysteresis and is common with all
subcritical bifurcations.

5 Importance of normal forms

So far we have considered four normal forms:

dx
1. Saddle node: dt
= λ + x2

dx
2. Transcritical: dt
= λx + x2

dx
3. Supercritical pitchfork: dt
= λx − x3

dx
4. Subcritical pitchfork: dt
= λx + x3

It turns out that most bifurcations in first-order nonlinear autonomous ODEs can be put in
one of these forms.
For example, consider the system

dx
= λ + x + x2 (24)
dt
q

The system has two fixed points, corresponding to x = − 12 ± 1
4
− λ. These fixed points
only exist for λ < 1/4. From linearlization, we see that

df √
= ± 1 − 4λ (25)
dx |x∗

It is clear from this that for λ < 1/4, one of the fixed points is stable and the other is
unstable. The corresponding bifurcation diagram is shown in Fig. 12. This is again a saddle-
node, with the bifurcation point (λC = 1/4) displaced from that for the normal form (λC = 0).

17
Additionally, instead of the two fixed points meeting at a saddle at x∗ = 0, they meet at
x∗ = −1/2.

dx
Figure 12: Bifurcation diagram for dt
= λ + x + x2

That a saddle node bifurcation occurs at these points can be seen by reducing the ODE to
the following
2
dx 1 1
= λ + x + x2 = λ− + x+ (26)
dt 4 2

and when we compare this with the normal form of the saddle node, we immediately see that
it is of the form dx̃
dt
= λ0 + x̃2 with λ0 = λ − 1
4
and x̃ = x + 12 . This explains the behaviour of
the present system in terms of the normal form variant.
Similar conclusions can be drawn for the other normal forms, which is why they are significant.
In addition to these, there do exist other 1D bifurcations (such as imperfect pitchforks)
which we will not study for the present. A very nice description is provided in the book
by Strogatz [1]. These basic bifurcations will show up with a richer variety when we study
second order nonlinear ODE systems.

References

[1] Strogatz SH. Nonlinear dynamics and chaos: with applications to physics, biology, chem-
istry, and engineering. CRC Press; 2018.

18

You might also like