^{1}

^{1}

^{*}

In the present paper , a custom algorithm based on the method of orthogonal collocation on finite elements is presented and used for the location of global homoclinic point-to-point asymptotic connecting orbits. This kind of global bifurcation occurs in a large variety of problems in Applied Sciences, being associated to specific, significant physical aspects of the problem under consideration. In order to confront the difficulties faced when the location of such orbits is attempted, high order boundary conditions are constructed through scale order approximations, and used instead of the more common first order ones. The effectiveness of the implemented algorithm is justified by means of the specific applications and the figures presented.

In recent years, the improvement of hardware capabilities, such as operational CPU frequency, the increasing amount of RAM equipped, the use of parallelization and the improvement of symbolic mathematical software has enabled researchers to numerically compute global asymptotic orbits more easily, since their computation constitutes a computationally demanding task, even in the case of low dimensional systems. Homoclinic point-to-point connecting orbits arise in various occasions where hysteresis and saturation phenomena are encountered. Also, these orbits act as separatrices for the nonlinear state space in 2D conservative ODEs, since they divide the phase space into regions of periodic and non-periodic solutions, respectively, as it is known. In that sense, we can consider homoclinic orbits as the limit of periodic solutions, that is a periodic orbit with infinite fundamental period, while it remains bounded.

In the present paper, we present an algorithm for the numerical computation of global homoclinic asymptotic point-to-point connecting orbits (homoclinic P2P orbits for short from now on), where the evaluation of high order boundary conditions (BC from now on) is involved. It is well known that the projection method converges exponentially with the increase of the truncation interval, which in turn, however, can increase the computational time (mainly in ordinary PCs with low to moderate CPU power such as an Intel Core i7 870). So, the use of high order BC can be proved useful in cases like that. In Section 2, a brief description of the algorithm is given and in Section 3 the procedure of the extraction of high order BC is presented. The algorithm is applied to the Lorenz system (Section 4), as well as to a three-species food chain model with group defence ecosystem (Section 5), both being three dimensional cases of dynamical systems. The analysis is carried out with the aid of MathworksMatlab and the symbolic engine of Maplesoft Maple, by means of which we also obtain the respective graphs.

The well-known algorithm of orthogonal collocation on finite elements (widely used in the famous software AUTO86 (see [

x ˙ = f ( x ; a ) , x ∈ ℝ n , a ∈ ℝ , f : ℝ n + 1 → ℝ n (1)

With x = ( x 1 , ... , x n ) T the vector of state variables and a a parameter of the system, the infinite time horizon ( − ∞ , + ∞ ) is generally truncated to [ T − , T + ] , so that by setting τ = t / ( T + − T − ) , (1) is transformed to (see [

y ˙ = ( T + − T − ) f ( y ; α ) , y = y ( τ ) (2)

together with an integral phase condition (see below). Here we have chosen a symmetrically truncated time interval, that is T + = − T − = T . Then, through the appropriate normalization, the independent variable of time is scaled to [ 0 , 1 ] and the system is further reduced to

y ˙ = 2 T f ( y ; α ) (3)

Thus after defining the maximal degree of the orthogonal basis polynomials (the Legendre polynomials here), the time interval [ 0 , 1 ] is divided into N − 1 subintervals-elements, [ τ i , τ i + 1 ] , i = 1 , .. , N − 1 . Moreover, the solution of the differential system is approximated by a weighted sum of the basis polynomials

y i ( τ ) = ∑ l = 0 m c i , l P i , l ( τ ) , i = 1 , .. , N − 1 , y i ∈ ℝ n (4)

in each time subinterval, where P i , l ( τ ) are the Legendre polynomials of degree l and the coefficients c i , l must be determined. The positions of the collocation points, τ i , j , j = 1 , ... , m , being m internal points in each time subinterval (See

d y i d τ | τ i , j = 2 T f [ y i ( τ i , j ) ] (5)

for i = 1 , .. , N − 1 , j = 1 , .. , m and τ the scaled independent variable of time. By setting

y i , j = y i ( τ i , j ) , i = 1 , .. , N − 1 , j = 1 , .. , m

then the requirement that the solution be continuous within the whole time interval, leads to the associated n ( N − 2 ) continuation (matching) conditions

y i − 1 , m = y i , 0 , i = 2 , .. , N − 1 (6)

where y i , 0 = y i ( τ i ) , i = 1 , .. , N − 1 . Also, the discrete counterparts of the BC that are used for the location of limit cycles are the n equations

y 1 , 0 = y N − 1 , m (7)

A technique for the determination of high order BC in the case of homoclinic orbits will be described below.

Finally, the discrete counterpart of an integral type phase condition is utilized for both limit cycles and homoclinic orbits; the continuous form of this condition is (See [

∫ 0 1 y ^ ˙ ( τ ) T [ y ( τ ) − y ^ ( τ ) ] d τ = 0 (8)

where the approximation y ^ ˙ ( τ ) ≈ f ( y ( τ ) ) is used. Note that for the location of limit cycles, by the time normalization τ = t / T p , mapping [ 0 , T p ] to [ 0 , 1 ] , with T p the fundamental period of the limit cycle, the original system (1) is transformed to

u ˙ = T p f ( u ; α ) , u = u ( τ ) (9)

Also, (5) becomes

d y i d τ | τ i , j = T p f [ y i ( τ i , j ) ] (10)

So, the period appears explicitly as a system parameter to benefit the numerical continuation performed. Now, by using the Gauss-Legendre quadrature, the discrete counterpart of the integral phase condition (8) takes the form

∑ i = 1 N − 1 ∑ j = 0 m ω i , j 〈 y i , j − y ^ i , j , v ˙ i , j 〉 = 0 (11)

where ω i , j denote the Gauss-Legendre quadrature coefficients-weights, v ˙ i , j , y ^ i , j are the values of the derivatives and the points of the computed orbit itself at a previous step, respectively, and y i , j are the points to be determined. This condition has certain advantages over the Poincaré type, scalar ones, especially when continuation of the orbit of interest is carried out. So, counting up the number of the unknowns and the number of the equations for the case of limit cycle location, we deduce that the problem is well-posed, since these numbers are equal.

Both the well-known and widely used techniques of projection BC and the method of eigenvectors [

We consider a dynamical differential system of the form (1) which possesses a number of equilibrium points, and let x 0 = ( x 1 0 , x 2 0 , .. , x n 0 ) T be the fixed point of interest (i.e. the one associated with the homoclinic P2P orbit). Then by setting

ξ i = x i − x i 0 , i = 1 , ... , n (12)

we expand the right-hand side of (1) in a Taylor series and keep terms up to the fourth order, that is

ξ ˙ i = h i ( ξ 1 , ... , ξ n ; a ) , i = 1 , ... , n (13)

with h i polynomial functions of ξ 1 , ... , ξ n , of order less or equal to four. Moreover, assuming ξ i ( t ) , i = 1 , ... , n , can be approximated up to the order of interest in positive integerpowers of a small amplitude orbital parameter, let it be ε , as

ξ i ( t ) ≈ ∑ j = 1 k ε j ξ i , j ( t ) (14)

where k is the desired order of approximation. Then, substituting (14) in the expanded equations (13) and equating the terms of the same order, we derive k respective linear (with regard to the variables ( ξ i , j , i = 1 , ... , n ) corresponding to the j − order, j = 1 , ... , k ) scale order systems. Further assuming the fixed point of interest is hyperbolic (i.e. no eigenvalue associated with it, is trivial), the respective systems are solved successively. Then, in order to substitute the solutions associated with a specific order to the higher order systems, all the integration constants which are not associated with the manifold of interest (the high order approximation of which is sought), as well as the integration constants corresponding to the homogeneous part of the respective 2^{nd} and higher order systems are set equal to zero. Finally, the total solution up to the desired order, k , is given by the n sums of (14).

More precisely, regarding the scale order approximations of the outgoing (incoming) solution vector, associated with the unstable (stable) manifold of the equilibrium (to which the orbit under consideration is homoclinic), by considering the solutions of the respective systems, we remove the homogeneous part of the solution ( j ≥ 2 , j = 1 , ... , k ) and set the integration constants corresponding to the eigenvalues with negative (positive) real part equal to zero. Then, we define the high order BC for the computation of the homoclinic orbit, in the form

C i , 0 [ y 1 i ( τ = 0 ) − ξ i o u t ] 2 + C i , 1 [ y N − 1 i ( τ = 1 ) − ξ i i n ] 2 = 0 , i = 1 , ... , n (15)

where the upper index in y 1 and y N − 1 denotes the i -coordinate of these vector functions, ( C i , 0 , C i , 1 ) are some positive weighting coefficients (set equal to 1 for the applications under consideration in this paper)and ( ξ i o u t , ξ i i n ) have been evaluated via (14).

Equation (15) are differentiable, so that the standard iterative correcting methods of Jacobian based solvers can be used during the solution procedure. By employing the aforementioned high order BC a computation of the homoclinic orbit of interest is achieved and this type of BC can be proved useful in cases like those mentioned in the introduction. Ideally (that is when (15) is zero for all i = 1 , ... , n ), both the start and endpoints are equal to the ones defined through the high order BC presented above and the corresponding relations are differentiable, so that standard iterative correcting, Jacobian based solvers can be used during the solution procedure. All the aforementioned coefficients have been set equal to 1 for the applications under consideration in this work.

In general, considering the system (1) (with a ∈ ℝ p ), we should determine the number of control parameters, p , for which the connecting orbits are isolated and structurally stable phenomena. The fixed points x − , x + associated with the global connecting orbit are in fact two invariant sets of the system, M − , M + ⊂ ℝ n + p , respectively, and the orbit γ = { ( x ( t ) , a ) : t ∈ ℝ } is called a connecting orbit from M − to M + if

d i s t ( z ( t ) , M ± ) → 0 as t → ± ∞ (16)

where z = ( x , a ) is the connecting orbit pair. More specifically, for the a − and ω − limit sets it holds that

a ( γ ) ⊂ M − , ω ( γ ) ⊂ M + (17)

So, if a ( γ ) = ω ( γ ) , the connecting orbit is called homoclinic. It is called heteroclinic, otherwise. Assuming that M ± are adequately smooth invariant manifolds of dimensions n ± c + p , where n ± c denote the dimensions of the manifolds M ± ( a ) in the following decomposition (See [

M = ∪ a ∈ Π ( M ( a ) × { a } ) (18)

where Π ⊂ ℝ p is compact and M ( a ) are compact invariant sets of the system. If we further assume that M ± ( a ) , a ∈ Π have unstable manifolds M ± u ( a ) and stable manifolds M ± s ( a ) with dimensions n ± c + n ± u and n ± c + n ± s , respectively, and M ± ( a ) also have a hyperbolic structure (so that these are independent of a ∈ Π ), then n = n ± c + n ± s + n ± u . However, for the steady case, since M ± ( a ) are hyperbolic equilibria of (1) (assumed throughout the present paper unless stated otherwise), that is

M + ( a ) = x + ( a ) , M − ( a ) = x − ( a ) (19)

we have that n + c = n − c = 0 , so n ± u = n − n ± s . Whenever M u ( x − ) and M s ( x + ) intersect in at least one point, they intersect in at least one orbit by uniqueness of solutions to the initial value problem and

γ ⊂ M − u ∩ M + s , where M − u = ∪ a ( M − u ( a ) × { a } ) , M + s = ∪ a ( M + s ( a ) × { a } )

Then we expect the orbit γ to be an isolated connecting orbit if

T z ( t ) M − u ∩ T z ( t ) M + s = T z ( t ) γ = s p a n { z ˙ ( t ) } for all t ∈ ℝ (20)

for the tangent spaces at z ( t ) . Furthermore, the connecting orbit is persistent in p − parametric systems as long as the intersection is transversal [

T z ( t ) M − u + T z ( t ) M + s = ℝ n + p (21)

So, based on (20) and (21), the sum of dimensions results in

p + n − u + n − c + n + s + n + c + p − 1 = n + p (22)

or (since n + c = n − c = 0 )

p = n + u − n − u + 1. (23)

A more thorough explanation lies in the field of differential topology and more specifically according to transversality theorem of the homonymous theory, when two manifolds of dimensions k and l intersect in an n − dimensional space, then generally their intersection will be a manifold of dimension k + l − n (See [

The first application of the methodology presented in this paper is on the well-known Lorenz model [

x ˙ = − σ x + σ y y ˙ = r x − y − x z z ˙ = − b z + x y (24)

We choose the standard parameter values σ = 10 , b = 8 / 3 and use r as the bifurcation parameter.

As it is known, the system possesses three equilibria, one at the origin, E 0 ( 0 , 0 , 0 ) and two nonzero ones (see [

E + ( b ( r − 1 ) , b ( r − 1 ) , r − 1 ) , E − ( − b ( r − 1 ) , − b ( r − 1 ) , r − 1 )

By using the Liu criterion [

J = ( − σ σ 0 r − z − 1 − x y x − b ) (25)

so that

J E + = ( − σ σ 0 1 − 1 − b ( r − 1 ) b ( r − 1 ) b ( r − 1 ) − b ) (26)

Then by writing the characteristic polynomial

λ 3 + p 2 λ 2 + p 1 λ + p 0 = 0 (27)

where p 0 = 2 b σ ( r − 1 ) , p 1 = b ( σ + r ) , p 2 = σ + b + 1 , the above mentioned criterion yields

p 0 > 0 → r > 1 p 1 > 0 → b ( σ + r ) > 0 D 2 ≜ p 1 p 2 − p 0 = 0 → r = r c r = 2 σ + ( σ + b + 1 ) σ σ − 1 − b , (28)

hence a Hopf bifurcation takes place, which is subcritical, since the first Lyapunov coefficient is evaluated l 1 ( r c r ) ≃ 2.55 × 10 − 3 > 0 . The limit cycles are continued up to one close enough to the saddle equilibrium E 0 ( 0 , 0 , 0 ) . The numerical continuation for both applications presented in this work has been carried out by means of a custom algorithm of sequential numerical continuation based on the method of orthogonal collocation on finite elements and the integral phase condition (8). (Also, the numerical continuation can be performed by means of the well-known numerical toolbox MATCONT [

λ 1 , 2 = 0.5 × [ − σ − 1 ± ( σ − 1 ) 2 + 4 σ r ] , λ 3 = − b

The continued limit cycles are presented in

As soon as the numerically continued cycles are close enough to the fixed point of interest and the free parameter remains practically unchanged, then the main computation of the homoclinic connecting orbit can be initiated, as the former (the largest cycle) can be considered as a good initial approximation of the latter.

Let us describe the definition and application of high order BC. Assuming the solutions of the dynamical differential system of interest can be approximated by

x ( t ) ≈ ∑ i = 1 k ε j x j ( t ) , y ( t ) ≈ ∑ i = 1 k ε j y j ( t ) , z ( t ) ≈ ∑ i = 1 k ε j z j ( t ) (29)

where ε denotes the orbital parameter and k is the desired order of approximation. Then, by substituting (29) into (24) and equating the terms of the same order, we get the respective linear (as regards the variables ( x j , y j , z j ) corresponding to the j -order, j = 1 , ... , k ) systems. In terms of the present analysis the desired order of approximation has been chosen as k = 4 , so that we obtain

1^{st} order approximation

x ˙ 1 = − σ x 1 + σ y 1 y ˙ 1 = r x 1 − y 1 z ˙ 1 = − b z 1 (30)

2^{nd} order approximation

x ˙ 2 = − σ x 2 + σ y 2 y ˙ 2 = r x 2 − y 2 − x 1 z 1 z ˙ 2 = − b z 2 + x 1 y 1 (31)

3^{rd} order approximation

x ˙ 3 = − σ x 3 + σ y 3 y ˙ 3 = r x 3 − y 3 − x 1 z 2 − x 2 z 1 z ˙ 3 = − b z 3 + x 1 y 2 + x 2 y 1 (32)

4^{th} order approximation

x ˙ 4 = − σ x 4 + σ y 4 y ˙ 4 = r x 4 − y 4 − x 1 z 3 − x 2 z 2 − x 3 z 1 z ˙ 4 = − b z 4 + x 1 y 3 + x 2 y 2 + x 3 y 1 (33)

By means of the procedure described in Section 3, we arrive at the approximations of both the outgoing (locally asymptotically unstable) vector solution and the incoming (locally asymptotically stable) one. Then, by using (30), the total solution up to the fourth order is given by

x ( t ) ≈ ε x 1 ( t ) + ε 2 x 2 ( t ) + ε 3 x 3 ( t ) + ε 4 x 4 ( t ) y ( t ) ≈ ε y 1 ( t ) + ε 2 y 2 ( t ) + ε 3 y 3 ( t ) + ε 4 y 4 ( t ) z ( t ) ≈ ε z 1 ( t ) + ε 2 z 2 ( t ) + ε 3 z 3 ( t ) + ε 4 z 4 ( t ) (34)

where ( x , y , z ) represent the outgoing or the incoming solution and ( x j , y j , z j ) , j = 1 , 2 , 3 , 4 stand for ( x j o u t , y j o u t , z j o u t ) or ( x j i n , y j i n , z j i n ) , respectively.

Moreover, since all the demanded calculations can be lengthy even for low dimensional systems, the above approximations can be obtained via a symbolic computational package, such as Mathematica or Maplesoft Maple (which offers direct integration with MathworksMatlab). We present below the solutions associated with the outgoing vectors:

1^{st} order approximation

x 1 ( t ) = c 1 e 1 2 ( − 11 + 81 + 40 r ) t + c 2 e − 1 2 ( 11 + 81 + 40 r ) t y 1 ( t ) = ( 9 20 + 1 20 81 + 40 r ) c 1 e 1 2 ( − 11 + 81 + 40 r ) t + ( 9 20 − 1 20 81 + 40 r ) c 2 e − 1 2 ( 11 + 81 + 40 r ) t z 1 ( t ) = c 3 e − 8 3 t (35)

where c 1 , c 2 , c 3 denote the integration constants (from now on c i , i = 1 , 2 , 3 , 4 , ... will denote integration constants, unless stated otherwise). By setting c 2 = c 3 = 0 we obtain the first order approximation of the outgoing solution vector

x 1 o u t = c 1 e 1 2 ( − 11 + 81 + 40 r ) t y 1 o u t = ( 9 20 + 1 20 81 + 40 r ) c 1 e 1 2 ( − 11 + 81 + 40 r ) t z 1 o u t = 0 (36)

2^{nd} order approximation

x 2 ( t ) = c 4 e 1 2 ( − 11 + 81 + 40 r ) t + c 5 e − 1 2 ( 11 + 81 + 40 r ) t y 2 ( t ) = ( 9 20 + 1 20 81 + 40 r ) c 4 e 1 2 ( − 11 + 81 + 40 r ) t + ( 9 20 − 1 20 81 + 40 r ) c 5 e − 1 2 ( 11 + 81 + 40 r ) t z 2 ( t ) = ( 3 160 ( 25 + 3 81 + 40 r ) ( 9 + 81 + 40 r ) e 1 3 ( − 25 + 3 81 + 40 r ) t 13 + 45 r c 1 2 + c 6 ) e − 8 3 t (37)

and setting c 4 = c 5 = c 6 = 0 we get the second order approximation

x 2 o u t ( t ) = 0 y 2 o u t ( t ) = 0 z 2 o u t ( t ) = 3 160 ( 25 + 3 81 + 40 r ) ( 9 + 81 + 40 r ) 13 + 45 r c 1 2 e ( − 11 + 81 + 40 r ) t (38)

Regarding the next orders of approximation, only the outgoing solution vectors are presented, since the formulae of the respective full solutions are quite lengthy. However, the symbolic engine of Maplesoft Maple proved excellent at handling them.

3^{rd} order approximation

x 3 o u t = C x , 3 c 1 3 e 3 2 ( − 11 + 81 + 40 r ) t y 3 o u t = C y , 3 c 1 3 e 3 2 ( − 11 + 81 + 40 r ) t z 3 o u t = 0 (39)

where

C x , 3 = 1 16 − 720 r 2 + ( − 609 81 + 40 r − 10503 ) r − 2262 81 + 40 r − 20358 ( r − 1 ) ( 160 r + 203 ) ( 13 + 45 r )

C y , 3 = 1 80 ( − 540 81 + 40 r − 15930 ) r 2 + ( − 5898 81 + 40 r − 70722 ) r − 7917 81 + 40 r − 71253 ( r − 1 ) ( 160 r + 203 ) ( 13 + 45 r )

4^{th} order approximation

x 4 o u t = 0 y 4 o u t = 0 z 4 o u t = C z , 4 c 1 4 e [ 2 3 ( 3 81 + 40 r − 29 ) − 8 3 ] t (40)

where c 1 can be user defined and

C z , 4 = − 9 640 ( 3 81 + 40 r + 29 ) ( 120 r 2 81 + 40 r + 3940 r 2 + 1649 r 81 + 40 r + 21551 r + 316 81 + 40 r + 27144 ) ( 45 r − 14 ) ( r − 1 ) ( 160 r + 203 ) ( 45 r + 13 )

Similarly, the expressions of the incoming vector can be set, as well. There, the integration constants associated with the unstable eigenvalues must be set equal to zero. Via the method of orthogonal collocation on finite elements and 4^{th} orderBC as described above, the homoclinic connecting orbit of interest has been located inside the truncated time interval [ − 7.2018 , 7.2018 ] , which has been determined by means of the well-known Beyn’s method [

The model used to describe a food-chain with group defense ecosystem is an instantaneous one (i.e. no time delays appear), expressed by the system of autonomous ordinary differential equations (See [

x ˙ = x g ( x , K ) − y p ( x ) y ˙ = y [ − r + c p ( x ) ] − z q ( y ) z ˙ = z [ − s + d q ( y ) ] (41)

with x ( 0 ) ≥ 0 , y ( 0 ) ≥ 0 , z ( 0 ) ≥ 0 . Here x ( t ) denotes the prey population,

y ( t ) denotes the intermediate population which feeds upon x and z ( t ) denotes the top predator population that feeds upon y . Additionally, K , r , c , d are positive constants and g , p , q are analytic functions. More specifically, K denotes the carrying capacity of the environment and will be used as the bifurcation parameter (active parameter). The function g ( x , K ) denotes the specific growth rate of the prey in the absence of predation, p ( x ) denotes the predator functional response and q ( y ) a predator functional response of z on y . In the present analysis logistic growth rate is considered for g , that is g ( x , K ) = 1 − x / K , p ( x ) = x e − x and q ( y ) = y . These choices satisfy certain conditions mentioned in [

x ˙ = x − 1 K x 2 − x y e − x y ˙ = − r y + c x y e − x − y z z ˙ = − s z + d y z (42)

The system (42) possesses four types of fixed points. More precisely we have

E 0 ( 0 , 0 , 0 ) , E K ( K , 0 , 0 ) E h ( x h , y h , 0 ) , x h e − x h = r c , y h = c r x h ( 1 − x h K ) ( oneortwo ) E * ( x * , y * , z * ) ( none,oneortwo ) (43)

The latter is an internal equilibrium (i.e. in general it might or might not be an equilibrium of (42)), where

1 − x * K − s d e − x * = 0 , y * = s d , z * = c d s x * ( 1 − x * K ) − r (44)

with x * > 0 , y * > 0 , z * > 0 . Thus regarding the fixed point E * , by evaluating the Jacobianmatrix J E * ( x * , K ) , then the third equation of (28) together with (44) yield the critical equilibrium, as well as the critical value of the active parameter K . In particular, by setting ( r , c , s , d ) = ( 0.28 , 1 , 0.5 , 0.38 ) , we get

x c r * ≃ 1.0000000 , K c r ≃ 1.9381794269... y c r * ≃ 1.31579 , z c r * ≃ 0.0878794 (45)

Also, the corresponding critical eigenvalues are

λ 1 , 2 = ± 0.209618 i , λ 3 , s = − 0.0318962 (46)

Note that there is a second solution of the system of the third equation of (28) together with (44), be it x = K − 1 . This solution is rejected, as the fixed point associated with it possesses two purely imaginary eigenvalues together with a trivial one, that is the first and second inequality of (28) do not hold.

Additionally, the transversality condition

d ( p 1 p 2 − p 0 ) d K | K = K c r ≠ 0

is verified numerically. Then by computing the first Lyapunov coefficient at K = K c r , l 1 ( K c r ) = − 9.697250 < 0 , we conclude with the occurrence of a supercritical Hopf bifurcation. Thus, a stable limit cycle bifurcates from the equilibrium and it is numerically continued towards the direction of increasing period. The sought homoclinic orbit, associated with the equilibrium E h , will constitute a structurally stable phenomenon for the system of interest for p = 1 according to (23). The aforementioned numerically continued limit cycles are presented in

We briefly present the corresponding scale order systems. Thus regarding a system fixed point E ( x 0 , y 0 , z 0 ) , ( x 0 , y 0 ) ≠ ( 0 , 0 ) , that is E h or E * , by setting

u = x − x 0 , v = y − y 0 , w = z − z 0 (47)

expanding the right-hand sides of (42) in Taylor series around E and keeping

terms up to the fourth order (hence, finally 4^{th} order BC are extracted) we have

u ˙ = H 1 u + H 2 v + 1 2 H 11 u 2 + H 12 u v + 1 6 H 111 u 3 + 1 2 H 112 u 2 v + 1 24 H 1111 u 4 + 1 6 H 1112 u 3 v v ˙ = Q 1 u + Q 2 v + Q 3 w + 1 2 Q 11 u 2 + Q 12 u v + Q 23 v w + 1 6 Q 111 u 3 + 1 2 Q 112 u 2 v + 1 24 Q 1111 u 4 + 1 6 Q 1112 u 3 v w ˙ = L 2 v + L 3 w + L 23 v w (48)

where

H 1 = K − 1 K x 0 − 1 K x 0 2 , H 2 = − x 0 y 0 ( 1 − x 0 K ) , H 11 = 2 K − 1 K − K + 2 K x 0 + 1 K x 0 2

H 12 = 1 y 0 ( − 1 + K + 1 K x 0 − 1 K x 0 2 ) , H 111 = − 3 + K + 3 K x 0 − 1 K x 0 2

H 11 2 = 1 y 0 ( 2 − K + 2 K x 0 + 1 K x 0 2 ) , H 1111 = 4 − K + 4 K x 0 + 1 K x 0 2 , H 1112 = H 111 y 0

Q 1 = − c y 0 H 12 , Q 2 = − r − z 0 + c x 0 y 0 ( 1 − x 0 K ) , Q 3 = − y 0

Q 11 = − c y 0 H 112 , Q 12 = − c H 12 , Q 23 = − 1 , Q 111 = − c H 111 , Q 112 = − c H 112

Q 1111 = − c H 1111 , Q 1112 = − c H 111 y 0 , L 2 = d z 0 , L 3 = − s + d y 0 , L 2 3 = d

Then, for ( x 0 , y 0 , z 0 ) = ( x h , y h , 0 ) , where ( x h , y h ) are given by (43), by substituting (14) in (48) with k = 4 , ( ξ 1 , ξ 2 , ξ 3 ) = ( u , v , w ) and ( u j , v j , w j ) , j = 1 , 2 , 3 , 4 denoting the successive approximations of the state variables, we take the following scale order systems:

1^{st} order approximation

u ˙ 1 = H 1 u 1 + H 2 v 1 v ˙ 1 = Q 1 u 1 + Q 2 v 1 + Q 3 w 1 w ˙ 1 = L 2 v 1 + L 3 w 1 (49)

2^{nd }order approximation

u ˙ 2 = H 1 u 2 + H 2 v 2 + 1 2 H 11 u 1 2 + H 12 u 1 v 1 v ˙ 2 = Q 1 u 2 + Q 2 v 2 + Q 3 w 2 + 1 2 Q 11 u 1 2 + Q 12 u 1 v 1 + Q 23 v 1 w 1 w ˙ 2 = L 2 v 2 + L 3 w 2 + L 23 v 1 w 1 (50)

3^{rd} order approximation

u ˙ 3 = H 1 u 3 + H 2 v 3 + H 11 u 1 u 2 + H 12 ( u 1 v 2 + u 2 v 1 ) + 1 6 H 111 u 1 3 + 1 2 H 112 u 1 2 v 1 v ˙ 3 = Q 1 u 3 + Q 2 v 3 + Q 3 w 3 + Q 11 u 1 u 2 + Q 12 ( u 1 v 2 + u 2 v 1 ) + Q 23 ( v 1 w 2 + v 2 w 1 ) + 1 6 Q 111 u 1 3 + 1 2 Q 112 u 1 2 v 1 w ˙ 3 = L 2 v 3 + L 3 w 3 + L 23 ( v 1 w 2 + v 2 w 1 ) (51)

4^{th} order approximation

For ( r , c , s , d ) = ( 0.28 , 1 , 0.5 , 0.38 ) , the homoclinic orbit of interest is numerically computed within the truncated time interval [ − 831.2371 , 831.2371 ] with the value of the active parameter being equal to K h ≃ 2.080116.. . Then, we have E h ( 1.93101 , 0.494357 , 0 ) and the respective homoclinic orbit is presented in

Firstly, an efficient custom algorithm of orthogonal collocation on finite elements implemented in MathworksMatlab has been presented together with two

applications in different fields of Applied Mathematics, be them the well-known Lorenz system and a model of a three-species food chain with group defence ecosystem. As a result, global homoclinic asymptotic point-to-point connecting orbits have been obtained numerically, regarding the specific applications. In both cases an initial approximation of the homoclinic connecting orbits of interest has been acquired by continuing limit cycles, which have emerged from a Hopf bifurcation, numerically up to a high value of the fundamental period of them.

The efficiency of the algorithm also lies in the fact that all the required equations (that is, the collocation equations, the continuity equations, the BC and the phase condition) are converted to Matlab functions automatically, so that integrated, sophisticated Matlab routines used for solving systems of nonlinear algebraic equations, as well as optimization routines or any other relevant, user-defined routines can be applied directly for the solution of the aforementioned system of nonlinear algebraic equations. Furthermore, the high order BC defined and used herein can be useful when ordinary PCs of low to moderate computational power are used for the location of homoclinic orbits, as they did not require the increase of the length of the truncation interval in order to achieve the precision sought for the computation.

Finally, regarding the equilibrium point E * of the ecosystem model, the physical meaning of the homoclinic orbit is that if the carrying capacity K is increased (i.e. if enrichment is attempted) above the critical value K c r (leading to a supercritical Hopf bifurcation), then it approaches a limiting value, that of the homoclinic orbit, where the top predator is extinct (i.e. it eventually dies out). So, enrichment needs to be carried out with caution and occasions like that have to be taken seriously into account. Moreover, the homoclinic orbit of the Lorenz system can also be seen as a pure mathematical result as well, while also it serves as validation study of the implemented algorithm and the whole methodology presented in this paper.

P.S. Douris is pleased to acknowledge his financial support from “Andreas Mentzelopoulos Scholarships for the University of Patras”.

The authors declare that there is no conflict of interest regarding the publication of this paper.

Douris, P.S. and Markakis, M.P. (2018) High Order Boundary Conditions Technique for the Computation of Global Homoclinic Bifurcation. Journal of Applied Mathematics and Physics, 6, 554-572. https://doi.org/10.4236/jamp.2018.63049