A singularly perturbed, high order KdV-type model, which describes localized travelling waves (“solitons”) is being considered. We focus on the Inner solution, and detect Stokes phenomena that are crucial as to whether we can obtain a suitable solution. We provide a simple proof that the corresponding Stokes constant is non-zero. Also, we evaluate this splitting constant numerically by using two methods that are induced by the underlying theory.
Localized travelling waves, or simply solitons, have been studied for more than a hundred years now. Their peculiar nature has attracted the interest of both physicists and mathematicians, with the latter trying to understand precise conditions (regarding mainly non-linearity and dispersion) in mathematical models that govern their existence. In general, the emergence of solitons is considered a rare phenomenon, because the conditions under which they are created are specific, such as abrupt changes of certain intensity in the motion of the medium. Interestingly, in the late 90’s, and early 00’s it was found that solitons can exists in families, continuous or discrete. Moreover, it was discovered that solitons can resonate with typical, periodic waves in the medium. A soliton of this type is called an embedded soliton (ES), see [4,7]. This discovery came as a surprise because it was commonly thought that a structure like this will eventually collapse by gradually loosing energy by emitting radiation in the form of periodic waves. Over the last decade, ES are found to exist in several systems from a variety of physical disciplines (hydrodynamics, biophysics, solid state physics etc. see [1]). Motivated by research carried out in the last decade, we consider the following model that arises from fluid dynamics, see [1] and the first reference(s) there, or in particular [3]:
Looking for global solutions in the case where after imposing the condition as , the system above can be solved explicitly and we obtain the exact solution with simple poles at points :
The singular term gives rise to two complex conjugate imaginary roots of the corresponding characteristic (auxiliary) equation, i.e. the algebraic equation . So a question that occurs naturally is whether the separatrix (1.2) persists (in this case we have an ES) under this singular perturbation or whether the solution that continues from tends to some small oscillation as as the linearization of (1.1) suggests, in which case we say that the separatrix splits. A complete answer to that question goes beyond the purpose of this paper, but one may start by proving existence of symmetric solutions () initially defined on and respectively that decay to zero at respectively and check whether they and their derivatives up to order three agree at the origin (then by standard uniqueness theorems they will coincide). To evaluate the respective difference(s) one may start by approximating the solutions using singular perturbation theory: finding a formal sum assumed to satisfy: ( is the assumed desired solution), that is: for every there is a function such that and for all ξ, as . To find the coefficients in , we formally substitute the latter in (1.1). However, any order of the approximation misses exponentially small terms, and the presence of terms like can turn the soliton into a weakly non-local solitary wave (see [2]) by spoiling its localized nature. One way to detect terms like this is to study the problem near the poles of (i.e. the “Inner problem”) and then match the “inner” and “outer” solution. In this paper, we develop a first step of this approach, in particular:
In Section
2
, we study the inner problem, and show that the equation that is to be satisfied by the first order of the approximation of in a region of a pole (after translating and re-scaling the independent variable ξ to a new variable τ and re-scaling the dependent one to ), has two solutions . These solutions are obtained by Borel re-summation of the corresponding asymptotic formal sums defined on different (yet overlapping) regions on the complex plane that decay to zero as respectively. Their difference is obtained approximately by a closed formula, and is proportional to an exponentially small term. The constant of proportionality, Γ, is called the Stokes constant; Section
2.1
contains, essentially, a proof of its existence. Section
2.2
contains semi-standard results and proofs that complete the first of the main goals of this paper.
In Section
3
, we evaluate the aforementioned constant numerically, using two different independent methods, inspired by the respective theory, completing the goal of this work.
Finally, in Section
4
, we briefly discuss related results in the literature.
As shown in the next section and described above, the Stokes constant Γ characterizes the difference of in their common domain, which indicates that the inner solution may exhibit the so-called Stokes phenomenon: the asymptotic formula of a function changes discontinuously in adjacent regions of the complex plane. Assuming the matching of the inner and outer solution is done properly, it is natural to expect that the outer solution , roughly speaking, behaves differently as in the regions and (), as it happens in a very similar problem that motivated [13] (see (1)–(2) there). However, unlike the case in [13], the solution of the unperturbed problem discussed here has singularities located on two lines on the complex plane instead of one, which makes an essential difference, potentially allowing the existence of a soliton-solution as numerical experiments suggest, see [1].
A formal sum (in the form of power-series): () is an asymptotic expansion of a function at 0 (or at infinity through the transformation ), in the sense of Poincaré if for any there is a function such that and as , in which case we’ll write . In applications like in this problem, the remainder is may be presumed analytic a priori, as part of an ansatz, in order for closed form operations (addition, differentiation, integration) to be applied properly while asymptotic relations are respected accordingly. Note that: (i) A function can have many asymptotic expansions of different forms , other than its Taylor series (if exists) at a point, but it is easily shown by subtracting two possible (truncated) expansions that the coefficients (in one form ) are unique, (ii) Formal sums need not be convergent and (iii) Different functions can share the same asymptotic expansion on some sector of the complex plane (unless perhaps if it’s large enough, see Watson’s uniqueness theorem in [9]), as in the main problem in Section 2, where functions differ by a term that is asymptotically smaller than any term of the series (smaller beyond all orders). In fact given any (formal) power series there are many functions asymptotic to it: any exponentially small functions such as , is asymptotic to the (identically) zero power series at 0. However, given a formal negative power series: there is a unique entire function of exponential type 1, asymptotic to in a half-plane, see the Borel–Ritt Lemma in [5]. Also, we have the following basic lemma on asymptotic expansion of the Laplace transform.
Letbe an analytic function defined on an open (complex) δ-neighbourhoodof the half-line, that is, the openwith. If there are constantsandsuch thatonthen for any (fixed)the Laplace transform ofsatisfies:
The proof can be done using standard tools like repeated use of integration by parts. This lemma can be viewed as a strong and special implication of the Watson’s Lemma, see [5]. In this setting, we will deal with a generalized version of the Laplace transform, where the integration is on some ray (half line) .
The formal power series we will encounter is of Gevrey type (the coefficients satisfy , for some ). In this case, the Borel transform (inverse Laplace transform), when applied formally (term by term) to some Gevrey type power series, defines a unique function that is analytic at the origin. This process is called (generalized) Borel (re-)summation, see for example [5] and [8].
Main results: The Inner expansion
Existence of the Stokes constant
First, since the equation is autonomous, we consider without loss of generality (simply translating this pole to the origin). We set:
and equation (1.1) becomes (with ):
We follow the spirit of perturbation theory and formally substitute an asymptotic expansion of the form to to obtain a(n) (infinite) system of equations whose leading term (coefficient of ) satisfies:
Consider the “translated and rotated” half-planes: where and (see Fig. 1 for illustration), the intersection of two such half-planes (for two different θ’s) is either empty, or a sector for some and open interval A (set of directions), or just , if respectively. The Laplace transform of a (suitable) function along a complex ray () will denoted as . In this paper, the set of positive/non-negative integers will be denoted by and respectively. Bearing these in mind, the main results of this work are the following theorem and corollary.
The half-planes are where (2.39) are defined respectively. The point of intersection of and c (the exponential type of ) satisfy .
Letbe fixed, and set. Equation (
2.3
) has a solutiondefined onfor some, uniquely determined by being asymptotic to a formal sum of Gevrey typeonfor unique,. Moreover, ifthese solutions satisfy:
The proof makes use of several lemmas and propositions which are proved subsequently, and is found at the end of this section. Using almost identical arguments, the following can be proved:
Foras in Theorem
2.1
, letandbe fixed. Equation (
2.3
) has solutionsuniquely determined by being asymptotic toon half-plane(for some) that satisfy:
We proceed heuristically. For convenience, we drop any sophisticated subscripts (, ) for now, and consider a formal power series to which is asymptotic. We notice that solves the “unperturbed” system , so adding the “perturbation” term and noticing that we understand that a fruitful educated guess is to assume a priori that is asymptotic to a formal sum in the form of (negative) power series: . In other words, we assume that for any we can write: with for some analytic on the domain of interest. The coefficients are found to satisfy:
The reason why we consider this ansatz is because of the form the asymptotic expansion the Laplace transform possesses (Lemma 1.2). Assuming that the equation admits a solution in the form of a Laplace transform, we can consider any arbitrary, yet fixed, and studying the limiting behaviour of the emerging sequence, we can obtain a nice recipe for constructing the (unique) Borel transform (inverse Laplace) , of .
To show that the formal series , to which is presumably asymptotic (at ∞), is of Gevrey type, we use the two following Lemmas (2.4 and 2.5) that lead to the proof of Proposition 2.6 (which essentially says that is of Gevrey type):
The sequenceis positive and strictly increasing. Moreover, if convergent to a, it satisfies:
We divide the recurrence relation of (Eq. (2.6)) by and we obtain the following equivalent (and normalized) relation for Γ:
where .
The positiveness of is easily shown inductively, we have: and . Assume that , for some , then for such n (straightforward) and so since the RHS of (2.8) is positive. Also:
We set (at infinity) and write:
Thus , as (since , ) by the induction assumptions. The proof of the first part of Lemma 2.4 is complete.
Now, in order to prove the second part, i.e. , (where Γ is the limit of ) for some , we re-write formula (2.8) as follows:
where and at infinity. We have:
The last equation holds for every , so, we can replace in the sum in the RHS with the (“same”) expression (2.14) of for and write:
□
Take a (positive) natural. For allthere existsandsuch that for all naturalsthe sequence,satisfies:.
In a way similar to the proof of the fact that is positive previously, we immediately see that , for each and is increasing. Also, we see from the RHS of (2.9) that for , this follows from standard arguments and simple calculations. Take an (arbitrary). We will see that for sufficiently large, we are able to prove the statement inductively.
We take an and an such that , we’ll see that for large enough we can apply induction and prove the statement. Let an such that the result holds, then for we have:
So, we get .
Now, it suffices to prove that for all with sufficiently large we get:
This inequality will be enough, since from Taylor’s theorem we get (for large n):
So since .
We have , and so for all for some large enough we have (since ):
We multiply both sides of the latest inequality with and we obtain inequality (∗). Moreover, as .
So (after picking sufficiently large) the inequality at the top of this page holds, and so does the induction step. Lastly, we have that such a large exists, and we are free to choose it as large as we need. The proof of Lemma 2.5 is complete. □
There is a positive constant Γ such that(at infinity).
Having proved Lemma 2.4, it suffices to prove that there is a constant such that , , this implies convergence since increases. Following it we have: , and for for some we get:
because and so . Also: and for the multinomial coefficients with we have:
and so
Therefore,
So, since was arbitrary, we get for the inequality:
Now, we take a and consider where:
We have:
This happens for such m since . So we have:
Iterating (2.16) backwards (in ) times we get:
We notice:
So, we obtain the inequality:
Now, in order to prove a uniform bound, if suffices to show that as (recall ), as in this case we will get that:
There is a such that , and so: .
Then we’ll be able to iterate the (forward) inequality (2.16) as many times as we want and maintaining the bound since the same bound will hold for with arbitrary, albeit large enough. Afterwards, we do the same for with (staying the same as in the case of ) and obtain the same bound:
and proceeding inductively in this manner, we get: , .
To show as we proceed by considering the sequence from Lemma 2.5 and following it, we take an and we have that , and so for some and , with arbitrary.
Eventually, letting we get and now we can easily deduce that for we have in the limit .
Thus, for we obtain as . Proposition 2.6 is proved. □
The analytic continuation of the Borel transform
Define (i.e. ). It is clear now, since as , that the formal power series is of Gevrey type. So, we can obtain a function that is analytic on the unit disk by defining:
In fact, can be analytically extended to a function of exponential type in a suitable sector (united with the unit disk), see Proposition 2.9.
The RHS of (2.17) solves the equation: which is obtained by applying the inverse Laplace (Borel) transform in (2.3). Letting we can easily see that the remainder satisfies: while being analytic at zero, also:
where the remainder satisfies and is analytic at a region of interest. Indeed, if (at infinity), then its Borel transform satisfies (at zero) and vice-versa.
The asymptotic behaviour of can be easily found by studying the limiting behaviour of its series expression as along the segment (or along any line segment that belongs to the unit disk and has i or resp. as one of its limit points). However, we obtain a much more informative description of :
There exists a functionanalytic and bounded on the unit disksuch that the function(Eq. (
2.17
)) has the form:
We set , and we have:
where at infinity (Proposition 2.6).
So, there is an such that for all and the sum:
converges absolutely on , and so is analytic and bounded on . □
If can be analytically extended on a δ-neighbourhood of some ray to a function of some exponential type c, we can then apply the Laplace transform on and obtain a function which is analytic, solves Eq. (2.3) and is asymptotic to the formal sum on . That is exactly what we get by the next Proposition (2.9). After that, we will study the differences of functions obtained by Laplace-transforming along different rays, essentially proving Theorem 2.1, which is the main results of that paper. The aforementioned difference is exponentially small yet non-zero, indicating the presence of a Stokes phenomenon (the asymptotic formula of a function changes discontinuously in adjacent regions of the complex plane) on the inner (and consequently outer) solution. The reader may consult Fig. 2 for an illustration of the domain which we see in the following proposition.
The domain .
Consider. The functioncan be analytically extended on, whereandthe sets of directions andthe respective sectors. Letbe this continuation. Moreover there existsuch thaton.
We consider the functional equation:
for , which is derived after applying the transform to (2.3).
We will denote the triple convolution on the RHS of (2.19) as through the straight line segment connecting for s such that the segment does not pass through singularities of .
We let and for we write:
We see that even though appears in the denominator in the latest formula, is not a singularity, because as . However, has singularities at as proven in Lemma 2.8.
Now, we set (where ) and for we consider the integral equation:
We now set and study whether equation (2.20) has a solution in .
To do that we set for and 0 otherwise, and consider an auxiliary function/unknown such that on , and otherwise, the unknown in Eq. (2.20). We will prove existence of such solution , after that we will be able to define an analytic continuation of to by setting on and on .
We re-write (2.20) as:
Equation (2.20) is equivalent to (2.21) because we have:
because for each and we have that either , or , in other words, there are no “non-linear” terms of , bearing in mind the associative property of convolution. We fix an , we set and we have:
where .
The integral form of (2.21)–(2.22) can be written:
Equation (2.23) is a Volterra equation of 2nd kind with Integral Kernel:
and 0 otherwise. We have:
Similarly, for some we have bounds: on and:
Consider , the space of analytic functions on and the space of analytic functions on an ϵ-neighbourhood of , for ϵ small enough, and the operator:
The problem of proving existence of solution to (2.23) with certain properties reduces to a problem of proving existence of a fixed point of on a suitable subspace of (obviously ). For we have:
(the supremum norm is finite since ).
By induction, we can similarly show that:
Since , the RHS of (2.27) tends to 0 as , consequently, for all n large enough, i.e. is a contraction mapping. We set and ( ) and have:
From (2.27) (after setting , ), we have that the RHS of (2.28) converges absolutely as , in particular:
uniformly . Let , therefore, there is a subsequence of , that converges to a function . So, and by (2.27) we have
as , meaning that , analyticity is preserved through uniform convergence. The terms are the partial sums of the Neumann series. To avoid confusion regarding the notation, we set this . We apply the same procedure infinitely many times, each time extending the domain as (each time we “double” the domain of definition), similarly: and obtain a solution . Consequently we have extended to an analytic function on . Thereafter, we can inductively (in k) show that can be extended to an analytic function on ( was arbitrary, and is analytic on ).
Now, we prove that this analytic continuation is of exponential type: We will study the problem inductively for , and proceed with induction in n. To avoid confusion, notice that in the part where we showed existence we doubled the radius .
Now, we just increase it by r: . Without loss of generality we consider the case with (the case where is similar). For we have:
where, , , , both considered on the line segment:
We set , and equivalently we have (for ):
We consider the initial value problem (for ):
For which the (unique) solution is: .
By standard theory of ODEs (Grönwall’s inequality) we get:
i.e. is of exponential order . Also, we have and s has the same direction () and continues from , which is why we get: .
Now, we take and such that for , and search for possible exponential bounds of . We set for and we have:
Because trivially, we have: for , and this sum equals for all . However, we have: for and for .
As before, we set for we have (the term comes from the number of terms in the sum in (2.35) – ):
where for with .
So, we get:
we apply the steps presented in the case and we get (for ):
So, if is the infimum of the upper bound of , on , then the infimum of the upper bound of on is bounded above by , since .
If , then and proceed inductively. If not true, we continue, and without loss of generality we set: and apply the procedure for to get an upper bound for in :
We apply the same procedure k times and we obtain:
We have terms equal to in the nominator and: terms varying from n to , where each appears (at least) twice for , in the denominator. We have n and fixed, so for k sufficiently large, we have for all for some . That means: for all , moreover: . which means that has a maximum at or , and for it start decreasing. In other words, we have that is bounded as a sequence of ( is fixed). Therefore, there is an such that for all , so for , for all . We set and since this estimate is uniform in , Proposition 2.9 is proved. □
Now, we can apply the Laplace transform along an arbitrary (non-singular: with direction other than ) ray. Set and consider a set of directions and its reflection with respect to the imaginary axis . For we have , and:
Figure 3 provides a helpful illustration of these paths of integration. Note that for each (equiv. ), the domain of definition of and have non-empty intersection that consists of one connected component. Also, for such , since is analytic (and of exponential type) for each , agree on their common subset of definition, by the Identity theorem from standard Complex Analysis. Since (resp. ) are arbitrary we can define the extension of where in (2.40) as θ runs all over (resp. ).
The domain with the rays of integration .
The domain of definition (, with analytic properties) of is the union of half-planes: where c is the exponential type of . Notice that the domains of definitions of have two totally disconnected components, one in the upper and one in the lower half-plane. In fact, these are the sectors, , such that:
with and (“upper” and “lower” half-plane respectively). However, don’t agree on . In fact we are now ready to prove Theorem 2.1 which is our main result:
Let , and be as defined in (2.39) for . We have:
where the contour of integration is (and s is moving counter-clockwise, i.e. “positive” direction). By utilizing Lemma 2.8 and Proposition 2.9 we get:
The term is analytic on the cut-plane () and can be decomposed as there and the term is defined as:
By standard analysis and the aforementioned results we have that and are of exponential type, i.e. for some . They are also bounded in :
Also: as .
The Residue theorem and other standard tools from Complex Analysis give:
Combining equations (2.41) to (2.44) we get Eq. (2.4). By formula (2.39) and Lemma 1.2 the asymptotic condition in Theorem 2.1 is guaranteed. Uniqueness follows by the fact that the coefficients of the formal sum are unique, and they are determined by the recurrence relation in (2.6), which defined (a unique) by (2.17) which is uniquely extended to an analytic function on a suitable set (Proposition 2.9). □
The proof of Corollary 2.2 follows by an almost identical manner.
(On uniqueness of solutions satisfying asymptotic conditions).
Clearly, equation (2.3) has no unique solution on (defined in (2.40)), even with the asymptotic condition . Moreover, equation (2.3) is autonomous, which means that if is a solution on a domain then too will solve (2.3) on a domain (typically other that unless for it is invariant under a set of certain translations – such as when is the right half-plane and a is purely imaginary). Making the substitution we see that the (formal) sum “solves” (2.3) formally while having the same leading term as . Therefore we do not expect uniqueness of solutions induced by the leading term of the asymptotic expansion. Moreover, we can still obtain a solution under the sign change (the choice of sign might be determined by a necessary condition for the Inner and Outer solution to match) in the leading order coefficient ( in (2.6)) of the asymptotic expansion (this forces the rest to change too). However, by predetermining the sign of the leading order coefficient and imposing (for determined accordingly) we eliminate both of the aforementioned freedoms and obtain a unique solution.
Moreover, using ideas similar to the ones on Proposition 3.1 (see below in Section 3) one may be able prove that the condition with at infinity, analytic on a suitable half-plane is enough to guarantee uniqueness: Considering the difference between two solution and studying a “linearized” version of (2.3) and yielding two trigonometric & two exponential non-trivial solutions, none of which vanishing along all directions of the half-plane P.
Numerics
In Section 2, we saw that the limit (provided that it exists) defines a constant, Γ, that characterizes the “exponentially small” differences of functions that are asymptotic to the same (Gevrey) formal power series (and the potential “splitting of separatrices” as explained in the end of the previous section). In this chapter we evaluate the constant Γ using two independent computational methods, based on the theory we presented before.
The first method consists of evaluating for some large values of n and extrapolating based on the formula (2.7). The coding is done in Mathematica 12.0 (see the end of this section – first 6 lines of code). This method gives for example: .
Considering Proposition 2.6 we have that the rate of convergence is “”, so it is instructive to extrapolate by best-fitting the functions for some . That is:
Choose integers and fit to the data ( equidistant) for some using the Mathematica built-in function “Fit”, which finds the best-fitting combinations of functions to data by the method of least squares. We set and compute:
Such a computation yields a function: , with , and .
Intuitively, this is a function that describes the limiting behaviour of . This result is in agreement with Proposition 2.6. Using standard tools from Linear Algebra (such as Cramer’s rule) carefully we can show(after slightly abusing notation) that for the resulting , we have and , which means that this extrapolation method provides a better approximation by design. Similarly we can show that directly extrapolating the data by solving the following system:
yields a similar approximation. Regarding extrapolation to a higher order (), in both of those extrapolation tricks, we naively expect to obtain an approximation like: , just as happens when . The results strongly agree with this expectation (the higher the order – the more and more first digits stabilize, see Fig. 4) indicating that for some constants and large . A similar expansion evidently holds in the case of the case of the Second method (see the next page) as well. Having computed the first 100 coefficients , we fix and , and experimenting with the order m, we find that the first 10 decimal digits stabilize pretty quickly as m grows (not indefinitely), see the table at the end of the text. Surprisingly, the first 10-decimals approximation persists for m even larger than the bound () set to avoid the Runge’s phenomenon, if the coefficients of for k large start to diverge but the 10-12 decimals approximation persists. The same approximation is obtained even as increases, and remains the same even when the number of data is as small as 10. After several such experiments and keeping attention to some more decimals, we find that Γ, with 12 decimal digits precision, is: 6.361878187125.
Approximations of the Stokes constant via extrapolation. The extrapolation is obtained by the method of least squares fitting to data. The latter are obtained from the first method.
Lastly we calculate the first coefficients with precision of at least 800 decimal digits and start extrapolating with the method of least squares (on a sample , with for example) as well as directly, first at order 1. We notice (in both methods) that as the order of extrapolation increases the data change “in a continuous manner” stabilizing more and more first decimal digits, until it reaches a critical value that depends on the number of data (the higher the number the higher the critical value) where the pattern breaks and the results become inconsistent. However, this comes as no surprise to us due to Runge’s phenomenon. Slightly varying the parameters of the problem, mainly the number n of terms, the number in the sample in the least squares fitting and experimenting the order of extrapolation we see these two extrapolation tricks (with order ) tend to agree in the first 20 digits (unless we get very loose with the parameters). Also, for fixed m and fixed , the approximation obtained by the least squares fitting looks like it converges when increases, similarly when , are fixed and n increases, taking these in mind we’ve obtained an indication that: .
Now we move on to the second method and cross-check the obtained results. Recall from Eq. (2.39). For simplicity, since the values of and do not really matter we drop from the subscript of and simply denote them by .
The second method consists of directly approximating the difference of solutions , with “initial conditions” governed by the formal sum :
The lower bound is arbitrary, and we have chosen it to be 10 just for simplicity.
Step 2: Optimally truncate the series with respect to z (in this case )
Step 3: For , solve the ψ-parametric initial value problems ():
where the contour of integration is: respectively, i.e. the line segment that connects and .
Step 4: Calculate:
However, unlike the first method which directly computes Γ by its definition, it’s not very clear the limit in (3.4) equals Γ, even though it’s intuitive. The initial conditions in (3.3) are not equal to (the conditions that uniquely define ) but provide an approximation. In fact they are “exponentially close” to them since they are the optimally truncated Gevrey series to which the are asymptotic, see the Exponential accuracy remark in [5]. The reason why this method works is that the error of these approximations is smaller than the exponential quantity (Eq. (2.42)) we try to evaluate.
We can now show the following proposition:
Letbe the numerical solutions obtained by the second method (i.e. the ones that solve the Initial Value problem (
3.2
)–(
3.3
) numerically) and assume they satisfy:for large(as in Theorem
2.1
),2
Numerical experiments very strongly support the previous assumption (as well as that: , which is necessary in order to ensure that the obtained numerical solutions follow the respective actual solutions to (3.2)–(3.3) closely enough.
then we have:
It suffices to study the difference , since by symmetry, we obtain information on the difference too. For simplicity, we drop the subscripts ± from , for now. We set where , , and and considering ψ as a parameter we define and consider the equation:
(see below – (3.10) – for and f) and equip it with the initial condition:
Similarly we define the “truncated” system:
with the initial condition:
We define and by equations (3.8)–(3.9) we get that satisfies:
with where
and:
defined as the coefficient of (fourth dimension) by:
By standard theory of ODEs we can ignore the “”-correction terms in the aforementioned asymptotic expansion of as they don’t have any qualitative importance. So, we treat the later as (the leading term of the asymptotic behaviour). With this in mind, we slightly abuse notation and so from standard theory, the system (3.11) has a unique solution given by:
Also: , (at ∞) for . We fix , and have (Proposition 2.6): , so for N in a neighbourhood of infinity we have:
and for some we have:
From Stirling’s formula we have:
for some and (optimal truncation rule), and since we have: .
So, by (3.13) we have:
for some . In order to proceed with estimating , we return to (3.12) and analyse the matrix , we have:
For simplicity, we will ignore the terms from and from , as in the limit they become so small compared to any other terms, that they do not have a qualitative effect on our results (no qualitative effect on the eigenvalues). We integrate Eq. (3.11) from 0 to t, and obtain a first-order linear integral equation whose characteristic polynomial of evaluates as: which gives us 4 distinct eigenvalues, two real and two (conjugate) purely imaginary: and (as ).
The corresponding eigenvectors are:
Therefore, from standard theory of ODE’s and Linear Algebra (Jordan Canonical Form) we can “factorize” (decompose) the matrix as follows: where:
and the (invertible) matrix whose columns consist of the eigenvectors that correspond to the eigenvalues respectively (first two columns) and the real and imaginary part of the (complex) eigenvector that corresponds to the eigenvalue as third and fourth column respectively. Again, we proceed with standard theory and we have:
Returning to Eq. (3.12), we get: . However, and as , and that is because: and since and the elements of (i.e. the sub-determinants of P) are bounded (they are “at most ”). In other words, we have:
Similarly for and by subtracting these and rearranging a few terms we get (3.5). □
The first and second method are consistent with each other in computing the same constant.
Now that we know that the second method agrees with the first, we implement it in Mathematica 12.0. The code is at the end of this section and evaluates , the first 6 lines calculate the first 200 terms of the sequence with practically arbitrary precision. Notice the symmetry , and so when we have that and so , i.e. the solution is enough to approximate the Stokes constant. This trick halves the computation time. Another approximation is
Theorem 2.1 indicates that extrapolating by best-fitting functions of type to the data (obtained by the second method) is fruitful (strongly indicates it for ). We apply:
Step 1: Calculate: when , are equidistant integers such that , for each , where is a “large enough” value, let , and let for some and a sufficiently large amount of calculations.
Step 2: Find the best-fit of the functions for () to the data , where the last inequality is imposed in order for us to avoid Runge’s Phenomenon.
As in the case of the first method, we apply the procedure several times, each time with setting different values at the parameters (, , , L and m): In particular we repeat the experiment after applying small changes to these parameters and study how do they affect the result, by observing whether the final result changes “continuously” (small changes to parameters ↦ small changes to the result) and how consistent it is with the results obtained by the first method. After several repetitions, we can safely say that the final results depend continuously on the values of the aforementioned parameters. However, this method is a lot more “unstable” than the first method (small changes to parameters result in larger and larger changes of the result), but this comes as no surprise to us since almost every common method of numerical integration will produce more errors, as they require multiple steps to be executed. Keeping this in mind, we observe that the extrapolated results tend to agree in the first 5–10 decimal digits, unless we get very loose with parameters (e.g. let , become very small) which means that at least the first 5 decimal digits these two results have in common are precisely the decimal digits of the Stokes constant. The reason is that since these two methods work independently, it is impossible of these two being both wrong while agreeing to the same (“wrong”) result, especially when they keep agreeing when small changes on their parameters are applied to them on each of the many repetitions.
The second method does not work if is chosen too large or small compared to . For the first case the reason is that the numerical errors increase as increases because the integration takes place on a larger interval (more steps implies more errors). On the other hand, if we choose to be small enough, then the error on the initial conditions will be “comparable” to , ( and large) and the term which will be multiplied by: for the computation of the Stokes constant will magnify the errors. So, as increases, a choice of , like is what we need to obtain an accurate approximation of Γ.
Problems similar to the one that motivated our study are studied in [10,11,13] and [3] as well as in [6] where the author points out some critical mistakes in the literature. The case of the Discrete Klein-Gordon model with bistable nonlinearity as presented in [1] (example 3) may be treated in same way too, but a proof of that diverges from the purpose of this paper, which is to present a simplified approach to these problems with computational methods that lead to strong numerical results regarding the Stokes phenomenon.
The same procedure can easily be applied to problems similar to our main problem but with nonlinearities higher than cubic. The corresponding formulae for will involve stronger nonlinearities yet they will be able to be tackled by the tricks in Proposition 2.6 (which can also be used to obtain bounds for the Stokes constant). The formal series that emerges will have a algebraic branch point but we will still be able to extract a solution in a form of a Laplace transform. Formally, we may obtain a transseries solution to these problems in the form , where is a formal negative power series and this analysis is expected to give insights to higher order correction terms, but rigorous theory is still developing. One way to proceed rigorously, involves the implementation of Resurgent Theory, which loosely speaking, studies formal expansions and generalized Borel-Laplace transforms of complex functions with isolated singularities. This theory is a very powerful mathematical tool as it can be applied to a wide class of dynamical systems, see for example [8] for an introduction.
Lastly, it is worth mentioning that in 2015, P. H. Trinh and S. J. Chapman ([12]) published a paper where they studied certain classes of water wave problems, in which the terms of the corresponding asymptotic expansion are characterized by “exponential over power” rate of divergence.
Footnotes
Acknowledgements
The author is grateful to Prof. Vassily Gelfreich for his very useful advice on several aspects of this topic and to Mr. Frankie Higgs for proofreading this text and providing very useful suggestions for improvement.
References
1.
G.L.Alfimov, E.V.Medvedeva and D.E.Pelinovsky, Wave systems with an infinite number of localized traveling waves, Physical Review Letters112(5) (2014), 054103. doi:10.1103/PhysRevLett.112.054103.
2.
J.P.Boyd, Weakly Nonlocal Solitary Waves and Beyond-All-Orders Asymptotics: Generalized Solitons and Hyperasymptotic Perturbation Theory, Springer Science & Business Media, 2012.
3.
A.R.Champneys, Codimension-one persistence beyond all orders of homoclinic orbits to singular saddle centres in reversible systems, Nonlinearity14(1) (2001), 87. doi:10.1088/0951-7715/14/1/305.
4.
A.R.Champneys, B.A.Malomed, J.Yang and D.J.Kaup, Embedded solitons: Solitary waves in resonance with the linear spectrum, Physica D: Nonlinear Phenomena.152 (2001), 340–354. doi:10.1016/S0167-2789(01)00178-6.
5.
O.Costin, Asymptotics and Borel Summability, CRC Press, 2008.
6.
C.N.Foley, Exponential asymptotics in wave propagation problems, Ph.D. Thesis, University of Edinburgh, 2013.
7.
J.Fujioka, A.Espinosa-Cerón and R.F.Rodríguez, A survey of embedded solitons, Revista mexicana de física52(1) (2006), 6–14.
8.
V.Gelfreich and D.Sauzin, Borel summation and splitting of separatrices for the Hénon map, InAnnales de l’institut Fourier51(2) (2001), 513–567. doi:10.5802/aif.1831.
9.
D.W.Gillam and V.P.Gurarii, On functions uniquely determined by their asymptotic expansion, Functional Analysis and Its Applications40(4) (2006), 273–284. doi:10.1007/s10688-006-0044-x.
10.
A.Tovbis and D.Pelinovsky, Exact conditions for existence of homoclinic orbits in the fifth-order KdV model, Nonlinearity19(10) (2006), 2277. doi:10.1088/0951-7715/19/10/003.
11.
P.H.Trinh, Exponential asymptotics and Stokes line smoothing for generalized solitary waves, in: Asymptotic Methods in Fluid Mechanics: Survey and Recent Advances, Springer, Vienna, 2010, pp. 121–126. doi:10.1007/978-3-7091-0408-8_4.
12.
P.H.Trinh and S.J.Chapman, Exponential asymptotics with coalescing singularities, Nonlinearity28(5) (2015), 1229. doi:10.1088/0951-7715/28/5/1229.
13.
J.B.Van den Berg and J.R.King, Vanishing beyond all orders: Stokes lines in a water-wave model equation, Nonlinearity23(1) (2009), 1.