Abstract
In this paper, an alternative is proposed for computing fold and cusp bifurcation in a system of two ordinary differential equations depending on one or two parameters. In particular, it is proven that the fold bifurcation point in that system corresponds to a local maximum or minimum of a constrained optimization problem, which can be computed using the classical Lagrange Multiplier Method. Conversely, a sufficient condition is provided so that the solution of a particular constrained optimization problem using the Lagrange Multiplier Method corresponds to a fold bifurcation of two ordinary differential equations. Similarly, for system with two parameters, some sufficient conditions for cusp bifurcation points are also provided. These results are applied to three examples: the Bazykin’s system, a two-dimensional predator–prey system with nonmonotonic response function, and a subsystem of the so-called tritrophic food-chain model. The results are compared with those in the literature and also with the results using the numerical continuation software AUTO. Furthermore, a swallowtail bifurcation is detected in the latter model.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
An equilibrium of a two-dimensional system of ordinary differential equations can be seen as an intersection between two curves. These curves (or more generally nullclines) are defined by the zero set of each of the components of the vector field. It is assumed that the vector field depends smoothly on one or two parameters. Consequently, the two previously mentioned curves will vary smoothly in \({\mathbb {R}}^2\) as the parameters are being varied. In particular, fold bifurcation corresponds to the situation where the system has two equilibria which coalesce with each other and disappear when the parameter is being varied. This phenomenon can be observed in the neighborhood of a point where the two curves have a tangential intersection. Such a point can be found using the classical Lagrange multiplier method.
In practice, finding fold bifurcation points can be accomplished numerically by using numerical continuation software such as MATCONT [5], AUTO [6], or XPPAUT [7]. This involves fixing all of the parameters and then computing the equilibria in the system. In this paper, we will refer to these initial values for the parameters and the corresponding equilibrium as initial condition. By varying one of the parameters, we compute a branch of equilibria for the system and look for fold bifurcations in that branch.
By way of illustration, in Fig. 1, a particular situation where there are three branches of equilibria are presented, i.e. a solid black curve, a dashed black curve, and a dotted black curve. We present also three different initial conditions, which are labeled as I, II and III. Choosing the initial condition I, one might be able to compute three equilibria for the system. By varying the bifurcation parameter, two branches of equilibria are obtained (the solid curve and the dashed curve) and thus, the fold points \(F_1\), \(F_2\) and \(F_3\) will be detected. However, we will not be able to compute the curve of equilibria for the system which is plotted using dotted line (and consequently, we will miss the point \(F_4\)). The situation is similar if we start the process at initial condition III, but we will miss the fold point \(F_1\) instead of \(F_4\). A worse situation is when we start at initial condition II. Thus, using existing numerical continuation software, one need to choose the initial condition carefully. However, in practice, it is not always clear how to choose the initial conditions.
Another approach is using a (semi) analytical method. This is conducted by solving a system of equations which consists of equations for the equilibrium, together with taking the determinant of the Jacobian zero, while requiring the trace of the Jacobian as nonvanishing. In most cases, it is not very easy to solve this system of equations analytically and numerically computing the determinant of a matrix can be quite demanding even when the vector field of the system is polynomial. The advantage of this new method in comparison with the traditional continuation method is that we are immediately solving a system of algebraic equations for fold bifurcation instead of the one used for general equilibrium.
Indeed, the theory of fold and cusp bifurcations has quite a long history. However, interest in the so-called backward bifurcation in epidemiological models has emerged (see for example in [8] and the references therein). This bifurcation is related with the fold bifurcation and analytical computation of the bifurcation point can help in providing a more accurate prediction for backward bifurcation.
In [16] an alternative method for computing fold bifurcation points using the Lagrange Multiplier Method is described. The method itself has been previously applied in a dynamical system in [9]; however, the method was not explained clearly there. The method is extended in [17] and [21] to include computation of cusp bifurcation points.
One of the goals of this paper is to prove the relation described above by providing the conditions on the (local) maxima or minima of a constrained optimization problem to correspond to a fold bifurcation in a particular system of ordinary differential equations. It is also demonstrated how the method in combination with the Newton method can be extended to compute cusp bifurcations by varying two parameters. By varying the third parameter, the bifurcation diagrams are generated for some values of the third parameter which indicate the occurrence of swallowtail bifurcation.
1.1 Outline
We start in Sect. 2.1 with studying a system of two ordinary differential equations which depend on one parameter. Assuming the existence of a fold bifurcation point, in the neighborhood of that point we derive a particular constrained optimization problem where that fold bifurcation point is either a maximum or minimum. Conversely, starting from a maximum or minumum of a constrained optimization problem, two conditions are derived so that the system undergoes fold bifurcation. See Theorems 1 and 2.
In Sect. 2.2, we are concerned with the situation where one of the conditions in Theorem 2 is violated. We assume that the system now depends on two parameters. This extra parameter allows us to generate the curve of fold bifurcations if the Implicit Function Theorem applies. In the case where the Implicit Function Theorem cannot be applied, some conditions are provided for cusp bifurcation in Theorem 3.
In Sect. 3, two examples are discussed, i.e. : Bazykin’s system (see [3]) and the predator–prey system with non-monotonic response function (see [9, 20, 21]). These two examples are known in the literature to exhibit fold and cusp bifurcations. In Bazykin’s system, the explicit formula for the coordinate of the fold bifurcation points as functions of the bifurcation parameter can be explicitly computed. Then, the cusp bifurcation points are computed numerically from those explicit formulas. This is not the case in the predator–prey system. Applying a standard continuation method to the equation for one of the coordinates of the fold bifurcation, in combination with the Newton method for root findings, the cusp bifurcation point is computed.
In Sect. 4, the method is applied to a two-dimensional dynamical system which is derived from the so-called tritrophic food-chain model (see [4]). This system belongs to a class of predator–prey type of dynamical systems which has been studied extensively in the literature. For example, in [12, 13, 22] there is a predator–prey type of dynamical systems of dimension higher than two while in [10, 11, 15, 24] there is a two-dimensional system but with various response functions.
As for the functional response, in [18, 19], the Holling type IV is employed to accommodate the group defence mechanism. A combination of response functions of different types might bring much more interesting dynamics and bifurcations; see for example [1, 2]. In this paper, we assume that the predator has a group defence mechanism to protect them from the top predator, while the prey has not. This implies that we use the Holling type II response function on the prey–predator subsystem, and the Holling type IV for the predator–top predator subsystem.
Our results are compared with those using the continuation software AUTO. Furthermore, our result is extended by providing an evidence for swallowtail bifurcation.
2 Main results
2.1 One-parameter family of dynamical systems
Consider a one-parameter family of systems of ordinary differential equations in \({\mathbb {R}}^2\) with coordinate (x, y), i.e.
We assume that \(\psi _2(x,y) > 0\) for all x, y. Then the System (1) can be rewritten as:
Thus, System (1) is orbitally equivalent to:
with:
The equilibrium of System (2) is a solution of system:
Let us assume that at \(\beta = \beta _0 \in {\mathbb {R}}\), System (2) undergoes a fold bifurcation. Without loss of generality, suppose that for \(\beta < \beta _0\), System (2) has two equilibria. Then, these equilibria collide with each other at \(\beta = \beta _0\), and disappear when \(\beta >\beta _0\). This means that the curve: \(G(x,y) = \beta \) has two intersection points with the curve: \(F(x,y) = 0\). Furthermore, at \(\beta = \beta _0\) the two curves are tangential to each other while for \(\beta > \beta _0\) they do not intersect with each other. This implies that \(\beta _0\) is a local maximum of G(x, y) on the level set \(F(x,y) = 0\) in the neighborhood of \((x_0,y_0)\). The following theorem if found.
Theorem 1
If System (2) undergoes fold bifurcation at \((x_0, y_0)\) for \(\beta = \beta _0\), then \((x_0, y_0)\) is a local maximum or minimum point of G(x, y) on \(F(x,y) = 0\).
Let \((x_0, y_0, \lambda _0)\) be a solution for: a constrained optimization problem:
with: \(\lambda _0 \not = 0\) (see Remark 2 for \(\lambda _0 = 0\)). By setting \(\beta = \beta _0 = G(x_0,y_0)\), it implies that the point \((x_0,y_0)\) is an equilibrium for System (2). Furthermore, the linearized vector field of System (2) at the vicinity of the equilibrium \((x_0,y_0)\) is:
with eigenvalues: 0 and \(\eta = \lambda _0 F_y(x_0, y_0) + F_x(x_0, y_0)\).
Let us denote by A and B, the Hessian matrices of F and G at the equilibrium \((x_0, y_0)\), i.e.:
and by J, the matrix:
The following theorem is found.
Theorem 2
If
and,
then at \(\beta = \beta _0 = G(x_0,y_0)\) System (2) undergoes a fold bifurcation.
Note that the condition in Eq. (5) implies that \((x_0,y_0)\) is a degenerate equilibrium of System (2) with a single zero eigenvalue. The proof for this theorem is produced by the center manifold reduction of System (2) in the neighborhood of \((x_0,y_0)\). Then by checking two nondegeneracy conditions for fold bifurcation (see Theorem 3.1, pp. 85-86 in [14]) the condition in Equation (6) is derived. The detail of the proof can be found in Appendix A.
Remark 1
A fold bifurcation point in System (2) can also be computed by considering the following system:
and subsequently computing \(\beta \) from: \(\beta = G(x,y)\). One also needs the condition in Eq. (5) which is equal to the nonvanishing of the trace of the Jacobian in the solution of System (7).
System (7) consists of two equations with two unknowns while System (3) consists of three equations with three unknowns. However, the system: \(\nabla G = \lambda \nabla F\), is a priori simpler than \(F_x G_y - F_y G_x = 0\). For example, when F and G are cubic, then \(\nabla G = \lambda \nabla F\) is quadratic in (x, y), while \(F_x G_y - F_y G_x = 0\) is quartic.
Remark 2
We have to avoid the situation where \(\lambda _0 = 0\) in System (3). The reason for this is that when \(\lambda _0 = 0\), \((x_0, y_0)\) corresponds to a critical point of G. In that case, the level set of \(G(x,y) =\beta \), locally in the neighborhood of \((x_0,y_0)\), either for \(\beta < \beta _0\) or \(\beta >\beta _0\) is empty. In other words, \(\beta _0 = G(x_0,y_0)\) is not a regular value of G.
2.2 Two-parameter family of dynamical systems
Consider a two-parameter family of systems of ordinary differential equations, i.e.:
Let us fix a value for \(\alpha = \alpha _*\in {\mathbb {R}}\), and assume that \((x_*, y_*, \lambda _*)\) is a solution of
which corresponds to the fold bifurcation in System (8). We set the value \(\beta _*\) by: \(\beta _*= G(x_*, y_*, \alpha _*)\).
We define a function: \( {\varvec{H}} : {\mathbb {R}}^4 \longrightarrow {\mathbb {R}}^3\) by:
If the partial derivative of \({\varvec{H}}\) with respect to \(\alpha \):
then by the Implicit Function Theorem there exists a neighborhood U of \(\alpha _*\), so that the curve:
satisfies: \({\varvec{H}}\left( x(\alpha ), y(\alpha ), \alpha , \lambda (\alpha ) \right) = {\varvec{0}}\). Furthermore \(x(\alpha _*) = x_*\), \(y(\alpha _*) = y_*\) and \(\lambda (\alpha _*) = \lambda _*\). Using this curve, we can define:
which provides us with a fold bifurcations curve in the parameter space \((\alpha , \beta )\).
In some cases, there are N solutions for System (9) satisfying Eq. (10). Let:
be a set of those solutions. Then, each of these curves:
defines a fold bifurcations curve in the parameter space \((\alpha , \beta )\).
Consider the equation:
for some fixed i and j, and let \(\alpha = \alpha _0\) be a solution of Eq. (11). Then we define: \(x_0 = x_i(\alpha _0)\), \(y_0 = y_i(\alpha _0)\), and \(\beta _0= G\left( x_0 , y_0, \alpha _{0} \right) \).
In the following theorem it can be concluded that under certain conditions, System (8) is topologically equivalent to the normal form of cusp bifurcation in the neighborhood of the point: \((x_0, y_0)\).
Theorem 3
Let \((x,y) = (x_0,y_0)\) be a solution for
for some \(\lambda _0 \not = 0\), such that:
-
1.
\(\displaystyle \eta = F_x + \lambda _0 F_y \not =0\) evaluated at \((x_0, y_0,\alpha _0)\),
-
2.
\(\displaystyle \left( J \nabla F \right) ^T \left( \lambda _0 A - B \right) J \nabla F = 0\), where A and B are the Hessian of F and G, respectively, at the equilibrium \((x_0,y_0,\alpha _0)\).
-
3.
\(\displaystyle c_1 - 3c_2 c_3 \not = 0\) where:
$$\begin{aligned} \begin{array}{l} c_1 = \eta ^2 \left. \left( \left( J\nabla F \right) ^{\scriptscriptstyle T} \left( \lambda _0 A_2 - B_2 \right) J\nabla F \right) \right| _{(0,0,0)},\\ c_2 = \displaystyle \left. \left( \left( J\nabla F\right) ^{\scriptscriptstyle T} \left( \lambda _0 A - B \right) \; {\varvec{p}} \right) \right| _{(0,0,0)}, \\ c_3 = \displaystyle \left. \left( \left( J \nabla F \right) ^{\scriptscriptstyle T} \left( F_{x} A + F_{y} B \right) J \nabla F \right) \right| _{(0,0,0)},\\ A_2 = \left( \begin{matrix} F_y F_{xxx} &{} 3 F_y F_{xxy}\\ -3F_x F_{xyy} &{} -F_x F_{yyy} \end{matrix}\right) , \\ B_2 = \left( \begin{matrix} F_y G_{xxx} &{} 3 F_yG_{xxy} \\ -3 F_x G_{xyy} &{} -F_x G_{yyy} \end{matrix}\right) , \text { and } {\varvec{p}} = \left( \begin{matrix} 1\\ \lambda _0 \end{matrix}\right) ; \end{array} \end{aligned}$$all evaluated at \((x_0, y_0, \alpha _0)\),
-
4.
and, lastly:
$$\begin{aligned} \left. \left( J \nabla F \right) ^T \left( \left( \begin{matrix} G_{xx\alpha }\\ G_{yy\alpha } \end{matrix}\right) - \lambda _0 \left( \begin{matrix} F_{xx\alpha }\\ F_{yy\alpha } \end{matrix}\right) \right) \right| _{(x_0, y_0, \alpha _0)} \not = 0. \end{aligned}$$
Then at \(\beta = \beta _0 = G(x_0,y_0)\) System (8) undergoes a cusp bifurcation.
As in the previous theorem, the proof follows from the center manifold reduction of System (2) in the neighborhood of \((x_0,y_0)\), and from checking four conditions for cusp bifurcation (see [14]). The detail of the proof can be found in Appendix B.
3 Two examples
In this section, two examples are presented which are well-known in the literature: the Bazykin’s system (see [3]) and the predator–prey systems with non-monotonic response function (see [9, 20, 21, 24]). It is known that both systems undergo fold and cusp bifurcations. In the first example, the solutions for System (3) as a function of the parameter can be obtained explicitly. For the second example, the fold bifurcation curves are obtained numerically by applying the Newton method. The numerical results are presented in ten-digit accuracy.
3.1 Bazykin’s system
Let us consider the system
where x and y are densities of the prey and the predator, respectively. The parameter \(\alpha \) is the saturation parameter of the predator functional response and \(\delta \) is the predator rates of competition for external resources. In [14] it is shown that System (12) exhibited two cusp bifurcation points in the parameter-space \((\alpha ,\delta )\). These two cusp bifurcation points will be reconstructed using the procedure which has been described in the previous sections.
From the second equation of System (12), we derive:
Hence, we set
as the cost function. As a consequence, the constraint is:
Appying the Lagrange Multiplier Method, two curves of solutions are derived : \(\alpha \longmapsto (x_k(\alpha )\), \(y_k(\alpha ), \lambda _k(\alpha ))\), \(k=1,2\). The explicit formulas for these solutions are:
where
These two solution curves define fold bifurcations curves: \(G(x_k(\alpha ),y_k(\alpha ),\alpha ) = \delta \), \(k=1,2\). In Fig. 2, the two fold bifurcation curves \(G(x_k(\alpha ),y_k(\alpha ),\alpha ) = \delta \), \(k=1, 2\) have been plotted in \((\alpha ,\delta )\)-coordinates.
Instead of solving Eq. (11), \(x_1(\alpha ) = x_2(\alpha )\) is solved to derive two cusp bifurcation points. This is clear since \((x_k(\alpha ), y_k(\alpha ))\), \(k =1,2\) correspond to degenerate equilibria at fold bifurcation, for every \(\alpha \) where they are defined. Thus, at the cusp bifurcation the coordinate of these degenerate equilibria is the same. Solving \(x_1(\alpha ) = x_2(\alpha )\) for \(\alpha \) we have:
Note that we have to exclude: \(\alpha = 0.99\) from our consideration since \(y_{1,2}(0.99) = 0\); hence G(x, y) is singular there. Thus, it can be concluded that there are two cusp bifurcations at \((\alpha , \delta ) = (0.0887673081,\) 2.7983226350) and (0.9012326919, 0.0035631988).
3.2 Predator–prey systems with non-monotonic response function
In [24], Zhu et al. introduce a predator–prey systems with non-monotonic response function, i.e.
where x and y are the prey and predator densities, respectively. The parameter \(\delta \) measures the mortality rate of the predator while \(\kappa \) and \(\mu \) measure the intraspecific competition between the preys and predators, respectively. The predation factor is measured by parameters \(\alpha \) and \(\beta \).
Following Harjanto et al. in [9, 20], we fix the parameters \(\delta = 1.1, \kappa = 0.01, \mu = 0.1\) and describe the local bifurcation diagram of equilibria of System (13). Let us define:
Assuming that \(\beta ^2 - 4 \alpha < 0\) we have \(\alpha x^2 + \beta x +1\) which is positively definite. Solving \(g(x,y, \alpha , \beta ) = 0\) for \(\alpha \) yields:
Hence, we define
as our cost function. Then, the constraint is defined by:
Using the Lagrange Multiplier Method, a family of solutions is derived that satisfies
and
with x is a solution for Eq. (14). The expression for \(\lambda \) is rather complicated, so it is omitted. Unlike the previous one, in this example explicit solutions for System (3) cannot be achieved. We proceed with constructing the fold line by the following procedure.
First, a value for \(\beta \) is fixed, for example: \(\beta _0=0\). Then Eq. (14) reduces this to a fourth-degree polynomial, which can be solved numerically. In this case it produces four positive roots. We can then eliminate two of them using the expression in Eq. (15) since all of the solutions should be positive from a practical point of view. Up to this point, we have \((x_k(\beta _0),y_k(\beta _0))\), \(k=1,2\) as a solution for Eqs. (14) and (15). Then we can define:
Next, we turn to the Newton method for computing the cusp bifurcation points. Suppose \((\beta _*, x_*)\) is the local maximum of the function \(\beta (x)\) which is implicitly defined by \(H(x,\beta ) = 0\). Then, this point corresponds to the cusp bifurcation point since for \(\beta = \beta _*- \delta \), \( 0< \delta \ll 1\), System (2) has two fold bifurcation points which collide with each other at \(\beta = \beta _*\), and then disappear when \(\beta = \beta _*+ \delta \), \( 0< \delta \ll 1\). The same applies when \((\beta _*, x_*)\) is the local minimum. Thus, the cusp bifurcation point can be found at the local extremum of \(\beta (x)\).
Since \(H(x,\beta ) = 0\), then \(0 = dH = H_x dx + H_{\beta } d\beta \) which implies:
Furthermore:
We want to look for \(\beta ^*\) so that \(\frac{d\beta }{dx}(x,\beta ^*) = 0\). Starting at \(\beta _0=0\), and taking one of the possible solutions of \(H(x, \beta _0) = 0\), say: \(x(\beta _0)\), for \(i = 0, 1, 2, \ldots \) we define a recurrence formula:
assuming: \(H_{\beta x} H_x - H_{xx} H_\beta \not = 0\) at \((x(\beta _i),\beta _i)\). Note that at every level i, the value of \(x(\beta _i)\) is updated by computing (numerically) the solution of \(H(x, \beta _i)\) for x. The iteration is terminated when the difference \(| \beta _{i+1} - \beta _i|\) is less than some tolerance. The result of this procedure is then substituted into Eqs. (15) and (16).
For System (13), the cusp bifurcation point occurs at
The result of Eq. (16) in System (3) is plotted and this result is in agreement with the result in [9], see Fig. 2 page 191.
Remark 3
In Tables 1 and 2, it can be seen that the values of \(h_{uu}\) at the cusp bifurcation point are quite large. This is due to the numerical approximation of the coordinate of the bifurcation points. These results can be improved by increasing the accuracy of the approximation.
4 Subsystem of the tritrophic food-chain model
Let us consider a system of ordinary differential equations in \({\mathbb {R}}^3\), i.e.:
where x, y, z are the population densities of prey, predator, and top predator, respectively. This system is also known as the normalized tritrophic food-chain model (see [4]). We assume that y only consumes x and z only consumes y. This implies that there are an intraspecific competition both in the predator and the top predator (measured by \(\sigma _1\) and \(\sigma _2\)). As for the response function between x and y, we have chosen the Holling type II response function with parameter: \(\alpha \). The parameters \(\beta _1\) and \(\beta _2\) are the parameters that measure the group defence mechanism. This corresponds to the Hollng type IV response function between y and z. The parameters \(\delta _1\) and \(\delta _2\) are the mortality rate of predator and top predator, respectively. Parameter \(\zeta \) represents the ratio between the growth rate of x and y while parameter \(\varepsilon \) represent the ratio between the growth rate of y and z.
We will focus on the situation where \(\varepsilon = 0\). In this case, \({\dot{z}} = 0\), which implies that \(z(t) = z_0\) at all times. Consider the dynamical system:
Apart from being a subsystem of System (17), it is also interesting to see that the second equation of System (18) can be regarded as:
Thus, System (18) can be considered as a type of the predator–prey model with the Holling type II response function, where the mortality rate of the predator is non-constant.
4.1 Numerical continuation using AUTO
Let us fix some values for the parameters, i.e.: \(\alpha = 0.0675\), \(\beta _1 = 0.2360\), \(\beta _2 = 0.5850\), \(\delta _1 = 0.1580\), and \(\sigma _1 = 0.1000\). For these values of the parameters and \(z_0 = 0.2\), an equilibrium is computed for System (18), i.e. \((x,y) = (0.064, 0.123)\). We follow this equilibrium, as we vary \(z_0\) using the numerical continuation software AUTO (see [6]). Two fold bifurcations point are found, i.e. at \(z_0 = 0.4543905251\) and \(z_0 = 0.4668738180\).
Let us now let another parameter free, i.e. \(\sigma _1\), and follow the loci of the fold bifurcations. This gives us two fold curves (the curve where fold bifurcation occurs) in \((\sigma _1, z_0)\)-plane. These two curves of fold bifurcations coalesce with each other to a point which is a co-dimension two bifurcation known as cusp bifurcation at \(C_2 = ( 0.4720339157,\) 0.4476167091). As we follow one of the branches emanating from \(C_2\), another cusp point is found at \(C_1 = (-0.5682189318, 0.3658528382)\), which then provides us with the third fold curve.
In Fig. 4a the one-parameter continuation of equilibria is plotted for System (18). These equilibria are represented by the x-coordinate. There are two fold points in the \((z_{0},x)\)-plane, i.e. \(F_1 = (0.4543905251, 0.9554454984)\) and \(F_2 =\) (0.4668738180, 0.6567319592) . In Fig. 4b, we have plotted the two-parameter continuation of the the loci of the fold bifurcations. Diagrams (a) and (c) are branches of equilibria as a function of \(z_0\). The fold bifurcation points are labelled by \(F_j\), \(j =1,2,3\). The diagrams (b) and (d) are the bifurcation diagrams in the \((\sigma _1, z_0)\)-plane; thus the parameter \(\sigma _1\) is now a free parameter. The cusp bifurcation points are labeled by \(C_k\), \(k= 1,2, 3\).
4.2 Computation of fold bifurcation using the Lagrange multiplier method
Let us consider the system of equations for the nontrivial equilibrium of System (18), i.e. :
where:
and
Note that by considering System (19) instead of looking for the zeroes of the vector filed in System (18) we disregard the equilibria at \(x=0\) or \(y=0\).
Since \(g(x,y, z_0)=0\) is linear with respect to \(z_0\) with a non-vanishing coefficient, there exists a unique function
so that \(g\left( x,y, G(x,y)\right) = 0\). This implies that system:
is equivalent with System(19). Thus, choosing G as the cost function, and \(F=0\) as the constraint, the Lagrange Multiplier Method can be applied with \(\lambda \) as the Lagrange multiplier, as described earlier.
By solving System (3), three fold bifurcation points are derived in the \((z_0, x)\)-plane. Those points are: \(F_1 =\) (0.4543905466, 0.9554454889), \(F_2 =\) (0.4668738384, 0.6567319636), and \(F_3 = (0.7463729068, -0.2801091825)\), see Fig. 4c by way of illustration. Let us concentrate on \(F_1\) and \(F_2\). In Table 3, the comparison is presented between the coordinates of the fold points computed by using the Lagrange Multiplier Method and by using AUTO. The table shows a remarkable agreement between the two methods.
Let us now look at fold bifurcation point \(F_3\). Comparing the bifurcation diagram in Fig. 4a and the diagram in Fig. 4c, it can be seen that the the numerical continuation software AUTO did not produce the branch of equilibria containing point \(F_3\). This is due to the fact that AUTO starts at the generic equilibrium \((x,y) = (0.064, 0.123)\) and follows it as we vary the parameter. The branches of equilibria containing \(F_1\) and \(F_2\) are connected to the initial generic equilibrium while the branch of equilibria containing point \(F_3\) is not. As a consequence, one would have needed to to choose other values for the parameter, for example \(\sigma _1 = 0.1\) and \(z_0 = 0.8\), to be able to find the branch of equilibria containing \(F_3\).
Our proposed procedure, on the other hand, computes the fold points directly. Thus, it immediately produces all fold points in the system, and hence the branches of equilibria connected to those fold points. It will, however, miss the branches of equilibria that contain no fold point. Thus, our method produces a more complete description of the fold bifurcation in System (18).
4.3 Cusp bifurcation
Let us consider \(\sigma _1\) as another free parameter apart from \(z_0\). Redefining the cost function G which is now dependent on \(\sigma _1\), as
it is found that the x- and the y-components of the solution of System (3) satisfy
and
Numerically, we derive five fold bifurcation curves that are defined by \(z_0 = G(x_k(\sigma _1),y_k(\sigma _1),\sigma _1)\) for \(k = 1,2,3,4, 5\). There are two fold curves (dotted-curves in Fig. 4d) which are intersecting with each other non-transversally at a cusp point: \(C_3\), at
Another three fold curves (solid curves in Fig. 4d) are also intersecting with each other non-transversally at two cusp bifurcation points \(C_1\) at \( (\sigma _1, z_0) = (-0.5682189267, 0.3658528580) \) and, \(C_2\) at (0.4720339081, 0.4476167308). See Fig. 4d by way of illustration.
4.4 Swallow–tail bifurcation
Let us consider another example, at \(\sigma _1 = -0.5\). Using the Lagrange Multiplier Method, there are five fold points, i.e. :
See Fig. 5a for the illustration for the location of these fold points.
We remark that the distance between the two cusp bifurcation points on the solid curves in Fig. 5 become smaller, as parameter \(\beta _1\) becomes smaller. This behavior gives a very strong indication of the swallow-tail bifurcation. We choose several values of \(\beta _1\), i.e.: \(\beta _1 = 0.1\), \(\beta _1 = -0.5\), \(\beta _1 = -0.8\), and \(\beta _1 = -1\). For each value of \(\beta _1\), we repeat the procedure as is added done in the previous sections; see Fig. 6.
In general, by varying \(\delta _1\), a dimension is added to the bifurcation diagram plotted in the diagram (b) in Fig. 5. Thus, the fold curves become fold surfaces and the cusp points become cusp curves. In Fig. 6, four two-dimensional sections are plotted in \((\sigma _1, z_0)\)-space, of the three dimensional bifurcations diagram in \((\sigma _1, z_0, \beta _1)\)-space. These sections are for \(\beta _1 = 0.1\), \(\beta _1 = -0.5\), \(\beta _1 = -0.8\), and \(\beta _1 = -1\). From these four diagrams in Fig. 6, it can be observed that the two cusp bifurcation points collapse into one swallow-tail bifurcation point as \(\beta \) decreases.
5 Concluding remarks
The procedure for computing fold and cusp bifurcation points for equilibria of system of two ordinary differential equations using Lagrange Multiplier Method has been introduced in [16, 17]. This is an alternative method which has some advantages. One of them, as explained in Remark 1, is that the set of equations to be solved is relatively simpler than using a direct approach. We also created a Matlab program to compute the running time needed to calculate fold bifurcation points using the Lagrange Multiplier Method and the direct method through the determinant of the Jacobian matrix, see Table 5.
Another advantage is the following. In a standard continuation method, we usually start at a non-degenerate equilibrium of the system and follow it (by means of continuation) as the parameter change. There is no a priori reason to expect that a degenerate equilibrium will be reached as the parameter change. In fact, in Fig. 4 we show an example where the traditional continuation method fails to compute some branches of degenerate equilibria. This is due to the fact that those branches are not connected with the initial equilibrium we started with.
Extending our result to higher dimensional system poses an interesting question. For example in a three-dimensional system, one could reduce the dimension to two by writing one of the coordinates in terms of the other using one of the equations, see [16]. What we have in mind as an extension of our result is to study the relation between the optimization problem with two (or more) constraints and fold bifurcation. This may be a subject of future investigation.
References
Baek H (2013) On the dynamical behavior of a two-prey one-predator system with two-type functional responses. Kyungpook Math J 53(4):647–660
Baek H, Kim D (2014) Dynamics of a predator–prey system with mixed functional responses. J Appl Math
Bazykin AD (1985) Mathematical biophysics of interacting populations. Nauka, Moscow
Bo D (2006) Equilibriumizing all food chain chaos through reproductive efficiency. Chaos Interdiscip J Nonlinear Sci 16(4):043125
Dhooge A, Govaerts W, Kuznetsov YA (2003) MATCONT: a MATLAB package for numerical bifurcation analysis of ODEs. ACM Trans Math Softw (TOMS) 29(2):141–164
Doedel EJ, Champneys AR, Fairgrieve TF, Kuznetsov YA, Sandstede B, Wang X et al (1997) Continuation and bifurcation software for ordinary differential equations (with homcont). AUTO97, Concordia University, Canada
Ermentrout B (2002) Simulating, analyzing, and animating dynamical systems: a guide to XPPAUT for researchers and students, vol 14. SIAM, Philadelphia
Gumel AB (2012) Causes of backward bifurcations in some epidemiological models. J Math Anal Appl 395(1):355–365
Harjanto E, Tuwankotta JM (2016) Bifurcation of periodic solution in a Predator-Prey type of systems with non-monotonic response function and periodic perturbation. Int J Non-Linear Mech 85:188–196
Holling CS (1959) The components of predation as revealed by a study of small-mammal predation of the european pine sawfly. Can Entomol 91(5):293–320
Holling CS (1959) Some characteristics of simple types of predation and parasitism. Can Entomol 91(7):385–398
Huang Y, Diekmann O (2001) Predator migration in response to prey density: what are the consequences? J Math Biol 43(6):561–581
Klebanoff A, Hastings A (1994) Chaos in one-predator, two-prey models: general results from bifurcation theory. Math Biosci 122(2):221–233
Kuznetsov YA (1998) Elements of applied bifurcation theory, 2nd updated ed, volume 112
Liu X, Wang J (2015) Codimension two and three bifurcations of a predator–prey system with group defense and prey refuge. Nonlinear Anal 20(1):72–81
Marwan M, Tuwankotta JM, Harjanto E (2018) Application of lagrange multiplier method for computing fold bifurcation point in a two-prey one predator dynamical system. J Indones Math Soc 24(2):7–19
Owen L, Tuwankotta JM (2019) Computation of cusp bifurcation point in a two-prey one predator model using lagrange multiplier method. In: Proceedings of the international conference on applied physics and mathematics 2019. Chulalongkorn University, Bangkok, Thailand
Parshad RD, Upadhyay RK, Mishra S, Tiwari SK, Sharma S (2017) On the explosive instability in a three-species food chain model with modified Holling type IV functional response. Math Methods Appl Sci 40(16):5707–5726
Raw SN, Mishra P, Kumar R, Thakur S (2017) Complex behavior of prey–predator system exhibiting group defense: a mathematical modeling study. Chaos Solitons Fractals 100:74–90
Tuwankotta JM, Harjanto E (2019) Strange attractors in a predator–prey system with non-monotonic response function and periodic perturbation. J Comput Dyn 6(2):469
Tuwankotta JM, Harjanto E, Owen L (2018) Dynamics and bifurcations in a dynamical system of a predator–prey type with nonmonotonic response function and time-periodic variation. In: SEAMS school on dynamical systems and bifurcation analysis. Springer, pp 31–49
Upadhyay RK, Raw SN (2011) Complex dynamics of a three species food-chain model with Holling type IV functional response. Nonlinear Anal Modell Control 16(3):553–374
Wiggins S (2003) Introduction to applied nonlinear dynamical systems and chaos, vol 2. Springer, Berlin
Zhu H, Campbell SA, Wolkowicz GSK (2003) Bifurcation analysis of a predator-prey system with nonmonotonic functional response. SIAM J Appl Math 63(2):636–682
Acknowledgements
Livia Owen’s research is supported by Institute for Research and Community Service and Institute for Development and Innovation, Parahyangan Catholic University. Livia Owen acknowledges the financial support from The Indonesian Education Scholarship Program (LPDP), the Ministry of Finance of the Republic of Indonesia. J.M. Tuwankotta’s research is supported by the research grant P3MI FMIPA ITB 2021 from Institut Teknologi Bandung.
Author information
Authors and Affiliations
Corresponding author
Appendices
Proof of the Theorem 2
Without loss of generality, we assume that \(x_0 = 0\), \(y_0 = 0\), and \(\beta _0 = 0\). Using the Center Manifold Theorem (see [14, 23]) we can reduce System (2) to a single equation on the center manifold. Let us consider the coordinate transformation \(\varvec{\xi } = P \varvec{\nu }\) with:
\(\varvec{\xi } = \left( x, y \right) ^{\scriptscriptstyle T}\), and \(\varvec{\nu } = \left( u, v \right) ^{\scriptscriptstyle T}\).
Applying the transformation to System (2), we derive:
Here:
and
See Eq. (4) for the definition of A and B.
From the Center Manifold Theorem, for sufficiently small \(\delta \) there exists a function:
with \(V(0,0) = 0\), \(V_u (0,0) = 0\), and \(V_{\beta }(0,0) = 0\), so that System (21) can be written as:
where \(V = V(u, \beta )\) to shorten the notation.
All that remains is to check if these two conditions:
- (\(C_1\)):
-
\(h_{\beta }(0,0) \ne 0\), and
- (\(C_2\)):
-
\(h_{uu}(0,0) \ne 0\),
are satisfied. In that case, there exists a time-orientation preserving homeomorphism which maps its orbits of System (3.1) to the orbits of
This last equation is a normal form for fold bifurcation with unfolding parameter: \(\gamma \) (see Theorem 3.2 in [14]).
It is easy to see that
which implies that \(h_\beta (0,0) \ne 0\). Thus \((C_1)\) is satisfied.
Next, by applying the chain rule we have:
and
Let \(\varvec{e_1}\) and \(\varvec{e_2}\) be the unit vectors on x- and y- axis, respectively. Then, since
and
we have: \( f_u(0,0) = 0 = f_v(0,0)\). Since \(V(0,0) = 0\), we conclude that: \(h_u(0,0) = 0\) and
Lastly, from the definition of f in Eq. (22) we derive:
Thus, by the condition in Eq. (6), the nondegeneracy condition \((C_2)\) is satisfied.
Proof of Theorem 3
Recall that we have assumed that
-
1.
\((x_0, y_0, \lambda _0)\) is a solution of System (9), with \(\lambda _0 \not =0\),
-
2.
\(\alpha = \alpha _0\) is a solution of Eq. (11), and
-
3.
we have set: \(\beta _0 = G(x_0, y_0,\alpha _0)\).
Without loss of generality, we assume that \(x_0 = 0\), \(y_0= 0\), \(\alpha _0 = 0\) and \(\beta _0 = 0\). We will use the same notation for the Hessians (A and B), and for the matrix P as in the previous section; however, they are now \(\alpha \)-dependent.
Premise 1 in Theorem 3 guarantees that: \(\displaystyle \eta = F_x(0,0,0) + \lambda _0 F_y(0,0,0) \not =0\). Using a similar argument as in the previous section, we apply the coordinate transformation \(\varvec{\xi } = P \varvec{\nu }\) to System (8). Using the Center Manifold Theorem, we conclude that for a sufficiently small \(\delta \), there exists a function:
with
such that on the center manifold, the dynamics of System (8) is determined by:
where f as is defined in Eq. (22) but adjusted to include the second parameter.
If these four conditions, i.e.
- \((C_1)\):
-
\(h_{u} = 0\),
- \((C_2)\):
-
\(h_{uu} = 0\),
- \((C_3)\):
-
\(h_{uuu} \ne 0\), and
- \((C_4)\):
-
\(h_{\beta } h_{u \alpha } - h_{\alpha } h_{u\beta } \ne 0\),
are satisfied, then System (24) is topologically equivalent to the normal form of cusp bifurcation:
To simplify the notation, we will write V for \(V(u, \alpha , \beta )\), h for \(h(u,\alpha , \beta )\) and f for \(f(u,V(u,\alpha ,\beta ),\alpha )\). Using the chain rule, we compute:
Using a similar argument as in the previous subsection, \(f_u\) and \(f_v\) are both vanishing. Thus, we conclude \((C_1)\).
Next, we compute the derivative of Eq. (25) with respect to u, i.e.:
From Eq. (23), at \((u,\alpha ,\beta ) = (0,0,0)\) we derive: \(h_{uu}(0,0,0) = f_{uu}(0,0,0)\). By premise 2 in Theorem (3) we have:
where A and B are the Hessians of F and G respectively.
Let us carry on with computing the derivative of Eq. (26) with respect to u:
Applying Eq. (23), we have:
Writing,
we have:
where:
all evaluated at (0, 0, 0). Thus, \((C_3)\) follows from premise 3 of Theorem 3.
Lastly, since:
and furthermore:
then, at (0, 0, 0):
Thus, condition \((C_4)\) follows from premise 4 of Theorem 3.
Rights and permissions
About this article
Cite this article
Owen, L., Tuwankotta, J.M. Computation of fold and cusp bifurcation points in a system of ordinary differential equations using the Lagrange multiplier method. Int. J. Dynam. Control 10, 363–376 (2022). https://doi.org/10.1007/s40435-021-00821-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40435-021-00821-4
Keywords
- Fold bifurcation
- Cusp bifurcation
- Lagrange multiplier method
- Ordinary differential equations
- Dynamical system