Continuation of homoclinic orbits in the suspension bridge equation: a computer-assisted proof
Jan Bouwe van den Berg, Maxime Breden, Jean-Philippe Lessard and, Maxime Murray

TL;DR
This paper proves the existence of symmetric homoclinic orbits in the suspension bridge equation across a range of parameters using a computer-assisted method involving Chebyshev series and contraction theorems.
Contribution
It introduces a computer-assisted proof technique for homoclinic orbits in a nonlinear differential equation, combining the uniform contraction theorem and radii polynomial approach.
Findings
Existence of symmetric homoclinic orbits for all β in [0.5, 1.9]
Effective parameterization of stable manifolds
Validated solutions using a contraction mapping approach
Abstract
In this paper, we prove existence of symmetric homoclinic orbits for the suspension bridge equation for all parameter values . For each , a parameterization of the stable manifold is computed and the symmetric homoclinic orbits are obtained by solving a projected boundary value problem using Chebyshev series. The proof is computer-assisted and combines the uniform contraction theorem and the radii polynomial approach, which provides an efficient means of determining a set, centered at a numerical approximation of a solution, on which a Newton-like operator is a contraction.
| Coefficients for | |
|---|---|
| Coefficients for | |
| Coefficients for | |
| Coefficients for | |
| Coefficients in front of , for | |
|---|---|
| Coefficients in front of , for | |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods for differential equations · Control and Stability of Dynamical Systems · Stability and Controllability of Differential Equations
Continuation of homoclinic orbits in the suspension bridge equation: a computer-assisted proof
Jan Bouwe van den Berg 111VU University Amsterdam, Department of Mathematics, De Boelelaan 1081, 1081 HV Amsterdam, The Netherlands. [email protected]
Maxime Breden 222CMLA, ENS Cachan, CNRS, Université Paris-Saclay, 94235 Cachan, France and Université Laval, Département de Mathématiques et de Statistique, 1045 avenue de la Médecine, Québec, QC, G1V0A6, Canada. [email protected]
Jean-Philippe Lessard 333Université Laval, Département de Mathématiques et de Statistique, 1045 avenue de la Médecine, Québec, QC, G1V0A6, Canada. [email protected].
Maxime Murray 444Florida Atlantic University, Department of Mathematical Sciences, Science Building, Room 234, 777 Glades Road, Boca Raton, Florida, 33431 , USA. [email protected]
Abstract
In this paper, we prove existence of symmetric homoclinic orbits for the suspension bridge equation for all parameter values . For each , a parameterization of the stable manifold is computed and the symmetric homoclinic orbits are obtained by solving a projected boundary value problem using Chebyshev series. The proof is computer-assisted and combines the uniform contraction theorem and the radii polynomial approach, which provides an efficient means of determining a set, centered at a numerical approximation of a solution, on which a Newton-like operator is a contraction.
Key words. Suspension bridge equation, traveling waves, contraction mapping, rigorous numerics, symmetric homoclinic orbits, stable manifolds
1 Introduction
One of the simplest models [15, 12] for a suspension bridge is the partial differential equation (PDE)
[TABLE]
Here describes the deflection of the roadway from the rest state as a function of time and the spatial variable (in the direction of traffic). This paper is concerned with traveling wave solutions of (1.1), i.e., solutions describing a disturbance with profile propagating at velocity along the surface of the bridge. In particular, we apply a computer-assisted proof method to show that there is a large range of velocities for which such a solitary wave exists.
Looking for traveling waves of (1.1) with wave speed leads to the ordinary differential equation
[TABLE]
For large positive and negative values of the independent variable we assume the solution to converge to the equilibrium . Due to the reversibility symmetry of the PDE in both time and space, we may restrict our attention to symmetric solutions. Hence, setting , we are looking for symmetric homoclinic orbits satisfying
[TABLE]
Fourth order differential equations of the form for various nonlinearities have been studied extensively. For the bistable nonlinearity the equation is a standard model in pattern formation, called the Swift-Hohenberg equation (see [18] and references therein), whereas the quadratic nonlinearity appears, for example, in the study of water waves [4]. For the piecewise linear case homoclinic solutions were obtained in [15, 8]. For the problem with the exponential nonlinearity a family of periodic solutions was established in [17].
In [8] the question about existence of a symmetric homoclinic orbit of (1.3) is raised. This question was addressed by variational methods in [21], where the authors proved the result for almost all parameter values . In [20] the existence of homoclinic orbits was demonstrated for all , again using variational methods as well as intricate estimates on the second variation. In a different direction, using a computer-assisted proof, it was proven in [3] that (1.3) has at least 36 homoclinic solutions for the single parameter value .
In the present paper we complement the above results by proving the following.
Theorem 1**.**
For all parameter values there exists a symmetric homoclinic orbit of (1.3).
We remark that for the origin is a saddle-focus, while for it is a saddle-center. Furthermore, we note the integral identity . Since the right hand side is non-positive, homoclinic orbits are excluded for . It is thus expected that the parameter range for which homoclinics exist is , or, equivalently, wave speeds . Our method for proving the result in Theorem 1 is computer-assisted. While it can certainly be extended somewhat beyond the interval , it is not possible to cover the entire range in this way. Indeed, as decreases towards [math] the amplitude of the solution diverges ( becomes very negative), whereas when tends to the homoclinic orbit collapses onto the trivial solution. In both limit regimes computer-assisted proofs become harder and harder. Since the result in [20] already covers the range , we thus focus on the parameter range . We note that at a Hamiltonian-Hopf bifurcation occurs. In future work we intend to unfold this bifurcation and subsequently connect the homoclinic orbit that bifurcates to the branch covered by Theorem 1 (at that point we will know how far we have to push the current continuation technique beyond to connect all the way to the bifurcation point).
The rest of the paper is dedicated to the proof of Theorem 1. Our approach begins by rewriting (1.3) as a first order system for and then making the change of variables to obtain
[TABLE]
There are two reasons for performing this change of variables. First, it turns the system into a polynomial vector field, which has technical advantages when performing the analysis to derive the necessary bounds. Second, while may become very negative for small values of , the variable is always bounded from below by . Our goal is now to prove the existence of symmetric homoclinic solutions to (1.4) for all .
We split the problem into two parts. On the one hand a rigorous computational description of the local (un)stable manifold is required. On the other hand we need to solve, via a rigorous computational technique, a boundary value problem for the part of the orbit between the local invariant manifolds. We attack both parts by a continuation technique in the context of the radii polynomial approach. This parametrized Newton-Kantorovich method, adapted to a computational setting, is introduced in Section 2. In Section 3 we combine this with the parameterization method to obtain descriptions of the local (un)stable manifold of the equilibrium . Essentially the same technique is then applied in Section 4 in a Chebyshev series setting to solve the boundary value problem. These two aspects are then combined into a rigorous computational continuation of the homoclinic solution to (1.3). We note that for smaller values of the boundary value problem is the more difficult part of the problem, as the orbit makes a bigger and bigger excursion away from the origin. On the other hand, for values of close to it is more difficult to obtain the local (un)stable manifold of the origin, as the real part of the eigenvalues tends to [math]. The algorithmic issues encountered when implementing the proof of Theorem 1 are discussed in Section 5.
Finally, let us mention that there is a growing literature on the subject of computer-assisted methods for proving existence of connecting orbits, see [22, 24, 26, 29, 30, 31, 32]. The main novel contribution of the current paper is to do rigorous continuation of a homoclinic orbit over a large range of parameter values. The method is generally applicable for connecting orbits problems in parameter dependent problems. In that sense Theorem 1, while providing a new result for traveling waves in the suspension bridge problem which complements earlier work, is an illustration.
2 The radii polynomial approach
In this section we present the functional analytic setup of our continuation method, which is formulated in terms of the radii polynomials, see Definition 5. It will be used both to find the stable manifold and to solve the boundary value problem. For more details and proofs we refer to [2, 11, 25].
Consider a sequence of Banach spaces and the (product) Banach space
[TABLE]
with the induced norm defined by
[TABLE]
where with for . Denote by
[TABLE]
the closed ball of radius centered at .
Consider an interval of parameters and a Fréchet differentiable operator. For each , denote by the projection of onto . Let be approximate fixed points of and , respectively, and define the linear interpolation
[TABLE]
Define the line of centers by . For each , define the bounds
[TABLE]
for some and . The goal of the radii polynomial approach is to provide an efficient way to prove that an operator is a uniform contraction over a subset of . This subset consists of small balls around the line of centers, provided by the linear interpolation between two numerical approximations of solutions at different parameter values.
Definition 2**.**
Let be a Banach space and . Let be a set of parameters. A function is a uniform contraction if there exists a constant such that and such that for all and all .
The following result is a restatement of the uniform contraction principle (e.g. see [9] for a proof).
Theorem 3** **(Uniform Contraction Principle).
Suppose there exists some such that
[TABLE]
is a uniform contraction, then for every , there exists a unique such that . Moreover, the function is of class if is of class .
With the bounds and on the residue and the derivative of , see Equations (2.2) and (2.3), contractivity can be checked explicitly. This is expressed by the next theorem (we refer to [2, 11, 25] for a proof).
Theorem 4**.**
Given a set of parameters , consider the set of centers with given by (2.1). Assume that is an operator satisfying the bounds (2.2) and (2.3). If there exists such that , for each , then , defined by (2.4), is a uniform contraction (on ).
Assuming we have determined explicit bounds and , where in practice the latter is a polynomial with positive coefficients, satisfying (2.2) and (2.3). It is convenient to introduce the radii polynomials, which provide an efficient way in verifying the hypotheses of Theorem 4.
Definition 5**.**
Let and be the bounds on the operator as given by (2.2) and (2.3) respectively. We define the radii polynomials as
[TABLE]
One can see that the radii polynomials depend on the upper bounds and , and therefore they are not uniquely defined. But the smaller these bounds are, the higher the chances are to prove that the operator is a contraction over a ball around the approximation. The following result shows how the radii polynomials are used in practice to give us the value of for which we can apply Theorem 4.
Proposition 6**.**
Let
[TABLE]
and assume that . Then is an open interval of , i.e., . For any , is a uniform contraction.
3 Parameterization of the stable manifold
In this section we compute an approximate parameterization of the (local) stable manifold at 0, and provide explicit error bounds on this parameterization. This is done by combining the ideas of the parameterization method (first introduced in [5, 6, 7], see also [13]) and of rigorous computation (following the approach of [27, 1]). Having computed the parameterization, we will be able to obtain the homoclinic connection in the next section by taking advantage of the fact that it is now enough to compute an orbit on a finite time interval, i.e., an orbit that ends up in the local stable and unstable manifolds (or rather, we compute and verify an orbit that starts from the symmetric section and ends up, after some finite time, in the local stable manifold, see (1.3)).
3.1 Looking for the stable manifold as a zero finding problem
The first step is to recast the problem of finding a parameterization as looking for a zero of a map , which is the aim of this section. Setting
[TABLE]
Equation (1.4) is rewritten as . The Jacobian at the origin is
[TABLE]
and one finds that for it has two complex conjugated eigenvalues with negative real part, which we denote by and :
[TABLE]
The associated eigenvectors are given by and , where
[TABLE]
The stable manifold at [math] is thus two dimensional. Since is analytic we may look for an analytic local parameterization of this manifold. We will look for this parameterization as a power series
[TABLE]
with standard multi-index notation: , , , and satisfying
[TABLE]
together with the invariance equation
[TABLE]
Remark 7**.**
Even though the vector field is real, the fact that we have two complex eigenvalues makes it easier to first look for a parameterization of the complex manifold and then recover the real parameterization (the one which will be of interest in the next section for computing the homoclinic orbit) by considering
[TABLE]
see [16, 27] for more details. This is due to the underlying symmetry , which is respected by the function introduced below.
Plugging the power series (3.3) into the invariance equation (3.5) we get
[TABLE]
where stands for the Cauchy product. We recall that, given two sequences and of complex numbers (indexed over ), their Cauchy product is the sequence defined by
[TABLE]
where means and (and similarly ).
Notice that the additional conditions (3.4) imply that the coefficients of total degree 0 and 1 are equal on both sides of Equation (3.6).
Finding an analytic parameterization of the local manifold is now equivalent to find a zero of , defined component-wise by
[TABLE]
3.2 Getting to the fixed point formulation
Let and denote by the Banach space of complex valued sequences such that
[TABLE]
This space is a Banach algebra under the Cauchy product, which gives us control on the quadratic terms.
Lemma 8**.**
For , .
Definition 9**.**
In this section we consider
[TABLE]
We are going to look for zeros of in the space . Notice that means that
[TABLE]
which ensures that the associated parameterization is well defined at least for
[TABLE]
We now explain how to rigorously determine a parameterization of the manifold for all values of in a given interval . It will be more convenient to work with a rescaled parameter ranging between [math] and . Therefore we define
[TABLE]
We want to get a parameterization such that
[TABLE]
Since we are working on the interval , parameterized by , we have altered the notation of the parametrization of the coefficients slightly compared to Section 3.1, namely instead of . We will use throughout the remainder of the paper, except in Section 4.1, where the notation is more appropriate.
We first compute approximate zeros and of and respectively, by solving numerically the truncated problem (for and )
[TABLE]
for some , and by padding the obtained solutions with 0 to get elements of . We then define for
[TABLE]
If and are two good approximate zeros (of and respectively) and if is not too large, should be a good approximate zero of for each . We are going to reformulate this claim into a mathematical statement and prove that in a given neighbourhood of there exist a unique zero of for all . To put this in the framework described in Section 2, we consider the operator
[TABLE]
where , defined below, is an approximate inverse of . Namely, for large enough,
[TABLE]
should be a reasonably good approximation of , where, for any , is the by block diagonal matrix
[TABLE]
with the 4 by 4 identity matrix. Finally, we define as
[TABLE]
where is a numerical approximation of , while the are exact inverses. The operators and are then approximate inverses of each other: approximate in the finite part and exact in the infinite tail.
Remark 10**.**
To make sense of this matrix representation of and , as well as and , one should think of as an infinite vector where the elements are ordered according to increasing degree and within fixed degree by increasing , while also taking into account that each is a vector in . This means that is represented as
[TABLE]
The above representation describes the operators as infinite matrices where each element is a linear operator on , i.e. a matrix that we will occasionally denote by .
We now follow the ideas described in Section 2, using the Banach space endowed with the norm . In the next subsections we are going to compute the bounds and and the associated radii polynomials, and then prove that for some positive each radii polynomial is negative, which will yield (for each ) the existence of a unique zero of in the ball of radius around . At this point we will know that defines an approximate parameterization of the stable manifold, with an error bound controlled by . We will use this in Section 4 to prove the existence of a homoclinic orbit for all . Moreover, derivatives of the manifold with respect to , which will be needed in Section 4.1, can also be approximately computed with rigorous control on the error bound, see Lemma 14.
3.3 The bound
In this section we focus on the bound defined in (2.2). Let denote the component-wise absolute value of . In order to define the bound we are looking for, we try to bound every term with and :
[TABLE]
A straightforward calculation (using that and computing the derivatives of and with respect to ) yields that, for all ,
[TABLE]
where
[TABLE]
Since for all and is quadratic in , we have that vanishes as soon as . Therefore, we define component-wise by
[TABLE]
and then set
[TABLE]
so that
[TABLE]
3.4 The bound
In this section we derive the bound defined in (2.3). Let . We split in three terms which will be easier to bound separately. For each ,
[TABLE]
The bounds () are given in the following subsections.
3.4.1 The bound
From the definitions of and we get
[TABLE]
The finite matrix can be computed using interval arithmetic. To obtain the bound we only need to compute the operator norm of (as acting on ). This is the content of the following lemma.
Lemma 11**.**
Let (with for all ) and a linear operator acting on . Then
[TABLE]
In particular, if consists in a finite block of size and a diagonal tail
[TABLE]
then
[TABLE]
Hence, we define
[TABLE]
with the notation introduced in Remark 10, and set
[TABLE]
to obtain
[TABLE]
3.4.2 The bound
This term is the most involved one to bound tightly, so again we split it into several parts that we bound separately. For each ,
[TABLE]
Let us focus first on the first term. Since
[TABLE]
we get that
[TABLE]
For the tail we find
[TABLE]
which we estimate by
[TABLE]
Now we use Lemma 11 again and from the fact that we infer that
[TABLE]
and we are done with the first term. For the second term
[TABLE]
Again we use Lemma 11 to obtain
[TABLE]
where we recall that is the block of corresponding to the floating point data, see (3.7), and is defined by (3.8). Finally, computing the derivative of with respect to , we get that
[TABLE]
Now we need the following lemma, which is a slightly modified version of Lemma 11.
Lemma 12**.**
Let . We denote by the vector such that for all , . Then for all
[TABLE]
where
[TABLE]
Using Lemmas 11 and 12 we infer that
[TABLE]
where
[TABLE]
Finally, putting everything together, we define
[TABLE]
so that
[TABLE]
3.4.3 The bound
Since
[TABLE]
we directly use one more time Lemma 11 and set
[TABLE]
so that
[TABLE]
3.5 Use of the uniform contraction principle and error bounds
Following (2.5), we set
[TABLE]
If we find an such that for all , then according to Proposition 6 we have validated the numerical approximation of the local stable manifold for , for every .
Proposition 13**.**
For every , let
[TABLE]
be the approximate parameterization of the complex local stable manifold that we have computed (for ). Assume that there exists an such that for all . Then, for each , there exists a parameterization of the complex local stable manifold (for ) of the form
[TABLE]
which is well defined for all satisfying . Let
[TABLE]
then we have the error bound for all . These statements still hold true for the real (approximate and exact) local stable manifold, defined by
[TABLE]
for all satisfying .
Proof.
Proposition 6 yields that, for each , there exists a unique fixed point of in the ball of radius around . The operator is injective since its non-diagonal part is invertible. The latter follows from the fact that, see (3.9),
[TABLE]
where the final inequality is implied by . Here the operator norm on is induced by the one on . Hence the fixed point of solves . By construction is a parameterization of the local stable manifold defined for , and for such ,
[TABLE]
In the following section we use these approximations to rigorously prove the existence of homoclinic orbits for every parameter in . To do so, we will also need control on the derivative of the parameterization , which is provided by the theory of analytic functions. Define
[TABLE]
For all , the function , defined by (3.11), is analytic. Since , we can control the derivative of (on a smaller domain) by a bound on . This is the content of the following lemma, of which the proof can be found in [16].
Lemma 14**.**
Assume that is analytic, where
[TABLE]
and is such that
[TABLE]
Consider defined by , where
[TABLE]
Then for any we have
[TABLE]
4 Parameterized families of symmetric homoclinic orbits
In this section, we apply the technique of Section 2 in a Chebyshev series setting to rigorously prove existence of parameterized families of symmetric homoclinic orbits. More precisely, we present all necessary estimates and bounds in order to demonstrate that solutions of (1.3) exist for all .
4.1 A projected boundary value problem formulation
We begin by transforming the symmetric homoclinic orbit problem (1.3) into a projected boundary value problem (BVP). In order to set up the projected BVP, we first use the symmetry of the orbit to simplify the problem and therefore solve only for “half of the orbit”. The following lemma provides a strategy to do this.
Lemma 15**.**
Let and be arbitrary numbers, and let be the solution of the initial value problem
[TABLE]
Then for all for which the solution is defined.
Proof.
It is straightforward to verify that is also a solution of the initial value problem. By the theorem of existence and uniqueness for ODEs, it follows that for all in the domain definition of . ∎
Using the previous result, we fix a number , and it follows that to solve (1.3), it is enough to solve
[TABLE]
The idea now is to modify the boundary value problem (4.1) in a way that the boundary value at is removed by a projected boundary value at where we impose at that time that , a local stable manifold at [math]. In order to achieve this step, we use the theory of Section 3 to obtain a real-valued parameterization of at the parameter value :
[TABLE]
which is well-defined for all , where the size of the domain of changes as the parameter varies. Using the parameterization, we impose that
[TABLE]
for some , which implies that the orbit lies in the stable manifold. This introduces an indeterminacy that needs to be resolved. Namely, there is a one parameter family of pairs solving (4.2) while describing the same orbit. To overcome this, we impose that , for some fixed , and we solve for the angle . More precisely, we consider such that by setting for some . In this case, the evaluation of the parameterization of the local stable manifold along reduces to
[TABLE]
We slightly abuse notation by using the same notation to denote both and . We can therefore define the projected BVP
[TABLE]
where and are variables. As in Section 1, we make the change of variables
[TABLE]
and set to obtain that , where is the vector field given by the right-hand side of (1.4). We rescale time via so that (4.3) becomes
[TABLE]
A triplet satisfying (4.4) thus corresponds to a symmetric homoclinic solution of the suspension bridge equation. The rest of this section is dedicated to applying the technique of Section 2 in a Chebyshev series setting to rigorously prove existence of parameterized families of solutions of the projected BVP (4.4) for all . This begins by defining a zero finding problem whose solutions correspond to symmetric homoclinic solutions of the suspension bridge equation.
4.2 Setting up the zero finding problem using Chebyshev series
Now that is defined on and needs to solve a boundary value problem, describing in terms of a Chebyshev series is a natural choice, see [10, 14, 24, 28]. Denote by the -th Chebyshev polynomial with , where , and for . One way to characterize the Chebyshev polynomials is through the identity , from which it follows that , , and .
For each , we expand using a Chebyshev series expansion, that is
[TABLE]
For each , denote by the infinite dimensional vector of Chebyshev coefficients of . The vector field is analytic (polynomial) and therefore the solutions (if they exist) of the projected BVP (4.4) are analytic. By the Paley-Wiener theorem, this implies that the Chebyshev coefficients of each component of decay geometrically to zero. Hence, there exists a number such that for each , where
[TABLE]
We remark that throughout this section .
Remark 16** **(Notation).
The decay rate in the definition of the Banach space appears both in the current section and in Section 3. Both values need not to be the same. Therefore, to avoid confusion, we denote by the value from Section 3. Moreover, although the sequence space as considered above is slightly different from the one used in Section 3, we nevertheless use the same notation, since the spaces and norms are completely analogous to those used in Section 3.2.
The dual space can be characterized as follows.
Lemma 17**.**
The dual space is isomorphic to
[TABLE]
For all and we have
[TABLE]
The following lemma is analogous to Lemma 11.
Lemma 18**.**
Let , the space of bounded linear operators from to itself, acting as . Define the weights by and for . Then
[TABLE]
The Banach space of unknowns is
[TABLE]
endowed with the norm
[TABLE]
In terms of Chebyshev coefficients the differential equation becomes (see e.g. [14])
[TABLE]
for all . Here , and denotes the discrete convolution product defined as follows. Let , then for all the -th entry of the convolution product is given by
[TABLE]
The choice of norm and convolution product is justified by the fact is a Banach algebra, that is , for all .
The symmetry conditions reduce to
[TABLE]
and the boundary conditions become
[TABLE]
The full set of equations that we want to solve is thus , where
[TABLE]
In order to solve rigorously the problem in the Banach space , for all , we apply the radii polynomial approach of Section 2.
4.3 The finite dimensional reduction of the zero finding problem
Having identified the operator given in (4.12) whose zeros correspond to symmetric homoclinic orbits of (1.2), the next step is to compute numerical approximations, which requires considering a finite dimensional projection of the Banach space given in (4.7). Given a sequence , denote by the Galerkin projection of onto the first Chebyshev coefficients. Given an infinite dimensional vector , denote
[TABLE]
In this context, the finite dimensional Banach space is the finite dimensional projection of , and is the finite dimensional projection of . We slightly abuse the notation by denoting as the vector built from by padding each entry () with infinitely many zeros. The finite dimensional projection of given in (4.12) is defined as
[TABLE]
We want to compute on , but it depends on the parameterization , which itself depends on infinitely many Taylor coefficients. To remedy this, we consider a finite dimensional reduction of . Recalling (3.13), for every , denote by the computable approximation of the stable manifold given by
[TABLE]
where and are the numerical approximations of the coefficients of the stable manifold for and respectively.
Finally, let denote the finite dimensional projection of the operator using a Galerkin projection on the last four components and using the finite dimensional approximation for the parameterization of the stable manifold. More explicitly,
[TABLE]
with for , and
[TABLE]
while for all , see (4.8). Having identified defined in (4.15) as the finite dimensional reduction of given in (4.12), we can apply the finite dimensional Newton’s method to find numerical approximations. The next step is to define an infinite dimensional Newton-like operator on which we apply the uniform contraction principle (via the radii polynomial approach of Section 2).
4.4 The Newton-like operator for the homoclinic orbit
Let be two different parameter values, and consider two numerical approximations and such that and . In practice we find by solving numerically. For every , set
[TABLE]
and
[TABLE]
We denote for , and we recall that each is obtained from by padding with zeros. Similarly, we denote .
We now construct a fixed point operator so that it is a uniform contraction over the interval of parameters , whose fixed points correspond to zeros of at a given parameter value . The operator is constructed as an approximate inverse of . Let be such that and let be a numerical approximation of the inverse of the Jacobian matrix. We decompose the matrix , into 36 blocks as
[TABLE]
Here is scalar for , is a row vector of length for , , is a column vector of length for , , and is a matrix for .
Definition 19** **(Definition of ).
We extend this finite dimensional operator to an operator on defined block-wise as
- •
* for , where ;*
- •
* for and , where is padded with zeros;*
- •
* for and , where is padded with zeros;*
- •
* for , where*
[TABLE]
with the usual Kronecker delta.
Here is the dual of . As an example, for , , we have . The action of on is thus
[TABLE]
where for and for .
We consider the Newton-like operator
[TABLE]
where and is as in Definition 19.
Lemma 20**.**
Given the operator as in Definition 19. Then .
Proof.
Consider and . By construction of , in particular the infinite diagonal tail chosen in (4.17), it is straightforward to verify that for and for . ∎
Showing the existence of parameterized fixed points of defined in (4.18) is done by applying the general technique of Section 2. This requires computing the bounds satisfying (2.2) and the bounds satisfying (2.3) for . We recall that since , we have that denotes the absolute value for and the norm for .
4.5 The bound for the homoclinic orbit problem
We recall the definition of the bounds in (2.2). In our context, is a bound satisfying
[TABLE]
We begin by expanding each component of
[TABLE]
as a polynomial in . Given and , denote .
First, and , where
[TABLE]
Let us now expand as polynomials in , and recall that their first component depend on the exact parameterization of the stable manifold which involves infinitely many Taylor coefficients. The work from Section 3 provides the existence of a function , see (3.14), such that
[TABLE]
As before, we slightly abuse notation by denoting , where for a fixed . We then split the operator as
[TABLE]
where denotes the full infinite dimensional operator but evaluated using the (finitely computable) approximation of the parameterization of order , and where
[TABLE]
The size of can be estimated by using Proposition 13, where is the validation radius for the manifold for . In addition, since we know that the zeroth order term in vanishes, i.e. , we obtain a slightly sharper bound for any :
[TABLE]
Hence, we can estimate elementwise by
[TABLE]
Denoting
[TABLE]
with for , we rewrite as a polynomial in , where we use as defined in (4.14):
[TABLE]
for some between and (using the mean value theorem). To obtain an explicit computable expression for and , we determine
[TABLE]
by an interval arithmetic calculation, i.e., replacing and by the interval .
For , we set ()
[TABLE]
where the third order term is nonzero for and only. All terms are collected in Table 1. Then, it is possible to write the whole operator as
[TABLE]
where for .
Since we evaluate using a finite dimensional approximation, will contain only a finite number of nonzero elements. First, we consider the entries not exceeding the dimension of the finite dimension approximation. This part gets ‘hit’ by , and is bounded component by component:
[TABLE]
where . Concerning terms that exceed the dimension of the finite dimensional projection, by using the definition of , one gets for
[TABLE]
The expansion of in powers of is given by (4.23) with the coefficients in Table 1, We note that all vanish for . To be precise, vanishes for , whereas when then vanishes already for . Hence we define the estimates (, )
[TABLE]
Having estimated all the terms appearing in the expression , we set
[TABLE]
By construction, we have
[TABLE]
4.6 The bound for the homoclinic orbit problem
We recall the definition of the bounds in (2.3). In our context, is a bound satisfying
[TABLE]
To simplify the manipulations of the expressions appearing in the bounds, we introduce an operator , where the splitting is explained in Definition 19. This operator is on the one hand an ‘almost inverse’ of the operator , and on the other hand it approximates . We define piecewise, where we use the decomposition of the Jacobian into 36 blocks as in (4.16):
- •
for , where ;
- •
for and , where is padded with zeros;
- •
for and , where is padded with zeros;
- •
for , with , where
[TABLE]
Now, we use to perform the splitting
[TABLE]
As in Section 3, the bound on the first term in (4.25) can be directly computed. We set , whose nonzero elements are represented by the finite matrix , and we use Lemmas 17 and 18 to derive the bounds
[TABLE]
with the norms introduced in Section 4.2. This provides the desired bound on the first term of (4.25). For the second term, we set such that and . We denote , and similarly for , and . First, for , we have
[TABLE]
where the final inequality follows from Lemma 17. Next we consider the term of the other four components. For one finds
[TABLE]
where is in , and is in . A direct computation shows that
[TABLE]
Combining this with (4.22) gives us a bound on the terms in (4.28):
[TABLE]
The remaining terms in (4.29) are estimated using Lemma 14. We obtain, for ,
[TABLE]
with, for ,
[TABLE]
For , we consider separately the coefficients of , and :
[TABLE]
The term contributes to the -independent part of only. Since in some of the terms involving will cancel, it is useful to introduce as follows:
[TABLE]
Using this notation, for and , one finds
[TABLE]
Clearly , for , and the Kronecker may be viewed as superfluous. For we find
[TABLE]
Once again the Kronecker may be viewed as superfluous. For , and , one finds
[TABLE]
and
[TABLE]
The and coefficients are still to be determined. For , they are given in Table 2.
Thus, we set , and . We note that values of and are not explicitly given, but (4.30) provides bounds on these terms. We are going to abuse notation by referring to these bounds as and , where we will correct for this abuse below whenever these terms get involved. We set .
For , one can estimate, using Equation (4.6) and the definition of ,
[TABLE]
and for
[TABLE]
Apart from for , which are scalars, it is not immediately obvious how to compute or estimate the terms in (4.32) and (4.33) explicitly. The norms for , and for , can be computed directly, since they are represented by row and column vectors of length . The operator norms can be computed using Lemma 18, since for they are represented by finite matrices, whereas for they have a decaying diagonal tail (see the analogous Lemma 11).
The norms and in the quadratic and cubic terms in can be estimated using the Banach algebra structure. Taking into account the bound on in (4.30), this leads to bounds
[TABLE]
with
[TABLE]
and
[TABLE]
The factor in the expressions above is due to the shift in index (to the right and to the left) in , , etc.
This leaves us with estimating and . Since these appear in the terms that are linear in , a direct triangle inequality bound would be too rough for the method to succeed. Hence we estimate these terms more carefully below.
For the term in front of in equation (4.32), for , we have
[TABLE]
Here we have corrected for our abuse of notation regarding by splitting it off using the triangle inequality.
Remark 21**.**
We use the bound (4.6) to estimate the convolution
[TABLE]
A similar estimate leads to
[TABLE]
Some of the terms in are computable directly, while others need to be estimated. To present these estimates in a structured way we introduce several computable constants. For the convolution terms involving either or in we introduce (for )
[TABLE]
Here and , defined in Remark 21, can be computed (at least finitely many of them) since and have only finitely many nonzero components. We now set, for ,
[TABLE]
as well as
[TABLE]
and
[TABLE]
Recall that denotes the component-wise absolute value. Then we have the computable estimates ()
[TABLE]
For , we split the estimate in three terms because of the way the bounds and are defined. Using (4.30), we get ()
[TABLE]
Again we have dealt with the terms separately to take into account our abuse of notation.
The final two terms in (4.39) still need to be estimated. The first of these can be estimated in the same way as above, which we write (for ) compactly as
[TABLE]
with
[TABLE]
where one should read .
For the final ‘tail’ terms in (4.39), we bound these as we did for and coefficients. We obtain
[TABLE]
Therefore, recalling (4.31) and (4.34)–(4.38), for , we set
[TABLE]
and for , we set
[TABLE]
Finally, by construction,
[TABLE]
4.7 Use of the uniform contraction principle
Using the computable bounds and constructed in the previous two sections, we set
[TABLE]
If we find an such that for all , then according to Proposition 6 we have validated the numerical approximation of solutions to the BVP (4.4), for every , and hence we have proven the existence of symmetric homoclinic orbits for all .
Proposition 22**.**
For every , let
[TABLE]
be the approximate solution of (4.4) that we have computed for , and . Assume that there exists an such that for all . Then, for each , there exists a solution of (4.4) for of the form
[TABLE]
and some and satisfying and . This solution corresponds to a (symmetric) homoclinic orbit of (1.3). Furthermore, let
[TABLE]
then we have the following uniform error bound on the (central part of) the homoclinic orbit in phase space: for all , and .
Proof.
Proposition 6 yields that, for each , there exists a unique fixed point of in the ball of radius around . The operator is injective since its non-diagonal part is invertible. The latter follows from the fact that, see (4.26),
[TABLE]
where the final inequality is implied by . Here the operator norm on is induced by the one on . Hence the fixed point of solves , and by construction is a solution of (4.4), which through the change of variables from Section 4.1 corresponds to a homoclinic solution of (1.3). The error bound follows from
[TABLE]
5 Algorithm and results
In this section we discuss some algorithmic issues. In particular, we explain how certain computational constants are chosen and how the two parts of the problem (the manifold computation and the boundary value problem) are joined together to produce the homoclinic orbit. To get the continuation started, the first thing to do is to compute the approximation of the manifold for a fixed value of . Since the first coefficients of the parameterization depend on the steady state and the eigenvectors, which are known, one can start Newton’s method with these values in combination with zeros for all higher order coefficients. If Newton’s method does not converge, replacing the starting point with a good approximation for a slightly higher number of Taylor coefficients (which can be computed recursively) will work. Once one good approximation has been found for a particular value of the parameter , one can use it as the starting point to find another approximation for sufficiently close values of the parameter.
Another important point for the computations is the size of the manifold that we get. Since the stable eigenvalues of the Jacobian at 0 are complex conjugates, we know that asymptotically the orbit spirals toward the origin. If the manifold we compute is large enough to contain most of the spiraling part, then we do not have to compute that part of the orbit using Chebyshev series, which is advantageous. Generally speaking, the larger the manifold is, the easier the remaining part with Chebyshev will be. Therefore we use the method developed in [1] to maximize the image of the parameterization we compute.
A natural approach to obtain a larger manifold is to try and maximize the for which we can validate the parameterization (we recall that its domain of definition is ). However, taking or leads to numerical instabilities (see for instance the quantities defined in Section 3.4.1). The key observation from [1] to avoid this phenomenon is the following. Given a parameterization
[TABLE]
and, for some , a rescaled parameterization (also with rescaled eigenvectors)
[TABLE]
the parameterization on the domain defines the same manifold as the rescaled parameterization on the domain . Therefore we can fix to be and instead look for the largest for which we can validate the rescaled parameterization.
Another useful feature of the results of [1] is that they provide the explicit dependence of the bounds and with respect to the rescaling , enabling us to recompute bounds for any rescaling cheaply. In practice, we use the following process:
- •
Compute an approximate parameterization (that is, the coefficient ).
- •
Compute the bounds and for , without the continuation (i.e. take and in every estimate).
- •
Find the largest for which the proof succeeds (i.e. we find an such that for all , where the four radii polynomials are defined in (3.10)) for the rescaled coefficients , while requiring the coefficients of the linear term (the one front of ) in each radii polynomial to be less than some threshold , which will be discussed below. This step yields a parameterization with rigorous error bounds on the domain .
- •
Use the parameterization with this for the Chebyshev part and for the continuation.
Before describing in more detail the process of continuation, let us explain the role of the threshold . Finding a positive root of a radii polynomial is impossible if its linear term is not negative, because all its other coefficients are always non-negative by construction. If the linear term is just negative enough for the proof to work at the single parameter value , then has to be taken extremely small for it to remain negative for the uniform proof, since all bounds become worse monotonically in . However, we want to take as large as possible to reduce the number of steps we have to perform to prove the existence of a symmetric homoclinic orbit for all . Hence, the addition of this threshold is a trade off: we get a manifold that is a bit smaller than what we could have had optimally, which makes the proof for the Chebyshev part a bit harder, but we can take larger steps in , making the total process faster overall. In practice, we use an close to (the value we use varies slightly with ).
Once the approximation for the manifold is maximized and proven for a particular value of , one can use it as the starting point to find the approximation for in order to compute an approximation for the whole interval . We use the same rescaling for the entire interval . On the other hand, it is possible to use different scalings for consecutive intervals.
The value of that we use is not constant, and varies between and . The smaller values are needed when . This is due to the fact that proof of the stable manifold becomes harder and harder when approaches . Indeed, when goes to the real part of the stable eigenvalues (see (3.1)) goes to zero, and the problem of finding the stable manifold becomes singular (this can also be seen in the bounds derived in Section 3). Note that when the proof fails for a given interval, a smaller needs to be used. Thus, the algorithm needs to recompute both the manifold and the orbit for . However, and need not to be computed again for the new proofs since they both only depend on the approximation at .
For the manifold all proofs were done using for the dimension of the truncated power series. For the orbit, the proof succeeds with for , and with otherwise. In Figure 1 one can see the profile of the solution for , and . The left part of the figure shows the decay rate of the solution using the logarithm of the absolute value of the first Chebyshev coefficients. Recall that the first component of the system is given by , where is the first component of the original system, obtained after transforming the fourth order equation to a first order system. One can see that the solution for is really close to for a much longer period of time than the other solutions depicted. This behaviour has an impact on the decay of the corresponding Chebyshev series. Moreover, another value affecting the decay rate of the solution is the time rescaling factor of the orbit. For (respectively and ) we have (respectively and ). The first three components of the solution and the local manifold can be seen in Figure 2, Figure 3 and Figure 4 for , and , respectively. The profiles of the first component of these three solutions can be compared in Figure 5, where half the symmetric homoclinic orbits is depicted. Furthermore, the three corresponding homoclinic solutions of the suspension bridge equation (1.2) in the original -variable are presented in Figure 6.
Finally, to perform the proof successfully for the entire interval range we had to execute the algorithm times. Each proof took between and seconds on a laptop with an Intel Core i7 4500U processor on MATLAB R2016a. The code which was used to perform the proofs is available at [23] and uses the interval arithmetic package INTLAB [19].
Acknowledgements
Jan Bouwe van den Berg was supported by the grant NWO Vici-grant 016.123.606. Jean-Philippe Lessard was supported by Gouvernement du Canada/Natural Sciences and Engineering Research Council of Canada (NSERC), CG100747.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Breden, J.-P. Lessard, and J.D. Mireles James. Computation of maximal local (un)stable manifold patches by the parameterization method. Indag. Math. (N.S.) , 27(1):340–367, 2016.
- 2[2] M. Breden, J.-P. Lessard, and M. Vanicat. Global bifurcation diagrams of steady states of systems of PD Es via rigorous numerics: a 3-component reaction-diffusion system. Acta Appl. Math. , 128:113–152, 2013.
- 3[3] B. Breuer, J. Horák, P.J. Mc Kenna, and M. Plum. A computer-assisted existence and multiplicity proof for travelling waves in a nonlinearly supported beam. J. Differential Equations , 224(1):60–97, 2006.
- 4[4] B. Buffoni, A. R. Champneys, and J. F. Toland. Bifurcation and coalescence of a plethora of homoclinic orbits for a Hamiltonian system. J. Dynam. Differential Equations , 8(2):221–279, 1996.
- 5[5] X. Cabré, F. Ernest, and R. de la Llave. The parameterization method for invariant manifolds I: manifolds associated to non-resonant subspaces. Indiana University mathematics journal , 52(2):283–328, 2003.
- 6[6] X. Cabré, E. Fontich, and R. de la Llave. The parameterization method for invariant manifolds. II. Regularity with respect to parameters. Indiana Univ. Math. J. , 52(2):329–360, 2003.
- 7[7] X. Cabré, E. Fontich, and R. de la Llave. The parameterization method for invariant manifolds. III. Overview and applications. J. Differential Equations , 218(2):444–515, 2005.
- 8[8] J. Chen and P.J. Mc Kenna. Travelling waves in a nonlinearly suspended beam: theoretical results and numerical observations. J. Differential Equations , 136:325–355, 1997.
