This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
• C denoting an "approximation operator" for <£, define ( il>[h,
\
R + with the properties that A(0) = 0 and, for all (h,x) G (0, ho] x S,
R n (or locally, $ : R x f l ^ R n ; or $ : R x M -*• Mn). Consequently, for h G (0, ho] fixed, discretization theory is part of perturbation theory for discrete-time dynamical systems. However, with h —> 0, both ip(h, •) and $(/i, •) approach the identity, an operator ) = b(6t(u>)) where 6t : O, —> Q is a metric dynamical system, i.e. with u> —*• 9t{u) measurable rather than continuous. Here Q is the sample space in an appropriately chosen probability space ( n , j F , P). The physical interpretation of a point (to, x) is also not obvious here.
41
which behaves badly in perturbation theory: The behavior of h as of a small parameter is not entirely regular. We conclude that the proof of a qualitative result in discretization theory requires a thorough reconsideration of the proof of the underlying abstract perturbation result in discrete dynamics with stepsize h as an additional small parameter, and the derivation of the accompanying error estimates. 3.
Q u a l i t a t i v e N u m e r i c s for Delay Equations
What we described in the last paragraph for ordinary differential equations remains valid for delay equations, too. However, one is confronted with two major difficulties. These are the lack of uniform local error estimates and the lack of backward solvability. Fortunately, for L large enough say L > L*, the closed set CLip(L) = {v £ C\v is Lipschitz with constant Lip(?y) < L} is positively invariant with respect to the exact as well as to the discretized dynamics. By (13) and (15), C J estimates on CUP(L) a r e uniform. Badly enough, CLiP(it) is nowhere dense in C. What really helps is the smoothing/compactifying property of the exact and the discretized dynamics. As for the asymptotic theory, it implies that dynamical systems in finite and semidynamical systems in infinite dimension can be treated in a parallel way [Hale, 1988]. Distinguished subsets of the phases space like unstable manifolds of hyperbolic equilibria or of hyperbolic periodic orbits, inertial manifolds, and compact attractors consist of full trajectories i.e. trajectories defined on the entire real line R. In particular, compact attractors and certain kinds of invariant manifolds of delay equations belong to CLip(£*)- This is why, in a final analysis, their qualitative discretization properties are (almost) the same as of their counterparts in ordinary differential equations. From now on, let p > 2 and assume that all the regularity conditions we imposed on (1) in Sec. 2.1 are satisfied. 3.1.
The simplest configurations
hyperbolic
orbit
The three major objects of the phase space investigated in [Stuart & Humphries, 1996] on numerical
42
B. M. Gamy
ordinary differential equations are • compact attractors (i.e. asymptotically stable compact invariant sets) • hyperbolic periodic orbits • hyperbolic equilibria, together with their stable and unstable manifolds In a well-defined technical sense, compact attractors, the saddle structure about hyperbolic equilibria, and periodic orbits are only slightly perturbed under discretization. As for compact attractors, the hyperbolic structure preserved is the transversal intersection structure between trajectories near the attractor and the level surfaces of suitable Liapunov functions. (The dynamics within the attractor itself is not assumed to be hyperbolic and can be changed dramatically under discretizaton.) The presentation in [Stuart & Humphries, 1996] is based on the original papers [Kloeden & Lorenz, 1986; Beyn, 1987a, 1987b]. No doubt these three papers belong to those few marking the birth of numerical dynamics as an independent field of research in the late eighties. In what follows we present the corresponding results for delay equations.
c?
(¥ , Af,iVF/( 1 / iV ' r ?)' r i/iv) ^ K-[ik/N depends on t); fj, < 1 is fixed) such that dHausdorff(r,r1yjV) < const /Np. • B.2.) [Farkas, 2003]: LetT be a hyperbolic periodic orbit for the continuous-time solution semidynamical system $ and assume that the period of F is at least two (i.e. two times the delay). Then, for stepsize-h sufficiently small (and not only for h = 1/N with N large), the discrete-time semidynamical system
In line with (17) and the general estimates for discretized normally hyperbolic compact invariant manifolds of ordinary differential equations [Garay, 2001], it seems plausible in Parts (Bl) and (B2) that p+r FI/JV = -7"i/iv(r) where T\j^ is a C embedding n of T into R and the norm distance in C J ( T , R n ) between T\JN and the inclusion of F in R n is of order i/jV min {p,P+r-j} ; j = 0 , 1 , . . . ,p + r. The unpublished PhD dissertation Gyula Farkas: On Numerical Dynamics of Functional Differential Equations, Budapest University of Technology, 2002, contains a lower semicontinuity result Theorem 1. Consider the delay equation x(t) = for discretized compact attractors of delay equaf(x(t),x(t - 1)) and let ^M,NFI • (0,h{] x C —> C tions, the analogue of the one in [Stuart & be a Runge-Kutta discretization operator with stanHumphries, 1996] from the theory of discretized dard interpolant. ordinary differential equations. As for upper semicontinuity, Farkas refers to [Gedeon & Hines, 1999] • A.) [Kloeden & Schropp, 2004]: Let 0 ^ A be a on upper semicontinuity of Morse sets under explicit ODE-Euler discretization of a one-dimensional compact attractor for the continuous-time delay equation (which results in a cyclic feedsolution semidynamical system $ . Then, for back system of ordinary differential equations). stepsize-1/N sufficiently small, the discreteThough conceptually much easier, we note that time semidynamical system fM,NFi(^/N,-) has Theorem l.A is not a consequence of the results a nonempty compact attractor AI/N and the in [Gedeon & Hines, 1999]. limiting process Ai/N —» A as N —• oo {both For the rest of this subsection, we assume that in C L J P ^ ) with nice Liapunov estimates and /(0,0) = 0 or, equivalently, that r/o = 0 6 C is consequently, by using the general attraction an equilibrium for $. The next result starts with a results in Chapter 2 of [Hale, 1988], also in C) is center-unstable versus strongly-stable C = CU x SS upper semicontinuous. product decomposition of the phase space (invariant • B.l.) [In't Hout & Lubich, 1998]: Let V be with respect to the linear semidynamical system an exponentially stable periodic orbit for the generated by the solutions of the linearized equation continuous-time solution semidynamical system y(t) = ti(0,0)y(t) + f^(Q,0)y(t-l) and determined
A Brief Survey on the Numerical Dynamics for Functional Differential Equations
Theorem 2 [Farkas, 2002a]. Consider the delay equation x(t) = f(x(t), x(t — 1)) again and let fP,E,PLi{l/N, •) : C1/N —• CI/JV be the stepsize-1/N practical explicit Euler discretization operator with piecewise linear interpolant. Assume that the equilibrium point 0 G C has a center-unstable manifold of the form Graph(G), where G : CU —> SS is a C2 function. Then for N large enough (and under very 'mild additional technical conditions) C\i^ admits a center-unstable versus strongly-stable C\m = CUI/N x SSI/N product decomposition with the properties as follows. Operator
- • 0 as N -> oo. (18)
Together with Graph(Gr), also Graph(G1/7V) is eayonentially attractive, with asymptotic phase depending continuously on the stepsize as N —> oo. Theorem 2 in [Farkas, 2002a] is accompanied by C2 existence and C 1 approximation results for exact and discretized stable manifolds that correspond to S in the center-unstable versus stable product structure CU x S where S is the finite-dimensional invariant subspace determined by a bounded set of the roots of the characteristic equation lying to the left of those belonging to CU. In the case of hyperbolic equilibria, also a numerical GrobmanHartman lemma for partial linearizations [Farkas, 2001b] as well as C 1 shadowing results [Farkas, 2002a] are given. As a preparation for the next subsection, we recall the simplest ordinary differential equation result on numerical structural stability [Garay, 1996]. The numerical saddle structure results in [Beyn, 1987a] can be interpreted as follows: Given a hyperbolic equilibrium XQ G R n of an ordinary differential equation, there exist a neighborhood U of XQ in R n , a constant K > 0 and, for each h G (0, /i|], there exists a homeomorphism Tih oili into R n with the properties that T~(-h(xo) — xo
an
d
\1~t-h{x) ~ x\ < nhp
for each i e W
(19)
43
and, last but not least, Hh($(h,x)) whenever
=
(20)
In other words, in the vicinity of hyperbolic equilibria, the exact and the discretized dynamics are conjugate and discretization is nothing else but an almost-identical coordinate transformation. With Hh being a Cp+r diffeomorphism, note that (19) and (20) can be proved in the vicinity of nonequilibria, too [Garay & Simon, 2001].
3.2.
Inertial manifolds and structural stability
Throughout this subsection, we restrict ourselves to a certain type of delay equations with small delay. The smallness of the delay seems to be necessary for the C2 smoothness of the inertial manifold. (The existence of C 1 inertial manifolds can be proved with moderate delay. However, if the delay is not small, then the gap condition (which is the basis for proving higher order smoothness) is violated and, for the time being, there is no way out of this difficulty. For details and references, see [Robinson, 1999; Farkas, 2002b, 2002c; Chicone, 2003]. Here we restrict ourselves to reminding the reader that inertial manifolds are global center-unstable invariant manifolds.) On the other hand, the C2 smallness of the inertial manifold is necessary to apply [Li, 1997] on numerical structural stability for ordinary differential equations in proving Part B of the Theorem below. All numerical structural stability results we are aware of require at least C2 smoothness assumptions. Recall the definition of the practical stepsize1/7V explicit Euler discretization operator
44
B. M. Garay
exists a homeomorphism T~L\/N o / R n onto Graph (Jf/N) and a continuous time-reparametrization mapping r£ /AT : R n —> R + such that
(0, £o], the delay equation has an invariant manifold of the form Graph(J £ ) where Je : CU£ —• SS£ is of class C2, the linear subspace CU£ is finite-dimensional, and the C£ — CU£xSS£ product decomposition is given by CU£ = TT£(C£), SS£ = (id\c - ire){C£) with ir£ : C£ -»• C£, (7r£(r?))(s) = e ^ ^ O ) , 8 e [-£,0]. In addition, for N large enough (and under very mild additional technical conditions), C£,N admits a = CU\,N x SS£X,N product decomposition with the properties as follows. Operator (fy, E PLI(1/N, •) has an invariant manifold of the form Gr&ph(J£,N), where J£,N : CU^^ —> SS' 1,N is a C function. In addition, there exists £ £ CU\,N such a linear Inea isomorphism P /N '• CU that for j = 0 and j = 1
He1/Nmri/N(x),x))
=
whenever
If \P is Morse-Smale and gradient-like, 1/iV (x) = 1/N for each i e R " .
(22) then
The reader is asked to make a comparison between (18) and (21) as well as between (20) and (22). The proof of Theorem 3 requires a very careful handling of standard inertial manifold techniques like spectral decomposition, manipulations di di a TT£ Te - —— JT£ P6 0 as N — > oo. dVi lll/NJ l/Nn/N with cut-off functions on finite-dimensional subdr]j spaces, fixed-point equations in weighted sequences (21) of Banach spaces, fiber contraction theorem, etc. £ £ Together with Graph(J ), also Graph(J , jV ) is extended for discretizations. As for numerical strucexponentially attractive, with asymptotic phase tural stability, it is just an application of the fundepending continuously on the stepsize as damental theorem on numerical structural stability N -> oo. in [Li, 1997], derived as by-product of the Moser• B. [Farkas, 2002c]: (CONTINUATION.) Assume, Robbin-Robinson approach to Smale's structural in addition, that the solution flow f : R x R n —• stability theorem. R n of the limiting ordinary differential equation x — Ax + a(x) + b(x) is structurally stable and that the point at the {oo} of R n 3.3. Kamke monotonicity is repulsive. Then, for N large enough, there Assume that, for some constant 7 > 0, condition '(fi)'Xj(x,y)>7
(fiyyj(x,y)>j
if(x,2/)6R"xR",
i,j
if(x,j/)eR n xR", i,j
Here of course /j stands for the ith coordinate function of / , further x = (x\,X2, • • • ,xn) and y = (2/1)2/21 • • • iVn) denote the first n and the last n coordinate variables of fi, i = 1,2,...,n, respectively. By letting x < x for x, x € R n if and only if Xi < xi for each i = 1,2,...,n, a closed partial order on R n is defined. The closed partial order < on R n generates a closed partial order < on C. In particular, n < 7) holds if and only if v(s) < v(s) f° r e a c n s £ [—1,0]. As an easy consequence of assumption (20) the semi-dynamical system $ is Kamke monotone [Smith, 1995]. In other words, inequality $(£,rj) •< $>(t,fj) holds true whenever t > 0 and 77,7? 6 C with rj ^ fj.
1,2,... ,n and i ^ j , (23)
1,2,.
..,n
Theorem 4. Consider the initial value problem (1) under condition (23). Then • A. [Garay & Loczi, 2004]: Let 7 > 0. Given any Runge-Kutta method M satisfying bi > 0 for i = l,...,v, the discretization operator
A Brief Survey on the Numerical Dynamics for Functional Differential Equations
i — 1,2, . . . , n . Then, for sufficiently small stepsize-h and for any nondecreasing initial function T), we have that ^PE,PLi{h,rj) •< $(/i, 77) -<
45
x(t) = Lxt + g(xt), respectively. Here L : C —> R n is a bounded linear operator (which, by a theorem of Riesz, can be represented as a Stieltjes integral
An iterative combination of Parts A and B formulates and generalizes the well-known observation that, given a one-dimensional ordinary differential equation with all solutions convex, then every solution curve is above the broken line determined by the explicit, and under the broken line determined by the implicit Euler method. Part C is entirely of different character. In a strong resemblance to results on contractivity in numerical ordinary differential equations [Hairer et al., 1993], it provides a sufficient condition for a Runge-Kutta method to preserve monotonicity of the solution dynamics under discretization. In the light of the elegant counterexamples in [Kloeden & Schropp, 2003], this sufficient condition is almost necessary. Even in the numerical contexts of differential equation theory, the word "monotonicity" can be used in a number of various ways. Monotonicity of iterative methods for delay equations has already been investigated in [Erbe & Liu, 1991].
The general definitions above have little relevance to practical purposes. For example, in all numerical implementations we are aware of, Lr\ is replaced by a finite sum like E £ i N-1 (t?((l - j)/N)-&(-j/N)) r,(-~j/N). Several references on the numerics of retarded functional differential equations — chosen in the spirit of the Bellen-Zennaro monograph — are contained in [Maset, 2003]. The numerics of equations with infinite delay — partly because of the depth of the underlying functional analysis — is more complicated. There are only sporadic results into this direction [Liu, 1997]. We cite also the papers [Koto, 1999; Insperger & Stepan, 2002] representing those devoted to some qualitative aspects of numerical bifurcation and numerical stability of retarded/delay equations. We are not aware of any papers on the numerics of delay equations with computer-assisted proofs. All in all, we conclude by emphasizing that the large gap that characterized the relation of abstract dynamical systems theory and the numerical practice of solving differential equations until the early nineties of the last century, has been considerably filled in the last ten years. Having read papers like [Shub, 1986] or [Matijasevich, 1985] on numerical methods, it is clear to us that many of the most distinguished mathematicians have (i) hoped for (ii) guessed (iii) foreseen (iv) worked for this development. Among them John von-Neumann is pioneer number one.
4.
Acknowledgments
T-interval
[0,TQ\.
R e m a r k s o n Functional Differential E q u a t i o n s
The previous considerations suggest that all the Theorems above are valid for retarded functional differential equations of the form x(t) = g(xt) where xt(s) = x(t + s) for s e [0,1], and g : C ->• R n is of class Cp,p> 2. Gyula Farkas has always formulated his results in this more general framework. However, occasionally, he carried out the proofs only for the special case g{xt) = f(x(t),x(t — 1)) and indicated the technical modifications needed for a general g. He considered assumptions (2)-(4) in [Farkas, 2003] and assumptions (i)-(vi) of his Lemma 8 in [Farkas, 2002c] general definition of discretization operators for equations of the form x(t) = g(xt) and
Parts of this paper were written during a stay of the author at the University of Padova. Hospitality of the Department of Mathematics is gratefully acknowledged. The author is indebted to Wolf-Jiirgen Beyn, Giovanni Colombo, Peter Kloeden, and Johannes Schropp for valuable discussions during the preparation of the paper. The paper is supported by the Hungarian National Science Foundation OTKA No. T037491. References Bellen, A. [1984] "One-step collocation for delay differential equations," J. Comput. Appl. Math. 10, 275-283.
46 B. M. Garay Bellen, A. & Zennaro, M. [2003] Numerical Methods for Delay Differential Equations (Oxford University Press, Oxford). Beyn, W. J. [1987a] "On the numerical approximation of phase portraits near stationary points," SIAM J. Numer. Anal. 24, 1095-1113. Beyn, W. J. [1987b] "On invariant closed curves of onestep methods," Numer. Math. 51, 103-122. Beyn, W. J. & Lorenz, J. [1987] "Center manifolds of dynamical systems under discretization," Num. Fund. Anal. Optimiz. 9, 318-414. Butcher, J. F. [1987] The Numerical Analysis of Ordinary Differential Equations (Wiley, London). Chicone, C. [2003] "Inertial and slow manifolds for delay equations with small delays," J. Diff. Eq. 190, 364-406. Erbe, L. & Liu, X. [1991] "Monotone iterative methods for differential systems with finite delay," Appl. Math. Comput. 43, 43-64. Farkas, G. [2001a] "Unstable manifolds for RFDEs under discretization: The Euler method," Comput. Math. Appl. 42, 1069-1081. Farkas, G. [2001b] "A Grobman-Hartman result for retarded functional differential equations with an application to the numerics of hyperbolic equilibria," Z. Angew. Math. Phys. 52, 421-432. Farkas, G. [2002a] "A numerical C 1 -shadowing result for retarded functional differential equations," J. Comput. Appl. Math. 45, 269-289. Farkas, G. [2002b] "Nonexistence of uniform exponential dichotomies for delay equations," J. Diff. Eq. 182, 266-268. Farkas, G. [2002c] "Small delay inertial manifolds under numerics: A numerical structural stability result," J. Dyn. Diff. Eq. 14, 549-588. Farkas, G. [2003] "Discretizing hyperbolic periodic orbits of delay differential equations," Z. Angew. Math. Mech. 83, 38-49. Garay, B. M. [1996] "On structural stability of ordinary differential equations with respect to discretization methods," Numer. Math. 72, 449-479. Garay, B. M. [2001] "Estimates in discretizing normally hyperbolic compact invariant manifolds of ordinary differential equations," Comput. Math. Appl. 42, 1103-1122. Garay, B. M. & Simon, P. L. [2001] "Numerical flowbox theorems under structural assumptions," IMA J. Numer. Anal. 2 1 , 733-749. Garay, B. M. & Loczi, L. [2004] "Monotone delay equations and Runge-Kutta discretizations," Fund. Diff. Eq. 11, 59-67. Gedeon, T. & Hines, G. [1999] "Upper semicontinuity of Morse sets of a discretization of a delay-differential equation," J. Diff. Eq. 151, 36-78.
Hairer, E., Norsett, S. P. & Wanner, G. [1993] Solving Ordinary Differential Equations I. Nonstiff Problems (Springer, Berlin). Hale, J. K. [1977] Theory of Functional Differential Equations (Springer, Berlin). Hale, J. K. [1988] Asymptotic Behaviour of Dissipative Systems (AMS, Providence). Insperger, T. & Stepan, G. [2002] "Stability chart for the delayed Mathieu equation," Roy. Soc. London Proc. Ser. A. Math. Phys. Eng. Sci. 458, 1989-1998. In't Hout, K. k Lubich, Ch. [1998] "Periodic orbits of delay differential equations under discretization," BIT 38, 72-91. Kloeden, P. E. & Lorenz, J. [1986] "Stable attracting sets in dynamical systems and their one-step discretization," SIAM J. Num. Anal. 23, 986-995. Kloeden, P. E. & Schropp, J. [2003] "Runge-Kutta methods for monotone differential and delay equations," BIT 43, 571-586. Kloeden, P. E. & Schropp, J. [2004] "Stable attracting sets in delay differential equations and in their RungeKutta discretization," submitted. Koto, T. [1999] "Neumark-Sacker bifurcation in the Euler method for a delay differential equations," BIT 39,110-115. Li, M. C. [1997] "Structural stability of flows under numerics," J. Diff. Eq. 141, 1-12. Liu, Y. [1997] "On the (9-method for delay equations with infinite time lag," / . Comput. Appl. Math. 7 1 , 177-190. Maset, S. [2003] "Numerical solution of retarded functional differential equations as abstract Cauchy problems," J. Comput. Appl. Math. 16, 259-282. Matijasevich, Yu. V. [1985] UA posteriori interval analysis," EUROCAL, Vol. 2., ed. Caviness, B. F. (Springer, Berlin), pp. 328-334. Robinson, J. C. [1999] "Inertial manifolds with and without delay," Discr. Cont. Dyn. Syst. 5, 813-824. Shub, M. [1986] "Some remarks on dynamical systems and numerical analysis," Dynamical Systems and Partial Differential Equations, eds. Lara-Carrero, L. & Lewowicz, J. (Univ. Simon Bolivar, Caracas), pp. 69-91. Smith, H. L. [1995] Monotone Dynamical Systems (AMS, Providence). Stuart, A. M. & Humphries, A. R. [1996] Dynamical Systems and Numerical Analysis (Cambridge University Press, Cambridge). Zennaro, M. [1986] "Natural continuous extensions of Runge-Kutta methods," Math. Comput. 46, 119-133.
BIFURCATIONS AND CONTINUOUS T R A N S I T I O N S OF ATTRACTORS IN AUTONOMOUS AND NONAUTONOMOUS SYSTEMS P. E. K L O E D E N and S. SIEGMUND Fachbereich Mathematik, Johann Wolfgang Goethe D-60054 Frankfurt am Main, Germany
Universitat,
Received February 16, 2004; Revised J u n e 8, 2004
Nonautonomous bifurcation theory studies the change of attractors of nonautonomous systems which are introduced here with the process formalism as well as the skew product formalism. We present a total stability theorem ensuring the existence of nearby attractors of perturbed systems. They depend continuously on a parameter if and only if the attraction is uniform w.r.t. parameter, i.e. the attractors are equiattracting. We apply these principles to explicit systems to clarify the meaning of continuous and abrupt transitions of attractors in contrast to bifurcations, i.e. splitting of minimal invariant subsets into others within the attr actor. Several examples are treated, including a nonautonomous pitchfork bifurcation. Keywords: Total stability; attractor transition; attractor bifurcation; subcritical bifurcation; supercritical bifurcation; nonautonomous pitchfork bifurcation; nonautonomous dynamical system; process; skew product flow.
1.
Introduction
Underlying our considerations are t w o general principles. T h e first is the concept of t o t a l stability: if a system has a uniformly asymptotically stable compact set, such as a global a t t r a c t o r , then so do all nearby systems. In the a u t o n o m o u s case, the perturbed systems then have a t t r a c t o r s , which converge in general upper semicontinuously t o t h a t of the original system. In the n o n a u t o n o m o u s case, t h e p e r t u r b e d systems also have nearby compact absorbing or attracting sets, but the existence of attractors is complicated by the ambiguity of just how an attractor should actually be defined in nonautonomous systems — we will introduce the reader to several possibilities below. The idea of total stability underlies a rarely mentioned fact in autonomous bifurcation theory. Although subcritical and supercritical bifurcations are commonly encountered in such systems, it is not always easy to determine which of t h e m actually occurs. However, if— at the bifurcation p o i n t — an
We have several aims in writing this article, which is really more an essay t h a n a research, survey or tutorial paper, although it contains elements of all three. Two main aims of particular long term interest are to understand what is meant by 1. a bifurcation or transition of a nontrivial attractor set in an autonomous system (e.g. such as a Lorenz attractor in its chaotic regime or a Chua attractor), 2. a bifurcation in a nonautonomous system. As we shall see, b o t h are closely related through the skew product flow representation of nonautonomous dynamical systems. Our discussion is by no means complete. Nevertheless, we hope t h a t our comments will provide the reader with some insight into the issues that are involved and will stimulate further investigations. 47
48
P. E. Kloeden & S. Siegmund
equilibrium point remains asymptotically stable for the nonlinear system when it loses stability in the linearized system, then the bifurcation is supercritical (e.g. see [Arrowsmith &. Place, 1990, Theorem 4.2.1] in connection with Hopf bifurcations). In this case the global (or maximal if only a local) attractor of the nonlinear system in fact depends continuously on the bifurcation parameter. We will see below that this also holds for a subcritical bifurcation at the point of loss of linear stability, but not where the nonlocal bifurcating equilibrium points first arise. This is a consequence of a second general principle: as recently shown in [Li & Kloeden, 2004a] (see also [Li & Kloeden, 2004b; Wang et al., 2004]), attractors depend continuously on a parameter if and only if they are equiattracting, i.e. uniformly attracting with respect to the parameter. The term "bifurcation" usually refers to situations when a system linearized about a minimal invariant set such as an equilibrium point, a periodic solution or an almost periodic solution loses asymptotic stability and several new invariant sets come into existence. Can one really talk about the bifurcation of a general global attractor? Firstly, it is not clear about which solutions within a global attractor one should linearize and, secondly, a global attractor is both unique and connected, if it exists, so cannot split into new disjoint invariant sets. Obviously, one needs to think in terms of changes of the dynamics within the global attractor rather than of the attractor itself. We will use the term transition when discussing changes to the attractors as system parameters vary and reserve the term "bifurcation" for the usual situations mentioned above, i.e. the splitting of minimal invariant subsets into others within the attractors. In particular, we will refer to a continuous transition when the global (or maximal if only local) attractors depend continuously on the parameters and to an abrupt or discontinuous transition when the attractors depend only upper semicontinuously (and not continuously) on the parameter. We will see in many examples that although transitions, in general, need only be abrupt, they are in fact typically continuous for most parameter values. Next we describe the structure of this article, followed by some notation at the end of this section. Section 2 deals with autonomous systems and some of their bifurcations. It contains scalar examples of a supercritical and a subcritical bifurcation and an explanation why e.g. the transcritical
bifurcation does not fit into our total stability scenario. We also give examples of supercritical, subcritical and saddle-node bifurcations for triangular autonomous systems. In Sec. 3 we introduce nonautonomous systems from two different points of views using the process formalism and the skew product formalism. Our examples are a nonautonomous version of the autonomous example for the supercritical pitchfork bifurcation and triangular autonomous systems, now interpreted differently. Section 4 contains our theorem on total stability of nonautonomous systems under a uniform parametric dependence condition. We apply it in Sec. 5 to derive conditions for continuous bifurcations, e.g. supercritical bifurcations. Section 6 concludes the discussion with some remarks and open questions. The proof of the total stability theorem is contained in an Appendix. The Hausdorff semi-metric H^(A,B) of nonempty compact subsets A and B of a metric space (X, d) is defined as H*X(A,B)
:=maxdist(a,.B), where dist(a, B) := min d(a, b), b£B
and HX(A,B)
= mzx{Hx(A,B),Hx(B,A)}
is a
metric, called the Hausdorff metric, on the space of nonempty compact subsets of (X,d). Remark 1. To simplify the exposition we will always assume that we have global bounds and constants (e.g. in Lipschitz conditions and approximation estimates). Our theorems and proofs are in fact valid for locally defined bounds and constants, but require technical modifications (e.g. see [Kloeden & Lorenz, 1986]), which, we feel, distract from our emphasis here on the dynamical behavior.
2. Autonomous Systems We begin with several examples of well-known bifurcations in scalar autonomous systems and in twodimensional triangular autonomous systems, which provide simple but useful insights into the topics we wish to discuss.
2.1.
Scalar autonomous
systems
2.1.1. Supercritical bifurcation The autonomous differential equation — =
vx
- bx3
(1)
Bifurcations and Continuous
with b > 0 has a global attractor Av — {0} for v < 0. For v = 0, the equilibrium point 0 loses asymptotic stability for the linearized equation (it remains stable there), but the set AQ = {0} is still a global attractor for the nonlinear system. To see this we use the Lyapunov function V(x) x2 to obtain d V(x0(t)) = -2bx0(t)4 dt
=
-2bV(x0(t)f
and hence V(x0(t))
V(x0(0)) l + 2bV(x0(0))t
0
as t —>• oo,
2.1.2.
Subcritical
Transitions of Attractors
49
bifurcation
We now consider a subcritical bifurcation arising in the scalar autonomous differential equation dx = -x (x4 -2x2 ~dt
+
l-v),
(2)
for which there are three parameter regimes for equilibrium solutions xv: (i) xv = 0 for v < 0 (ii) xv = 0, ±y/l + y/u, ±yjl-^v for 0 < v < 1, and (hi) ~x„ = 0, ±\/l + \/u for v > 1.
where xo (t) is any solution of the differential equation (1) for v = 0. (This Lyapunov function can also be used for v < 0.) For v > 0, there are three equilibrium points 0 and ±y/v/bQ, and the global attractor is now
The zero solution here loses linear stability at v = 1 in a subcritical bifurcation to the nonlocal solutions ±'^/l + \/u. Note, however, that these equilibria as well as ±^/l — ^fv first appear at v = 0. The equilibria ± \ / l + *Jv are asymptotically Av •s/vjb^yjvlbts stable for v > 0, whereas the equilibria ± \ A — v ^ are unstable in their existence interval 0 < f < 1. Here H*(AV, A0) = tf * (A,, {0}) = ^7Jb~o • - 0 The global attractors here are Av = {0} for as v —-> 0, i.e. the set-valued mapping v ^> Av \s, v < 0 and continuous (in the Hausdorff metric) at the bifurcation point v = 0. Av = 1 + V^, V ! + ^ This classical example of a supercritical pitchfork bifurcation in an autonomous system is our first example of what we have called above a "continuous for z/ > 0. In particular, the set-valued mapping transition" of the global attractor. f — i > ^ is not continuous at v = 0 (being only
o
Fig. 1.
Supercritical pitchfork bifurcation.
Fig. 2.
c> -
Subcritical bifurcation.
50
P. E. Kloeden & S. Siegmund
upper semicontinuous there), but is continuous at v = 1. The attractor thus undergoes a discontinuous transition at v = 0 and a continuous transition at v = 1 (and, in fact, at any v ^ 0). An inspection of the direction fields shows that the attractors are clearly not equiattracting for parameter values in a neighborhood of u = 0, since the attraction is not uniform there.
two-dimensional their global attractors can be easily determined by elementary algebra and direction field arguments.
2.2.1.
Supercritical
The driving system of the triangular system
~ = -x + p, 2.1.3.
Some nonapplicable
dx o —- = ux — x dt has (nonglobal) local attractors Av = {0} for v < 0 and Av = {u} for v > 0, but AQ = {0} is not attracting from any neighborhood, being attracting on one side and repelling on the other. A similar situation occurs in a small neighborhood of the nonlocal subcritically bifurcating equilibria ± 1 in system (2) at u = 0, these equilibria also being attracting on one side and repelling on the other. Unlike in the transcritical bifurcation above, the equilibria here exist only on one side of the critical parameter value v = 0.
Triangular
autonomous
systems
We consider some autonomous differential equations in R2 with the triangular form
~ = f(x,P),
ft=9(P),
^ = vP-p3,
(x,p)eR2
(3)
situations
We mention for completeness that a transcritical bifurcation does not fit into our total stability scenario since there is no nonlinear attractor at the bifurcation point, e.g. the autonomous equation
2.2.
bifurcation
(x,P)eR2.
Such triangular systems are examples of skew product flows with the uncoupled component for p being considered as "driving" the coupled or "driven" system for x. In the following three examples we consider bifurcations of the triangular system due to bifurcations in either the "driving" equation (for p) or the "driven" equation (for x), the first two involving a supercritical and subcritical bifurcation, respectively, of the driving system and the third a saddlenode bifurcation in the driven system. The systems are all Morse-Smale systems with global attractors consisting of a finite number of equilibria and their heteroclinic trajectories. Since the systems are
is, in fact, the scalar autonomous differential equation (1) with 6 = 1 , thus with equilibria pv = 0 for v < 0 and pv = 0, zty/u for v > 0. The equilibria (xv,pv) of the triangular system (3) satisfy %v =Vvi where the pv are equilibria of the driving system. Thus there are two cases (i) (xv,pv) (ii) (xv,pv)
= (0,0) for v < 0, and = (0,0), ( ± v ^ , ± v ^ ) for v > 0.
The global attractor of the coupled system is thus ^ = {(0,0)} for z / < 0 a n d A„ = { ( 0 , 0 ) , ( ± v ^ , ± v ^ ) } U {heteroclinic trajectories} for v > 0. A heteroclinic trajectory lies below the x = p line in the (p, x) plane if p' = up — p 3 is positive there, and above if it is negative, see Fig. 3. The set-valued mapping u —>• Au is thus continuous for all v, including the supercritical bifurcation point v = 0 of the driving system, where the single equilibria (0,0) in AQ (actually, ^o = {(0,0)} here) undergoes a supercritical bifurcation to yield the new equilibria ( i y ^ ^V^) in Av for v > 0.
2.2.2.
Subcritical
bifurcation
The situation is analogous for the triangular system dx -£ = -x+P,
dp -d-t=-p{p
,
(x,p)eR2,
A
„ ~2P
2
+ 1
\ ~ ^ ' (4)
where the driving system is now the subcritically bifurcating scalar differential equation (2). The triangular system (4) has equilibria (xu,pv) with xu = pu, where the pv are equilibria of the driving
Bifurcations and Continuous
Transitions of Attractor\s
51
v>0
Fig. 3.
The attractor for v < 0 and v > 0: Supercritical case.
I/>1
Fig. 4.
The attractor for different values of v. Subcritical case.
system, i.e. with the three cases (i) pv = 0 for v < 0, (ii) % = 0, ±yjl - y/V, ±^1 + V" for 0 < v < 1, and (iii) % = 0, ± y i + V ^ for v > 1. The global attractor of the coupled system is thus i4„ = {(0,0)} for v <0 with
2p2 + 1 — v) is positive there, and above if it is negative, see Fig. 4. The transition in Av is thus continuous for all v ^ 0 and discontinuous only for i/ = 0.
2.2.3.
Saddle-node
bifurcation
The autonomous differential equation in R 2 , da; x (1
4, = {(o,o), (±vT±V^±Vi±v^
X
y2)+y(l
+ v + x),
U {heteroclinic trajectories} for 0 < z/ < 1, and
Av = {(0,0), (±v/l + v^,±Vl + v^ U {heteroclinic trajectories} for i> > 1. A heteroclinic trajectory lies below the x = p line in the (p, x) plane if 7/ = —p(p4: —
is obviously not of triangular form. However, if we change from cartesian to polar coordinates, then we obtain an equivalent system in triangular form, d6 dt
-(1 + v + rcostf), (0,r)e[O,2vr]x
dr —=r dt
, — r, (5)
52
P. E. Kloeden & S. Siegmund
v
v=0 Fig. 5.
Fig. 6.
v>Q
Bifurcation diagram, cartesian coordinates.
Bifurcation diagram, polar coordinates.
for which the dynamical behavior is more transparent [Arrowsmith k, Place, 1990; Glendinning, 1994; Reitmann, 1996]. The global attractor Av here is the unit disk {{x,y) € R 2 : r2 = x2 +y2 < 1} for all u, i.e. it does not change at all as v changes (so it obviously depends continuously on v). However, the dynamics within and near Av do change significantly as v passes through zero. The origin is an equilibrium point and the unit circle is invariant for all values of v. For negative values of u, there are two equilibrium points on the unit circle, one a saddle point and the other a stable node, which coalesce at v = 0 to form a single saddle-node. For positive v this saddle node disappears. This is easily visualized in Cartesian coordinates (see Fig. 5), but it is interesting to also use polar coordinates (see Fig. 6). This example also differs from the previous two on triangular systems in that the bifurcation occurs in the coupled "state" space equation
(0 here) rather than in the "driving" system equation (r here).
3. Nonautonomous Systems We consider two abstract formalisms of nonautonomous dynamical systems through simple examples: the process formalism, which at first sight seems more natural, and the skew product formalism in which a state space system is driven by an inputed autonomous system. Various definitions of nonautonomous attactors will then be introduced and illustrated with examples.
3.1.
Process formalism of a nonautonomous system
Solution mappings are one of the main motivations for the process definition [Dafermos, 1971] (see also
Bifurcations and Continuous Transitions of Attractors
[Hale, 1988]) of an abstract nonautonomous dynamical system on a state space X. A process is a continuous mapping (t,to,xo) — i »• x(t,to,Xo) G X for £ > *o> to G R and XQ G X, with the initial value and evolution properties (i) x(t0,to,x0) = XQ for all to G R and xo G X, (ii) a;(t2,to,a;o) = x(t2,ti,x(ti,t0,x0)) for all t 0 < *i < t2 in R and XQ G X.
53
See Fig. 7 for the case where t h e family {A(t),t G R} corresponds to a single trajectory 7p(t), i.e. A(t) = {p(t)} for all t G R. For an extensive, but elementary introduction t o forward and pullback attractors see [Caraballo et al, 2003; Griine & Kloeden, 2001]. We now consider a nonautonomous analogue of the pitchfork bifurcation of the differential equation (1), namely
It is often also called a two-parameter semigroup on X in contrast with the one-parameter semigroup of an autonomous dynamical system. A nonautonomous attractor A now consists of a family of nonempty compact sets {A(t),t G R} which is invariant in the sense that
dx dt = ux
b(t)x3,
(7)
with continuous b : R —> R, b(t) G [&o>&i] f° r a u t G R where 0 < b0 < h < oo. See [Kloeden, 2004] for the bifurcatory analysis of a multidimensional version of this equation. x(t,t0,A(t0)) = A(t) for all t > t0,t0 G R Assuming b(t) is nonconstant, the nonautonomous differential equation has only one equi(from which it follows that the set-valued mapping librium point 0 and this exists for all values of v. 11—> A(t) is continuous in t G R). There are now two Supposing that v < 0, we see for the Lyapunov ways to define attraction of A, which are equivafunction V(x) = x2 that lent in the autonomous case. The first, and perhaps more obvious, corresponds to Lyapunov asymptotic ^V(x„(t)) = 2vxv{tf 2b{t)xu{tf stability, i.e. with forward attraction in the sense of lim H^(x(t,t0,x0),A(t))
= 0.
t—>oo
<
Note that the target set A(t) is changing in time. The other attraction, called pullback attraction involves a fixed target set with progressively earlier starting time, i.e. to
lim HZ(x(t,to,xo),A(t))
= 0.
x(-,t0,x0)
r~~ t0 i /
< 2uV{xv{t)) -
(6)
^^
-2boV(Xl/{t)f,
so V(xu(t))
<
V{xv{to)) l + 26o^(M*o))(*-to) as t
oo,
^^
_-——-^$^ -
^
^
^
^
i
(a)
(b) Fig. 7.
2b0V(xu(t))2
(a) Forward and (b) pullback attraction.
;
54
P. E. Kloeden &: S. Siegmund
where xv(t) is any solution of the differential equation (7) for v < 0. Moreover, the equilibrium point 0 loses stability in the linearized equation at v — 0 and is unstable for v > 0. Unlike the autonomous case above, no new equilibrium points come into existence when v > 0. Instead we will show that there is a family of timedependent sets
Mt) = [-v„{t),ipv(t)],
te
(8)
which are uniformly Lyapunov asymptotically stable (see Eq. (12) below). Here ±7pu are solutions of the nonautonomous differential equation (7) given by
The proofs of the above assertions are instructive. We first note that Eq. (7) is a Bernoulli equation, so can be converted into a linear differential equation dv + 2vv = 2b(t) ~d~i with the substitution v = x~2 (recall that x — 0 is an equilibrium of the Bernoulli equation (7)), which we integrate to obtain xu(t,t0,x0)2
-2i/(t-t0)
= x, ~^e
+ 2 [ b(s)e-2^~s) ds. (10) J to
(9)
Vv{t)
\f b(t
-Mts)
ds
J —oo
and satisfies ipv (t) € \fv/b\, vW^O for all t € which means, in particular that HR(A„(t),A0)
= HR(Av(t),
{0})
We hold t and XQ fixed in (10) and take the pullback limit as to —> —oo, to obtain the pullback limit solution Tpv(t)=
1 2
Fig. 8.
xv(t,tQ,xQ)
given by (9). This is itself a solution of the differential equation (7) and thus satisfies (10) with XQ = Tpv{to), specifically
< vW^o "~* 0 as ^ —> 0, for each f 6 R, see Fig. 8. (Note that Tpv is almost periodic when the coefficient b is almost periodic [Fink, 1974; Sell, 1971].) Thus we have another example of a continuous transition of the attractor, this time nonautonomous.
lim to—>~oo
vAt)
2
-2i/(t-i0)
vM
2 f b{s)e'2^t-sUs.
(11)
J to To show that fv(t) is asymptotically stable for all Xo > 0 (cf. [Langa et al., 2002; Langa et al., 2004;
Nonautonomous pitchfork bifurcation.
Bifurcations and Continuous Transitions of Attractors
55
autonomous dynamical system, examples of which will be given in Sec. 3.3 and later. We will reinterpret the bifurcations in these examples as nonautonomous bifurcations, using the pullback convergence method to construct explicitly the heteroclinic trajectories inside the previas t —* oo, ously determined global attractors. In particular, we consider the supercritical uniformly bifurcation in the system fact that dx dp q , , for every m0
Langa & Suarez, 2002]), we subtract (10) from (11) to obtain 1 1
xu(t,to,x0y i
-2v(t-t0)
0
from which the result follows. It is in fact asymptotically stable because using the Tpv (t) G y/v/bi, y/is/bo , we can find e > 0 and XQ > 0 a T(XQ, e) > 0 such that
As seen earlier, the global attractor of the coupled system (15) is Av = {(0, 0)} for v < 0 and
,-2u(t-to) m (+^2
<
-2i/(t-t0) V
Av =
(12)
< £
{(0,0),(±y/i;,±y/P)} U {heteroclinic trajectories}
for t > T(xo,e) + tQ. The corresponding result holds for the solution —^pv{t) for all XQ < 0. We note here that the nonzero solutions xu(t,to,xo) of the differential equation (7) converge to sga(xo)lpl,(t) in both the usual forward sense (i.e. t —»• oo with to fixed) as well as in the pullback sense (i.e. to -* — oo with t fixed). In general, forward and pullback convergence are independent concepts and neither one implies the other [Cheban et al, 2002; Wang et al., 2004], although in autonomous systems or in uniform systems, as in this example, they are equivalent. Pullback convergence is useful in constructing limiting objects, since the limit is fixed and not changing in time as in forward convergence.
for v > 0. We know that the global attractor of the uncoupled equation for p when v > 0 is Pv = [—-s/v, y/u\ and, moreover, that the solution pv(t,po) exists for all t G M when po G Pu, since Pv is a compact invariant set for the p-dynamics. For such a solution, the nonautonomous differential equation (14) for the first component, dx ~dl
with initial value a;(to) = XQ has the solution xv(t,tQ,xQ,pQ)
3.2.
= x 0 e" ( t ~ t o ) s + e" / e pv(s,p0)ds.
Triangular systems as nonautonomous systems
= f(x,p),
f
=g(P),
(16)
J to
Here we will reconsider our examples in Sec. 2.2 of bifurcations in autonomous differential equations of the triangular form
^
-x+pu(t,p0),
2
(x,p)€M , (13)
Holding t fixed and taking the limit as to —> — oo, we obtain the pullback limit lim xu(t,t0,x0,po)
= :=e
which we now interpret as nonautonomous differential equations dx = fpo(x,t) := f{x,p(t,p0)), x G R \ (14) dt where the solution p(t,po) with initial value p(0,po) = po of the second uncoupled component of the triangular system (13) is considered as an external driving force. In general, p(t,po) need not be the solution of an autonomous differential equation, but just a function or a trajectory of an
yv{t,pQ)
to—•—oo
t
/
espl/(s,p0)ds.
J—oo
(17) Obviously, we have —\fv < xu(t,po) < \fv for all t & M. with, in particular, Tpv{t,pv) = pv, when Po = Pv i s o n e °f the equilibria 0, ± v ^ of the ^-equation. In fact, (jfv{t,po),pv{t,po)) G Av for all t e l and the heteroclinic trajectories in the global attractor Av are the curves Po
$i/(Po),
PoePv
= [-y/v, Vu],
56
P. E. Kloeden & S. Siegmund
where <Ev(po) := ^ ( O J P O ) - I n this case we can solve the Bernoulli equation for p explicitly (cf. (10)) to obtain e^+1> ds
**(po) = / J -c
°°
= > Po < v-
e2vs + ( -^ - 1
The analysis is similar in the other two examples, so we will not present the details (which are somewhat more complicated) here. 3.3.
Skew product flow of nonautonomous
formalism systems
Following [Kloeden et al., 1999] (see also [Berger & Siegmund, 2003; Cheban et al., 2002; Griine k Kloeden, 2001; Kloeden & Kozyakin, 2001; Kloeden & Stonier, 1998; Langa et al, 2002; Li & Kloeden, 2004b; Wang et al, 2004; Wiggins, 2003]) we define a nonautonomous dynamical system (9,
Triangular autonomous systems (13) are special cases of skew product flows. In general, the driving system is not generated by an autonomous differential equation, so the autonomous global attractor of the skew product flow may not always be physically meaningful or, at least, not as physically meaningful as the dynamics in the state space variable x. For example, consider the nonautonomous Bernoulli differential equation dx ~dt — vx
b(t)x3
(18)
with b : R —> R is an almost periodic function [Fink, 1974; Sell, 1971], which, in general, will not be the solution of an autonomous differential equation. However, we can use a construction of Bebutov [1940] to formulate changes in b as an autonomous dynamical system, namely for the shift operators 8tb(-) := b{t + •) for all t £ R which determine an autonomous dynamical system on the space P:=cl{&(* + •) : t e R } ,
where the closure is with respect to the norm ll/lloo := su PteR l/(*)l- Since b is almost periodic, P C C(M,R) is a compact metric space with the metric corresponding to this norm (however, if b is only bounded we need the weak* topology for P to be a compact metric space). The x variable may be a physical quantity such as a chemical concentra1. 90(p) = p for all p e P ; tion or population density, but it is not clear how we 2. 8a+t = 0s(6t(p))foTaRs,t€R; should interpret a point (p, x) in the global attrac3. the mapping (t,p) i-> 9t(p) is continuous, tor Av C P x R of the corresponding skew product flow.1 and the cocycle mapping if : x P x X X We note that the quasi-periodically forced linsatisfies ear systems of [Grebogi et al., 1984] (see also 1. (p(0,p,x) = x for all (p,x) € P x X; [Glendinning, 2004]) with their intriguing non2. ip(s + t,p,x) = ip(s,9t{p),
Bifurcations and Continuous {p}xX
{OsP} x X
Transitions of Attractors
57
R+tP} x X
tp(s + t,p,x) =
= vtvsP Fig. 9.
The cocycle property.
subset of P, and Ap are nonempty compact subsets of X for each p E P*, which are ^-invariant in the sense that
for allt > 0, p E P*
(19)
and pullback attracting in the sense that lim Hx&
(t, 9-t{p), B),AP) = 0
(20)
t—>oo
for every nonempty bounded subset B of X and every p E P*. However, the Ap sets here need not be forward attracting, i.e. in the sense that \imHx(cp(t,p,B),Adt{p))
=0
(21)
The relationship between pullback and forward attractors and the subset A of P x X defined by U P eP UP} x AO w ^ h component sets from such pullback or forward attractors and a possible global attractor of the associated autonomous skew product flow -K is discussed in [Cheban et al., 2002; Wang et al, 2004]. As a simple example, we note that the family of singleton sets Ap = {$u(p)} for p E Pv = \—\fv, \fv\ where $v(p) in the previous subsection is a pullback attractor on X = M for p E Pv. In this case, the family is also a forward attractor and the subset {jp&Pv({p} x Ap) of Pv x R is the global attractor for the associated skew product flow, i.e. the triangular system (15). The above skew product formalism is particularly advantageous when the base space P of the driving system is compact, as for example, in almost periodically forced differential equations. However, P need not be compact. In fact, with P = R and 9t(to) := t + to for all t and i 0 €E M, the above formalism reduces to the process formalism of a nonautonomous dynamical system with x(t + to,to,xo) := ip(t,to,x0) for all t > 0, to EM and XQ E X. We have already seen counterparts of above definitions of pullback or forward attractors for such processes in Sec. 3.1 above. We observe that an attractor does not exist for the skew product flow in this context.
for every nonempty bounded subset B of X and every p E P*. This suggests several possible definitions of a nonautonomous attractor of an NDS (9, *], (22) back and forward convergence implies the other.
58
P. E. Kloeden & S. Siegmund
where the vector fields fv : R x Rd —» Rd satisfy the inequality (see Lemma 3 in the Appendix) following standard assumptions: The functions fv V(t,xv(t,to,xQ)) < e-(*- i0 ) V(t0,x0) + KLu(v), are continuous in (t, x) G M. x R d , globally Lipschitz in x G M.d uniformly in t G R with Lipschitz con0 < t - t 0 < 1, (26) stant Lj,, and satisfy the parametric dependence d for all to G R and XQ G R , where V is a condition2: Lyapunov function with Lipschitz constant L (and There exists w(v) for v G [—v* ,v*\ with u(v) —> 0 K is another positive constant), which characteras v —> 0 swc/i t/iai izes the uniform asymptotical stability of the set AQ for the differential equation (22) with v = 0. sup | / v ( t , x ) - / o ( t , x ) | < o ; ( i / ) (23) The existence of V is ensured by Theorem 2 in the d teM.,x<=m. Appendix. We use the Lyapunov inequality (26) to establish the existence of a family of nonempty comfor v G [—v*,v*\. pact subsets {A*(to), to G R} of R d , provided v is We will denote the solution of (22) with initial sufficiently small, which is positively invariant, i.e. value a;(to) = ^o by xv(t,ta,xo). We will also assume x I / (t,t 0 ,A*(to))CA^(t), Vt>t0, that for v = 0 the system (22) has a uniformly asymptotically stable compact connected set A0 and absorbing uniformly in to G R, i.e. for every (which may be an attractor, but need not be). Our compact subset D of R there exists TD,U > 0 such next theorem on total stability is a consequence of that the uniform asymptotic stability of Ao, the uniformity being essential here. xl/(t,t0,D)CA*l/(t), t>t0 + TDiV, V t 0 G R . Theorem 1. Consider Eq. (22) satisfying the standard assumptions and suppose that there is a nonempty compact set Ao which is uniformly asymptotically stable (possibly only locally) for (22) with v = 0. Then there is a v** G (0, i/*] such that for each v with 0 < \v\ < u** there exists a family Av = {Au(to),tQ G R} of nonempty compact connected subsets of R d , which are invariant with respect to (22), i.e. xv(t, t 0 , Av(to)) = Av(t),
t > t0,
and converge upper semicontinuously formly in t G R, i.e.
(24) to AQ uni-
The component sets of the pullback attractor are then determined by A,(*o) = f l xv(t0,t0
- r, A* (t0 - r ) )
T>0
for each to G R. These are pullback attracting in the sense that dist (xv(to,to - T,XO), A,(t 0 )) —> 0 V t 0 G R, x 0 G R d ,
asv^Q.
(27)
but they need not be forward attracting in the sense that dist (xu(t,to,xo),
Av(t)) ^ 0
as t —>• oo, d
V t 0 G R, x0 G R . supH^d(Au(t),A0)-^0 teR
as r —> oo,
(28)
(25)
Note that the pullback attractor Av consists of a single set Av if the differential equation (22) The family Av is a pullback attractor for the for this value of v is autonomous. In this case nonautonomous process or two-parameter semixv(t, to,xo) = xu(t — to,0, xo), so pullback and forgroup {ajj,(£,to> •)} defined by the solutions of the ward convergences are equivalent. For a detailed differential equation (22). Note that the set-valued discussion of the relationship between pullback and mapping t >—>• Av(t) is continuous due to the invari-forward convergences see [Cheban et al, 2002; ance property (24) and the continuity of the process. Wang et al., 2004]. The proof of Theorem 1 is given in the The upper semicontinuous convergence (25) folAppendix. It is based on the following Lyapunov lows from the fact that A, (to) C A* (to) and the Unlike the uniformity in x here (see Remark 1), the uniformity in t £ R is a strong restriction but is essential for total stability. However it does hold for almost periodic functions.
Bifurcations and Continuous Transitions of Attractors
construction of the A*(£o) sets, which leads to H£d(Av(t0),Ao)
< H^d(At(to),Ao)
- • 0 as u -+ 0
for all to € M. In general, it cannot be strengthened to continuous convergence (i.e. with H*d replaced by the Hausdorff metric HRd). A simple counterexample is given by the example of a subcritical bifurcation in the autonomous differential equation (2) at v = 0 (i.e. where the nonlocal equilibria first arise). As mentioned above, equiattraction ensures continuous convergence of attractors in the autonomous case. An analogous result also holds in the nonautonomous case [Li Sz Kloeden, 2004b]. Under suitable assumptions (see [Wang et al., 2004]) it can be shown that the set-valued mapping t i—• Av{t) is periodic, respectively almost periodic, when the functions fu(t, x) are so. In particular, this holds for the Bernoulli equation (7) when the function b is periodic, respectively almost periodic, for which Av{t) are given by (8). Remark 2. It is possible to generalize the above theorem to assume that the system has a uniformly Lyapunov asymptotically stable (in the forward sense) family of nonempty compact invariant sets {A(t) : t e M} instead of the attracting set AQ (see [Yoshizawa, 1966]) or to assume that the right-hand side of the differential equation (22) is of the form f(x,p) with a uniform pullback attractor {Ap : p £ P} with P compact [Kloeden & Kozyakin, 2001]. Remark 3. The following example due to Li Desheng (private communication) shows that the perturbed attracting set need not be globally attracting even when the unperturbed system is globally attracting. The autonomous scalar ordinary differential equation x'(t) = —xe~x '2 + v has a global attractor AQ = {0} when v = 0. For 0 < v2 < e _ 1 , there are two equilibria with the one closer to zero being locally asymptotically stable and thus forming
59
a singleton set local attractor. The other equilibrium is unstable and coalesces with the first as v2 approaches e~l from below, then both equilibria disappear for v2 > e _ 1 . This example also shows that the parameter interval in which the perturbed attractor exists can be very small, e.g. when we apply the total stability theorem to the above differential equation with a v value such that e~2 — v > 0 is very small. 5.
A p p l i c a t i o n s of t h e Total S t a b i l i t y Theorem
As a first comment, if to emphasize the obvious, we mention that uniform asymptotic stability is concerned solely with what happens outside of the set A$ and says nothing about what may happen inside of AQ. Indeed the Lyapunov function vanishes on AQ. Nevertheless the internal dynamics of AQ may have a significant effect as the above example of a saddle-node bifurcation shows. The importance of the total stability theorem is that it ensures the existence of nearby attracting objects in perturbed systems. The theorem of [Li
t/(*)
HRd(Au(to),{0})
= H^d(Au(to),{0})
- 0
as v —> 0
Fig. 10.
Graph of f(x) =
-xe~x'*/2'.
for all to € R. In this case we have a continuous bifurcation at v = 0. The supercritical bifurcations of the autonomous differential equation (1) and the
60
P. E. Kloeden & S. Siegmund
nonautonomous differential equation (7) are examples of this result. We note that a similar analysis is possible if the equilibrium solution 0 here is replaced by a periodic or almost periodic solution. Two features are required here for a supercritical bifurcation: (i) the bifurcating solution is uniformly asymptotically stable for the nonlinear system at the parameter value where it loses linear stability, and (ii) the bifurcating solution (or at least a continuation of it) exists and is unstable after the bifurcation point. The first of these ensures the existence of an attractor after the bifurcation point and the second that these attractors contain something more than just the continuation of the bifurcating solution and thus the occurence of not just a bifurcation, but a supercritical bifurcation. Usually the supercriticality of a bifurcation is determined by the sign of a coefficient in an expansion of the new solution in what is essentially a normal form expression [Glendinning, 1994]. As can be seen from the examples in [Glendinning, 1994; Marsden & McCracken, 1976], such expressions are difficult enough to determine for specific examples of codimension-one bifurcations and thus cannot be expected to be any easier for higher codimensions. The nonlinear asymptotic stability of the bifurcating solution at the point of loss of linear stability provides an alternative test for supercriticality in these cases. As a final point, we note that we are not restricted here to applying the total stability theorem to a global or maximal attractor, but could equally well apply it locally to the bifurcation of an equilibrium solution, say, inside such an attractor. This would verify the continued existence of the solution or a continuation of it of some form after a bifurcation and the existence of other nearby minimal solutions if the continued solution is unstable after the bifurcation point.
6. Concluding Remarks and Questions We have restricted our attention here to well-known basic bifurcations, partly because these already illustrate our ideas clearly in the autonomous case and partly because investigations of bifurcations in the general nonautonomous case have not progressed much beyond these elementary
bifurcations. More complicated types of bifurcations, e.g. homoclinic bifurcations, certainly might occur inside autonomous attractors and their nonautonomous counterparts. On the other hand, it is known that a bifurcation at infinity may completely destroy a pullback attractor [Kloeden h Kozyakin, 2001]. Less dramatically, as we have seen in the autonomous differential equation x'(t) = —xe~x I2 -\-v above (see Remark 3), the bifurcation at infinity for v = 0 destroys the global attractivity of the perturbed attractor but not the attractor itself. In all of our examples the bifurcation parameter appears in an autonomous linear part of the differential equation. Johnson et al. [2002] considered the analog of Hopf bifurcations for equations where the bifurcation parameter has a time-dependent coefficient, as e.g. in the Duffing-van der Pol equation with almost periodic coefficient b(t)
dt \y)
" \-a
+ ab(t) (3) \y J \x2y + x3)'
The bifurcation then appears to occur in two stages, perhaps because the corresponding SackerSell spectrum consists typically of intervals rather than single points, with the bifurcation being only complete when the whole spectral interval has crossed over into the positive part of the real line (see [Siegmund, 2002a] for spectral theory and [Siegmund, 2001, 2002b] for a nonautonomous normal form of (29)). Should one consider such bifurcations as the authentic nonautonomous bifurcations and the ones that we have focussed on in this article only as special cases? In any case, the above discussion on total stability and supercriticality remains valid here too. Our autonomous triangular systems were all Morse-Smale systems. They provided us with examples of nonautonomous systems with particularly robust attractors for the case that the driving systems were generated by differential equations. However, we also considered examples of nonautonomous systems for which the driving system was not generated by a differential equation, but by, say, the shift operator on the hull of an almost periodic function. What then is the counterpart of a MorseSmale system in such situations? In our examples, a discontinuous transition of an attractor was always associated with a
Bifurcations and Continuous Transitions of Attractors
61
2
1
X
. X\j
-2
-1
1
2
-1 y = -x3 + x + 2\/3/9
y = -x3 + x + 4\/3/9 - i>, i/ < i/0
Fig. 11. Two equilibria at VQ and one equilibrium for v < VQ.
subcritical bifurcation within t h e attractor. Is this the only cause of a discontinuous transition? Do such discontinuous transitions only occur at isolated parameter values? In fact, a subcritical bifurcation is not necessary b u t rather t h e sudden vanishing or rising of nonlocal equilibria (or other minimal invariant sets), i.e. which exist only on one side of a critical parameter value. This can be seen in Example 3.2 in [Li & Kloeden, 2004a] for t h e scalar equation x = -x3 + x + 4 \ / 3 / 9 - v with v E [0, UQ] where v : = 2-\/3/9. For v = VQ t h e equation has two distinct equilibria x~Q and X+ and for v < vo one equilibrium xv (see Fig. 11). Note t h a t t h e equilibrium near 1 is asymptotically stable for all v. In particular, there is no subcritical bifurcation.
References Arnold, L. [1998] Random Dynamical Systems (Springer-Verlag, Heidelberg). Arrowsmith, D. K. & Place, C. M. [1990] An Introduction to Dynamical Systems (Cambridge University Press, Cambridge). Ashwin, P. & Ochs, G. [2003] "Convergence to local random attractors," Dyn. Syst. 18, 139-158. Bebutov, M. V. [1940] "Sur les systemes dynamiques dans l'espace des fonctions continues," Doklady Akad Nauk SSSR 27, 904-906. Berger, A. & Siegmund, S. [2003] "On the gap between random dynamical systems and continuous skew products," J. Dyn. Diff. Eqs. 15, 237-279.
Caraballo, T., Kloeden, P. E. & Langa, J. [2003] "Atractores globales para sistemas diferenciales no autonomos," Cubo Matemdtica Educacional 5, 305-329. Cheban, D., Kloeden, P. E. & Schmalfufi, B. [2002] "The relationship between pullback, forward and global attractors of nonautonomous dynamical systems," Nonlin. Dyn. Syst. Th. 2, 9-28. Dafermos, C. M. [1971] "An invariance principle for compact processes," J. Diff. Eqs. 9, 239-252. Fink, A. M. [1974] Almost Periodic Differential Equations, Springer Lecture Notes in Mathematics, Vol. 377 (Springer-Verlag, Heidelberg). Glendinning, P. [1994] Stability, Instability and Chaos (Cambridge University Press, Cambridge). Glendinning, P. [2004] "The non-smooth pitchfork bifurcation," Discr. Contin. Dyn. Syst. Ser. B 4 , 457-464. Grebogi, C , Ott, E., Pelikan, S. & Yorke, J. A. [1984] "Strange attractors that are not chaotic," Physica D13, 261-268. Grime, L. & Kloeden, P. E. [2001] "Discretization, inflation and perturbation of attractors," in Ergodic Theory: Analysis and Efficient Simulation of Dynamical Systems, ed. Fiedler, B. (Springer-Verlag), pp. 399-416. Hale, J. [1988] Asymptotic Behavior of Dissipative Dynamical Systems (Amer. Math. Soc, Providence). Johnson, R. A., Kloeden, P. E. & Pavani, R. [2002] "Two-step transition in nonautonomous bifurcations: An explanation," Stoch. Dyn. 2, 67-92. Kloeden, P. E. & Lorenz, J. [1986] "Stable attracting sets in dynamical systems and in their onestep discretizations," SIAM J. Numer. Anal. 23, 986-995. Kloeden, P. E. & Stonier, D. J. [1998] "Cocycle attractors in nonautonomously perturbed differential equations," Dyn. Contin. Discr. Impuls. Syst. 4, 211-226.
62 P. E. Kloeden & S. Siegmund Kloeden, P. E., Keller, H. & Schmalfufi, B. [1999] "Towards a theory of random numerical dynamics," in Stochastic Dynamics, eds. Crauel, H. & Gundlach, V. M. (Springer-Verlag, Heidelberg), pp. 259-282. Kloeden, P. E. & Kozyakin, V. S. [2000] "The inflation of attractors and discretization: The autonomous case," Nonlin. Anal. TMA 40, 333-343. Kloeden, P. E. fe.Kozyakin, V. S. [2001] "The perturbation of attractors of skew-product flows with a shadowing driving system," Discr. Contin. Dyn. Syst. 7, 883-893. Kloeden, P. E. [2004] "Pitchfork and transcritical bifurcations in systems with homogeneous nonlinearities and an almost periodic time coefficient," Commun. Pure Appl. Anal. 3, 161-173. Kloeden, P. E. & Kozyakin, V. S. [2004] "Uniform nonautonomous attractors under discretization," Discr. Contin. Dyn. Syst. 10, 423-433. Koksch, N. fc Siegmund, S. [2002] "Pullback attracting inertial manifolds for nonautonomous dynamical systems," J. Dyn. Diff. Eqs. 14, 889-941. Krasnosel'skii, M. A., Burd, V. Sh. & Kolesov, Yu. S. [1973] Nonlinear Almost Periodic Solutions (John Wiley & Sons, NY). Langa, J. A., Robinson, J. C. & Suarez, A. [2002] "Stability, instability and bifurcation phenomena in nonautonomous differential equations," Nonlinearity 15, 887-903. Langa, J. A. & Suarez, A. [2002] "Bifurcation phenomena for a non autonomous logistic equation," Electron. J. Diff. Eqs. 72, 1-20. Langa, J. A., Robinson, J. C. & Suarez, A. [2004] "Bifurcations in non-autonomous scalar equations," submitted. Li Desheng & Kloeden, P. E. [2004a] "Equi-attraction and the continuous dependence of attractors on parameters," Glasyow Math. J. 46, 131-141. Li Desheng & Kloeden, P. E. [2004b] "Equi-attraction and the continuous dependence of pullback attractors on parameters," Stock. Dyn. 4, 373-384. Marsden, J. & McCracken, M. [1976] The Hopf Bifurcation and its Applications (Springer-Verlag, NY). Reitmann, V. [1996] Regulare und Chaotische Dynamik (B.G. Teubner, Stuttgart). Sell, G. R. [1971] Lectures on Topological Dynamics and Differential Equations (Van Nostrand-Reinbold, London). Siegmund, S. [2001] "Normal form of Duffing-van der Pol oscillator under nonautonomous parametric perturbations," Discr. Contin. Dyn. Syst., 357-361, Kennesaw conference issue available from h t t p : / / AlMSciences. org/ Siegmund, S. [2002a] "Dichotomy spectrum for nonautonomous differential equations," J. Dyn. Diff. Eqs. 14, 243-258.
Siegmund, S. [2002b] "Normal forms for nonautonomous differential equations," J. Diff. Eqs. 178, 541-573. Wang Yejuan, Li Desheng & Kloeden, P. E. [2004] "Uniform attractors of almost periodic nonautonomous dynamical systems," Nonlin. Anal. TMA 59, 35-53. Wiggins, S. [2003] Introduction to Applied Nonlinear Dynamical Systems and Chaos, 2nd edition. (Springer-Verlag, Heidelberg). Yoshizawa, T. [1966] Stability Theory by Lyapunov's Second Method (Mathematical Society of Japan, Tokyo).
A. Appendix: Proof of Theorem 1 The following theorem, based on Theorem 22.5 in [Yoshizawa, 1966], provides t h e existence of a Lyapunov function which characterizes t h e uniform asymptotical stability of a globally uniformly asymptotically stable compact set AQ of a nonautonomous differential equation §>/«,*).
(A.1)
Theorem 2. Suppose that f : R x Rd - • Rd in (A.l) is continuous in (t,x) and globally Lipschitz in x € Rd uniformly in t € R and suppose that (A.l) has a globally uniformly asymptotically stable compact set AQ. Then there exists a Lyapunov function V :Rx Rd -> [0, oo) for which: 1. V is globally Lipschitz in x € Rd uniformly in t £ R, i.e. there exists a constant L > 0 such that \V(t,x)-V(t,y)\
x, y e Rd,
t € M;
(A.2)
2. there exist continuous strictly increasing functions a, f5 : Rd i-> [0, oo) with a ( 0 ) = /3(0) = 0 and 0 < a(r) < (3(r) for all r > 0 such that a(dist(£, A))) < V(t,x) for all
<
P(dist(x,A0)) d
x e R;
3. V decreases exponentially fast along trajectories of (A.l) uniformly in to € R, i.e. we have for
t0 eR,x0e
Rd
V(t,x(t,tQ,xo)) < e-^-^V(to,xo) for all t>t0. (A.3)
Bifurcations and Continuous Transitions of Attractors
In fact, if differential equation (A.l) has a uniformly asymptotically stable equilibrium solution and t h e function / in (A.l) is almost periodic uniformly in i G B[0;R] for each R > 0 (respectively, periodic or autonomous), then, from Theorem 19.8 of [Yoshizawa, 1966], t h e Lyapunov function V can be chosen to be almost periodic in t (respectively, periodic or autonomous). The following Lyapunov inequality, which is similar t o inequalities in [Kloeden &: Kozyakin, 2000; Kloeden & Lorenz, 1986], will b e one of t h e key tools in the proof of Theorem 1. Lemma 3. Under the assumptions of Theorem there is a Lyapunov function V with V(t,x„(t,t0,x0))
1
( t t
<
e' - - ^V(t0,x0)+KLuj(u),
0
(A.4)
for the solution xv(t,to,xo) with initial value ^1/(^0)^0)^0) = #o of the differential equation (22) with parameter v ^ 0 for any to G M and xo £ R rf . Proof. Apply Theorem 2 to (22) for v ^ 0. Using the Lipschitz property (A.2) and t h e exponential decay inequality (A.2) of the Lyapunov function V, we obtain V(t,xu(t,t0,x0)) <
V(t,x0(t,t0,xo)) + \V(t,xv(t,t0,x0))
-
V(t,x0(t,to,x0))\
+ /
<
/
<
/ J to
fv(s,Xv(s)) ds —
XQ
- t0) — xQ{s)\
ds
for t — to > 0. Hence by the Gronwall inequality we obtain \xv{t) - ar0(*)| < eL^-^uj{v){t
- *0)
for any t — to > 0. If we restrict t o 0 < t — to < 1, then we have \xv{t) - xQ(t)\
< eLocu(v) = :
proving t h e lemma.
A.l.
Kw[y),
•
Existence of a positively family of absorbing sets the perturbed dynamics
invariant for
Since 00(f) —> 0 as v —• 0 (see (23)), we can choose v** G (0, u*] such t h a t for each v with 0 < \v\ < v** we have UJ(U) < ((e - l)/Le)2. Then K := In (1/[1 - Ly/u(y)]) < 1 and
1
A
" = L\fuj[y)
and (A.5)
(l +
e
-^)
<e'\^
(the reason for t h e last inequality will become apparent in the proofs of Lemmas 5 a n d 6, cf. Lemma 3.4 of [Kloeden k, Lorenz, 1986]), a n d r\{y)
: = 2K^/UJ(V)
-> 0 +
and
A,->
0+
Then define
f0(s,x0{s))\ds
Lemma 4. A l/ (io) is a nonempty Rd for each f 0 £ » with H^d(Au(t0),A0)
\fv(s,x„(s))
-
: V(t0,x)
< 77(1/)}
for each to G R.
fo(s,x0(s))ds
J to
J to
< u(v)(t
A„(i 0 ) := { i e K d
1/^(5,^(5)) -
<
ds.
as v —* 0.
J to
-
— XQ{S)\
+ Lo\ \xv(s) Jto
-x0(t)\ /
\xv{s)
Jto
\xv{t) - x0(i)\
2
XQ +
fo(s,x0(s))\ds
T h u s we have
x0(t,t0,x0)\.
To estimate \xv(t,to,xo) — xo(t,to,xo)\ = : \xv(t) — XQ(£)\ for 0 < t — to < 1, we use t h e integral equation representation of the differential equation (22), the Lipschitz constant LQ of (22) for v = 0 and t h e parametric dependence condition (23) to get \xu(t)
UJ(U) ds + LQ I
J to
1 - e -
-
J to
<e-^-^V(to,xQ) + L\xu(t,tQ,x0)
\fo(s,xu(s))
63
fo(s,xv(s))\ds
< a~l(r,(v))
compact subset of ^ 0
as u -> 0. (A.6)
64
P. E. Kloeden & S. Siegmund
Proof. Since V(to,x) = 0 for x e AQ, so AQ C A„(io)) hence A„(to) is nonempty. It is compact by the continuity of x i—• V(to,x) and the fact that A„(t 0 ) = ^(to,-) _ 1 ([0^(^)]). The inequality (A.6) follows from the inequalities a(dist(x,A0))
< V(t0,x)
(A.4) and the definition of r\{v) we have V(h,Xl)
< e~A" V(t0,XQ) + = e~A^V(t0,XQ)
< r](u) for allx G A„(t 0 ).
KLw(v)
+
^(l-e~^)v^)
< ^ ( 1 + e " A " ) V-(to,x0) <e-iA"F(t0,a;o)
The family of sets {Aj,(to),to G R} is positively invariant with respect to the discrete time process %v{to + nAu, to, XQ), in the sense that Lemma 5. xv (to + TIAJ,, t 0 , A„(io)) C /or a// n > 0, t 0 € R.
V(tn,xn)<e-^A^V(t0,x0)
Av{tQ+nAu)
Proof. It suffices to consider the case n = 1. Take any XQ G A„(to). Then V(to,a;o) < ??(^)- By the key Lyapunov inequality (A.4), the definition of r)(v) and (A.5) we have V(t0 + Au, xu(to + A„, t 0 , XQ)) <e-^V{t0,x0)
since F(toi^o) > ^(f7)- Repeating this argument, we have
as long as Xj £ Av(to + jAv) Now V(t0,x0)
< P(dist(xQ,A0))
< oo
e - ?
A
' ^ ( A 4 ) )
as long as £_,• ^ A„(to + j A„) for j = 0 , . . . , n — 1. Define Nr)tl, to be the smallest integer n for which e-^
A
^(tf*d(AA)))
A
= \ (i + ^ " ) ?(")
<^)<e-f
< ^ ) , so a;„(to + Av, t 0 , x0) € A„(i 0 + A„).
< (3(H^d{D,A0))
for all XQ G D, so V(tn,xn) <
+ KLLu(v)
for j = 0 , . . . , n — 1.
•
The family of sets {A„(to),to 6 R} is in fact absorbing for the discrete time process xu(to + nAj,,to,£o) uniformly in to G R, provided u (and hence A„) is sufficiently small. Lemma 6. For each v such that 0 < \u\ < u** and each compact subset D of R d there exists an integer ND,V > 0, for which xv(to + nAu, t 0 , XQ) G Ay(t0 + nAv)
A
^(^(D,io)).
Thus for each XQ G D there exists an integer «o < AT£)jJ/} possibly 0, such that xm = xv(to + noA^,to,xo) G A„(to + noAj,). By the positive invariance of the family of sets {A,,(to), to € IK} proved in Lemma 5 all successive values xn remain in Aj,(to + nAu), so the proof of Lemma 6 is complete. • However, we need a family of nonempty compact subsets of Rd which is positively invariant and uniformly absorbing for the continuous time process xu(t,tQ,xo). For this we define K(to)=
|J
xv{t0,T,Au(T))
to—A„
for all n > Nrj^, XQ G D and to G R. Proof. Choose XQ in a compact subset D of R d , let us write tn = to + nAj,, xn = xv(to + nAv,to,XQ). If XQ G Aj/(to) we have nothing to prove. Now assume that XQ £ Aj/(to). Then, by the Lyapunov inequality
for each to G R (see Fig. 12). These sets are obviously nonempty and compact. Note that x* G A* (t 0 ) =>• x* = xv(t0, r*, z*) r*G[t0-A„to],^GA,(T*).
with (A.7)
Bifurcations and Continuous Transitions of Attractors
65
Xv(to,T2,Au(T2))
xJt0,Ti,kv{Ti))
H \
h
T
h~^v
in
T2 Fig. 12.
The definition of A* (t0).
We will show that the family of sets {A*(to), to G R} is positively invariant and absorbing for the continuous time process xv{t,to,xo) uniformly in to € M, provided v (and hence Av) is sufficiently small. Lemma 7. xv{t, to, A*(to)) Q A*(t) for all t > toProof. Consider an arbitrary point x* G A*(to), using (A.7) we get x* = xv(to,r*,z*). We prove that xv(t,to,x*) € A*(t) for t G [t0,t0 + Au] in two steps by showing it for t € [to, r* + Aj,] and then for t€ [T* + Av,tQ + Av\. Step 1.
€
for t > t 0 , we get xv(t,to,x*) [to,T*+Av]. Step 2.
xv(t,T*,Av(r*)) € A*(t) for t E
Prom Lemma 5, we have xv{r* +
XV{T*
+
+
AV,T*,
AV),SO
Aw,to,x*)
= XU{T* + AV,T*,Z*)
The proof of the absorbing property is easier. Lemma 8. For each compact subset D of IRd there exists a time TDJV > 0 such that x„{t,t0,D)CAl(t) for all t > to + Tr),v and each to G R. Proof. We note from Lemma 6 that
e A„(T* +
A„).
Hence xu{t,to,x*) € xv{t,T* + A„,A„(r* + A„)) for all t > T* + Au, from which it follows that xu{t,t0,x*) € A*(t) for at least t G [r*+Ai / ,to+A v ]. Combining Steps 1 and 2, we have ^(t,t0,A*(t0))CA*(t) for at least t G [to, to + A^].
C A„(t0 + nA„) C
A*(t0+nA„)
for n = ND,V > 0, so by the positive invariance property we then obtain
Xu(t, to, X*) = Xu(t, to, Xv(t0, T*,Z*))
K„{T*))C\K{T*
We can repeat the above argument on the intervals [to + nAy, to + (n + 1)Av] for n = 1, 2, . . . t o obtain the inclusion for all t > to. •
xv(t0 + nAv,to,D)
Using the fact that
= xu(t,T*,z*)
t
xv(t,t0,D)CAl(t) for t > t 0 + TDiV, where TDi„ := NDi„A„.
•
We notice that the time elapsed until being absorbed Tr)tV does not depend on to- From this, we conclude that the family {A* (to), to G M} is also absorbing in the pullback sense of the following Lemma. Lemma 9. For each compact subset D of Md there exists a time TD,V > 0 such that xv(t0,to-T,D)
CA*(t 0 )
for all T > TD,V and each to G R. Finally the pullback attracting component sets converge upper semicontinuously to AQ uniformly in t 0 G R.
66
P. E. Kloeden & S. Siegmund
Lemma 10. KLUJ(U))
# ^ ( A * ( t 0 ) , A))
<
a~\ri{y)
+
-> 0 as v - • 0.
Xv{to,tQ - r 2 , A*(t0 - T2))
Proof. We apply the Lyapunov inequality (A.4) to x* € A*(to) given by x* = xv{to,T*,z*) for T* e [t0 - Au,to\ and z* <E A„(r*), see (A.7), to obtain V(t0,x*)
=
< r}{v) + KLcu(v).
and convergence attractors
~Tl,Xu(tQ
~Tl,t0
c xv(tQ,t0 -ri,A*(t 0
- T 2 ,A*(t 0 — T 2 )))
-n)).
The invariance
The result then follows from the fact that
A.2. Existence pullback
-Ti,A*(t0-ri))
for r\ < r 2 . This follows from the two-parameter evolution property and the fact that the family of absorbing sets is positively invariant, thus
= Xu(tQ,t0
<e-(t0~T^V(T*,z*)+KLu(v) < e-{to-T*] r)(y) + KLu(u)
C xu(to,t0
Xu(to,to -T 2 ,A*(t 0 - r 2 ) )
V(t0,xUt0,r*,z*))
a(dist(x*,A0))
nested, i.e.
*
Xvfato, A„(t0)) = A„(t) of
We apply standard theoretic methods for nonautonomous dynamical systems to the continuous time process x„(t,to,xo) and the family A* = {A*(to), to € R} of pullback absorbing sets defined in the previous subsection to obtain the existence of a pullback attractor Av = {Av(to),to € R} defined through
Au(to) = H x"(*0' *° ~ T' A ^ ° " r )) T>0
which is a nonempty and compact set, since the intersecting sets are nonempty compact and
follows from the above construction and the continuity 11-> Au{t) from the invariance and continuity of the process, since HR*(Av(t),Av(t0)) = HRd(xv(t, t 0 , Av(tQ)), Av{t0)) - • 0
as t - • t 0 .
In addition, the uniform upper semicontinuous convergence follows from the fact that Av(to) C A*(t 0 ), so iqd(AAto),Ao)
<
H£d(At(to),Ao)
for all to € M and the result follows from Lemma 10. We also note that the Av(t) are connected sets, since the A* (to) are connected and the Av(i) are an intersecting family of nested connected sets.
A SURVEY OF M E T H O D S FOR C O M P U T I N G (UN)STABLE MANIFOLDS OF V E C T O R FIELDS Department
B. K R A U S K O P F and H. M. OSINGA of Engineering Mathematics, University of Queen's Building, Bristol BS8 1TR, UK
Bristol,
E. J. D O E D E L Department of Computer Science, Concordia University, 1455 Boulevard de Maisonneuve O., Montreal Quebec, H3G 1M8 Canada M. E. H E N D E R S O N IBM Research, PO Box 218, Yorktown Heights, NY 10598,
USA
J. G U C K E N H E I M E R and A. VLADIMIRSKY Department of Mathematics, Cornell University, Malott Hall, Ithaca, NY 14853-4201, USA Institute
M. DELLNITZ and O. J U N G E for Mathematics, University of Paderborn, D-33095 Paderborn, Germany
Received May 14, 2004; Revised J u n e 16, 2004
The computation of global invariant manifolds has seen renewed interest in recent years. We survey different approaches for computing a global stable or unstable manifold of a vector field, where we concentrate on the case of a two-dimensional manifold. All methods are illustrated with the same example — the two-dimensional stable manifold of the origin in the Lorenz system. Keywords: Stable and unstable manifolds; numerical methods; Lorenz equations.
1. Introduction
assume t h a t all parameters are fixed and use (1) as the appropriate setting for t h e discussion of global manifolds. The goal is to understand the overall dynamics of system (1). To this end, one needs t o find special invariant sets, namely the equilibria, periodic orbits and possibly invariant tori. Furthermore, if these invariant sets are of saddle type then t h e y come with global stable and unstable manifolds. For example, the stable and unstable manifolds Ws(x.o) and WU(XQ) of a saddle equilibrium xo are defined as
Many applications give rise to mathematical models in the form of a system of ordinary differential equations. Well-known examples are periodically forced oscillators and t h e Lorenz system (introduced in Sec. 1.1); see, for example [Guckenheimer & Holmes, 1986; Kuznetsov, 1998; Strogatz, 1994] for further references. Such a dynamical system can be written in the general form
Ws(x0)
where x G W1 and the m a p / : R n H-> R n is sufficiently smooth. We remark that, in general, the function / will depend on parameters. However, we
•= ( x € R n | lim 0*(x) = x o ) I
u
W (x0)
67
i—>oo n
J
:= ( x G R \ lim 0-*(x) = x 0 ) ,
68
B. Krauskopf et al.
respectively, where 4>l is the flow of (1). Hence, trajectories on the stable (unstable) manifold converge to Xo in forward (backward) time. Knowing these manifolds is crucial as they organize the dynamics on a global scale. For example, stable manifolds may form boundaries of basins of attraction, and it is well known that intersections of stable and unstable manifolds lead to complicated dynamics and chaos. Generally, global stable and unstable manifolds cannot be found analytically. Furthermore, they are not implicitly defined, meaning that it is not possible to find them as the zero-set of some function of the phase space variables. Hence, points on global invariant manifolds cannot be found "locally". Instead, these manifolds must be "grown" from local knowledge, for example from linear information, near a fixed point XoIt is the purpose of this paper to review different numerical techniques that have recently become available to compute these global objects. We review five algorithms in detail and characterize their properties using a common test-case example, namely, the Lorenz manifold which is introduced now. 1.1.
The Lorenz
Fig. 1. The unstable manifold Wu(0) (red curve) accumulates on the butterfly-shaped Lorenz attractor. The blue disk is the linear approximation Es(0) of the Lorenz manifold Ws(0). Also shown are the two equilibria at the centers of the "wings" of the butterfly and their one-dimensional stable manifolds (blue curves).
manifold
The Lorenz system [Lorenz, 1963] is a classic example of a vector field with a chaotic attractor. It is given as
of (2). Each of these equilibria has one negative real eigenvalue, giving rise to a one-dimensional stable manifold, and an unstable pair of complex conjugate eigenvalues with positive real part. Figure 1 x = a(y — x), shows all equilibria of (2) in green, together with y = gx-y-xz, (2) their one-dimensional global manifolds. As mentioned, the red curve is the unstable manifold z = xy- 0z, Wu(0) of the origin, whose closure is the Lorenz where we fix the parameters at the standard choice attractor. The blue curves are the stable manifolds a = 10, Q = 28 and /? = 8/3, for which one of the two other equilibria. The blue disk lies in the finds the famous butterfly-shaped Lorenz attractor. linear eigenspace Es(0) of the origin. Note that the Lorenz system (2) has the symmetry The Lorenz attractor, that is, the red curve in (x,y, z) — i *- (—x,— y, z) of rotation by 7r about the Fig. 1 conveys the chaotic nature of the system, but 2-axis. In particular, the z-axis is invariant under does not give any information on the overall organithe flow. zation of the phase space of (2). This role is played The origin is a saddle point of (2) by the two-dimensional stable manifold Ws(0) of with real eigenvalues — 0 and — (
A Survey of Methods for Computing (Un) Stable Manifolds of Vector Fields
The Lorenz manifold has a number of astonishing properties. Imagine that the little blue disk in Fig. 1 "grows" to become the Lorenz manifold Ws(0), but without ever intersecting the red unstable manifold W"(0). In other words, the Lorenz manifold stays "in between" trajectories on the Lorenz attractor, but "spirals" simultaneously into both wings of the butterfly. Now imagine how trajectories on this manifold must be able to pass from one wing to the other. Any finitely grown part of Ws (0) is topologically still a two-dimensional disk, but one with a particularity intriguing embedding into R 3 . The geometry of Ws(0) can only truly be appreciated if one can draw an image of it. Some early work on the geometry of the Lorenz manifold can be found in [Perello, 1979]. Using "a desktop computer with a plotter" Perello studied the embedding of the stable manifold of the origin as a function of the parameter p and, in particular, provides a sketch for p close to 24.74. Pioneering efforts to visualize the Lorenz system are due to Stewart. Trajectories that illustrate the (local) stable manifold can be found in [Thompson & Stewart, 1986, Fig. 11.6], while [Stewart, 1986] is an extended abstract of a movie that visualizes the dynamics and global bifurcations (as a function of R) of the Lorenz system with computer graphics in the three-dimensional phase space. The first, hand-drawn image of (the structure of) the Lorenz manifold (that is, for the standard parameter values also used here) appeared in the book [Abraham & Shaw, 1985]. The first published computer-generated image of the Lorenz manifold is that in [Guckenheimer & Worfolk, 1993]. Not in the least due to its intriguing nature, the Lorenz manifold has become a much-used test-case example for evaluating algorithms that compute two-dimensional (un)stable manifolds of vector fields. For each of the methods discussed in this paper we present an image of the computed Lorenz manifold that is always taken from a viewpoint along the line spanned by the vector (\/3,1, 0) in the (x, y)-plane.
1.2.
Stable and unstable
manifolds
In order to explain the different methods for computing two-dimensional (un)stable manifolds, we need to introduce some notation. To keep the exposition simple, we consider here the case of a global (un)stable manifold of a hyperbolic saddle point XQ G M.n of (1). Furthermore, we present all theory
69
and the different methods for the case of an unstable manifold. This is not a restriction, because a stable manifold can be computed as an unstable manifold when time is reversed in system (1). Suppose now that /(xo) = 0 and for some 1 < k < n the Jacobian Df(-x.0) of / a t Xo has k eigenvalues with positive real parts and (n — A;) eigenvalues with negative real parts (counted with multiplicity). The Stable and Unstable Manifold Theorem (see, e.g. [Guckenheimer & Holmes, 1986; Kuznetsov, 1998]) states that a local unstable manifold W^ c (xo) exists in a neighborhood of xo. Furthermore, Wj"c(xo) is as smooth as / and tangent to the unstable (generalized) eigenspace Eu(x.o) of .D/(xo) at x o This means that we may define the global unstable manifold W u (xo) as Wu(x0)
= ( x 6 Rn\ lim 0*(x) = x o )
= l>'W°c( x o))-
(3)
t>0
Hence, W u (xo) is a A;-dimensional (immersed) manifold, defined as the globalization of W^)C(XQ) under the flow >*. Note that the local stable manifold Wj*c(xo) and the stable manifold Ws(xo) are similarly related with respect to the reversed direction of time, namely Ws(x0) = ( x € R n | lim ^ ( x ) = x o ) I
t—>oo
= lM^ioc( x o))-
J
(4)
This indeed shows that it is sufficient to consider only the case of an unstable manifold, possibly after reversing time. Definition (3) already suggests a method for computing W u (xo): take a small (k — l)-sphere (or other "outflow boundary" such as an ellipsoid) Ss C W^"c(xo) with radius 8 around xo and grow the manifold T^u(xo) by evolving Ss under the flow 0*. As starting data, one can take Ss C EU(XQ) or a higher-order approximation of W^"c(xo). In the special case k = 1 of computing a one-dimensional manifold, this method works well, because it boils down to evolving two points at distance 6 from xo under the flow. This can be done reliably by numerical integration of (1), so that computing one-dimensional unstable manifolds is straightforward. The one-dimensional manifolds in Fig. 1 were computed in this way.
70
B. Krauskopf et al.
However, the above method of evolving a circles, recall that the geodesic distance dg(x.,y) (k — l)-sphere Ss with k > 2 under the flow >* gen- is defined as the arclength of the shortest path in Wu(x.o) connecting x and y, called a geodesic. Conerally gives very poor results. This is so because Ss sider now the geodesic parametrization of ^ ( x o ) will typically deform very rapidly under (pt. In pargiven by ticular, it will stretch out along the strong unstable directions (if present). Furthermore, Ss is a continuous object that will have to be discretized by some W"(xo) = {S„}„>0 mesh. Any mesh on Ss will deteriorate rapidly under where Sv := {x e W ( x 0 ) | ^ ( x , x 0 ) = 77}. (6) the flow 0*, so that it will not be a good representation of W u (xo) as a fc-dimensional manifold. The geodesic parametrization (6) is entirely in terms of the geometry of WU(XQ), and not in terms 1.3. Different approaches to of the dynamics on the manifold. Since Wu(xo) is computing W"(x 0 ) a smooth manifold tangent to Eu(xo) at xo, there must be some 77max > 0 so that the geodesic level It is quite a challenge to compute a global unstau sets Sn for 0 < rf < r]max are all smooth closed ble manifold W (xo) of dimension at least two. curves without self-intersection, that is, topologiIndeed simple numerical integration of the flow is cal circles; see, for example, [Spivak, 1979]. We also not sufficient (except in very special cases) — dedirefer to geodesic level sets for r\ < r]maJC as geodesic cated algorithms are needed for this task. Before circles. Up until rymax, the geodesic parametrizawe describe some recent methods in more detail, tion (6) is geometrically the nicest parametrization, we first explain the underlying approaches in genbecause its elements, the geodesic circles, are the eral terms. It is useful to consider for this purpose U nicest possible topological circles on Wu(x.o)- (This different parametrizations of W (XQ). means here that the metric is exactly the identity.) We concentrate in this survey on the first nonFor the Lorenz manifold, apparently r/max = 00. trivial case k = 2 of a two-dimensional unstaHowever, the case of a finite rymax is possible and ble manifold. While all methods could be used in it typically involves a non-smooth geodesic circle; principle to compute higher-dimensional manifolds, see [Krauskopf &; Osinga, 2003] for details. almost all implementations are for k = 2. FurThe idea of computing W u (xo) as a sequence thermore, visualizing higher-dimensional manifolds of geodesic circles goes back to [Guckenheimer &; remains a serious challenge. The different methods Worfolk, 1993]. Starting with a small geodesic ciruse the idea of growing WU(XQ) from a local neighcle (or ellipse) Ss around xo, they modify the borhood of XQ. They differ in how they ensure that u vector field so that the component tangential to a good mesh representing W (x.o) is computed durthe last computed geodesic level set is practiing this growth process. cally zero, retaining only the radial part. Then Consider as starting data a small smooth closed the flow of the rescaled radial vector field is used curve Ss C W ^ x o ) , also referred to as a (topoto evolve (a sufficient number of points on) this logical) circle in what follows, of points that all lie geodesic circle by integration over a suitably small within a distance 8 from xo- (As was mentioned, and fixed integration time (now corresponding to one can take Ss C Eu(xo) if 8 is small enough.) The geodesic distance up to a rescaling of the radial goal is to find a "nice" parametrization of Wu(xo) part of the vector field). Figure 2 shows 36 approxin terms of the starting data S$. imate geodesic circles of the Lorenz manifold comAs we have seen above, the parametrization puted with this method up to geodesic distance 180. The output was produced in the DsTool softWu(xQ) = {^(Ss^tm (5) ware environment [Back et al., 1992], the manifold could be rendered as a two-dimensional surface is not practical. While the (^(Ss) are smooth closed by post-processing the data. When the vector curves for all t, they are typically not "nice" and "round". Indeed the curvature along these curves field / is largely tangential to the geodesic cirtypically varies dramatically, and they soon tend to cles, the computation of that vector field's radial look like very elongated ellipses. component becomes unstable unless the integration time r is sufficiently small (see the ripples on In order to define the parametrization of WU(XQ) as a family of the nicest possible topological the last few geodesic circles near the helix at the
A Survey of Methods for Computing (Un) Stable Manifolds of Vector Fields
71
new parametrization of WU(XQ) given by
W«(xo) = {A,}„>o where Av := {x € W™(x 0 )K(x,x 0 ) - 77},
Fig. 2. The Lorenz manifold computed with the method of [Guckenheimer & Worfolk, 1993] up to geodesic distance 180; the computed approximate geodesic level sets are at increasing radial distances from the origin with steps of 5.0 in between, which are indicated by a color change from magenta (small) to blue (large).
center of Fig. 2). This CFL-type stability condition becomes increasingly restrictive as the angle between the trajectories and geodesic circles decreases. More generally, the method from [Guckenheimer & Worfolk, 1993] can approximate stably only a part of the manifold, on which the vector field remains transverse to each geodesic circle. The method by [Krauskopf & Osinga, 1999, 2003], discussed in detail in Sec. 2, also computes Wu(xo) as a sequence of geodesic circles, but does not rescale the vector field. Instead, the idea is to find the next geodesic circle in a local (and changing) coordinate system given by hyperplanes perpendicular to the present geodesic circle. Determined by certain accuracy parameters, a suitable number of mesh points on the next geodesic circle is computed by solving appropriate boundary value problems. During the computation the interpolation error stays bounded, so that the overall quality of the mesh is guaranteed. A different approach is to reparametrize time so that the flow with respect to the new time progresses with the same speed along all trajectories through Ss, meaning that the same arclength is covered per unit time along all trajectories. One also speaks of arclength integration. We then have the
(7)
where da(x,y) denotes the arclength distance between two points x and y on the same trajectory; we set da(x, y) = 00 if x and y are not on the same trajectory. This parametrization can be considered as the best in terms of dynamically defined topological circles on WU{XQ). Johnson et al. [1997] used essentially this parametrization by trajectory arclength, but considered integration in the product of time and phase space. They started with a uniform mesh on a first small circle As € £?"(xo) and then integrated at each step the present mesh points up to a specified arclength. This leads to a new circle, on which a uniform mesh is then constructed by interpolation between the integration points. Figure 3 shows the Lorenz manifold computed with this method up to an approximate arclength distance of 200. The method is quite fast since it involves only direct integration and redistribution of points by interpolation. On the other hand, it is difficult to control the interpolation error, which is determined by the (unknown) dynamics on W u (xo). An altogether different parametrization of u W (xo) is the dual parametrization to (5) and (7) that consists of the individual trajectories through a fixed Ss C EU(X.Q)- It is formally given as W«(xo) =
{Bp}peS6
where B p := {0*(p)|t e R}.
(8)
Notice that, in the case of a two-dimensional manifold Wu(xrj) considered here, parametrization (8) is a one-parameter family of trajectories, while (5) and (7) are one-parameter families of closed curves. The method by Doedel, discussed in detail in Sec. 3, computes two-dimensional (un)stable manifolds by following trajectories Bp as a boundary value problem where the initial condition p € Ss is parametrized with one of the free continuation parameters. This method is very accurate and flexible by allowing for different boundary conditions at the other end point of the trajectory Bp, which includes specifying a fixed arclength L of the trajectory. During a computation, mesh points are distributed along the trajectories to maintain the accuracy of the computation.
72
B. Krauskopf et al.
Fig. 3. The Lorenz manifold computed with the method of [Johnson et al, 1997] up to a total trajectory arclength of about 200.
The method of [Henderson, 2003], discussed in detail in Sec. 4, also considers parametrization (8) of Jy"(xo) by orbits. However, the manifold is constructed directly as a two-dimensional object by computing fat trajectories. A fat trajectory is a string of polyhedral patches along a trajectory, where the size of each patch is given by local curvature information. When a fat trajectory reaches the prescribed total arclength L, the boundary of the computed part of the manifold is determined. Then a suitable starting point for the next fat trajectory is found and the computation continues. When no more possible starting points exist, the computation stops.
The method of [Guckenheimer & Vladimirsky, 2004], discussed in detail in Sec. 5, locally models W"(xo) as the graph of a function g that satisfies a quasilinear partial differential equation (PDE) expressing the tangency of the vector field / to the graph of g. The PDE is discretized in an Eulerian framework and the manifold is approximated by a triangulated mesh. At each step one new point is added to the mesh, leading to a new simplex whose other vertices are previously known mesh points. An Ordered Upwind Method determines where the next point/simplex is added and the ordering of new simplices is based on the arclength of the trajectories. The method of Dellnitz and Hohmann [1996, 1997], discussed in detail in Sec. 6, is complementary to the previous methods in that it computes an outer approximation of the manifold by boxes of the same dimension n as the phase space of (1). This method uses the time-r map of the flow 0* for some fixed r. A subdivision algorithm first finds a covering of W]"c(xo) with n-dimensional boxes of suitably small diameter. This local box covering is then globalized in steps by adding new boxes (of the same small size) that are "hit" under the time-r map by the present collection of boxes. The practical problem is to detect reliably when the image of one box intersects another box (for example, by using test points). If a priori bounds on the local growth rate of the vector field are known then it is possible to compute a rigorous box covering of Wu(x0); see [Junge, 2000a]. In the following sections we present the different algorithms in more detail, again illustrated with the computation of the Lorenz manifold
Ws(0).
2. Approximation by Geodesic Level Sets The method of Krauskopf and Osinga [1999, 2003] approximates a global (un)stable manifold as a sequence of geodesic circles of the parametrization (6). Only the case of a two-dimensional unstable manifold of a saddle point in a three-dimensional space is presented here. However, the method can be formulated in terms of computing a A;-dimensional manifold of a vector field in M n , and has been implemented to compute two-dimensional (un)stable manifolds of saddle points and saddle periodic orbits in a phase space of any dimension;
A Survey of Methods for Computing (Un) Stable Manifolds of Vector Fields
see the examples in [Krauskopf & Osinga, 1999, 2003] and also in [Osinga, 2000, 2003]. Variants of this method exist to compute global manifolds of maps; see [Krauskopf Sz Osinga, 1998a, 1998b]. The method completely steps away from evolving an existing mesh. Instead, new mesh points are computed by means of solving appropriate boundary value problems; see Sec. 2.1. The boundary conditions predetermine where the new mesh points need to be added in order to achieve a prescribed mesh quality. This method is as independent of the dynamics as possible and it grows the manifold as a sequence of discretized geodesic circles until r/max is reached where the geodesic level sets are no longer smooth circles; see Sec. 1.3. To be more specific, let Mi denote a circular list of mesh points from which a continuous topological circle Ci is formed by connecting neighboring points of Mi by line segments. The mesh points in Mi are computed to ensure that Ci is a good approximation (according to prespecified accuracy parameters) of an appropriate geodesic circle SVi. The manifold W u (x 0 ) is then approximated up to a prescribed geodesic distance L by the triangulation formed by the total mesh M = \J0
2.1. Finding
73
^ " ( x o ) n Tr by integration from Ci. Points in WU(XQ) n TT can be found by solving the twopoint boundary value problem «•(*) e ch
(9)
br{t) := <j>\qr{t)) € Tr,
(10)
where the integration time t is a free parameter. The situation is shown in Fig. 4 with actual data for the Lorenz manifold Ws(0) presented in Sec. 2.3. Note that for an unstable manifold t > 0 and for a stable manifold t < 0. The point br(tr) € Tr is uniquely defined by the property that tr is the smallest integration time (in absolute value) for which ||6 r (t r ) — r|| = Aj. If Aj is small enough then br(tr) exists and can be found by continuation of the trivial solution br(0) = qr{0) = r for t = 0 while checking for the first zero of the test function Ai - \\br(t) - r\\.
(11)
When the first zero is found then br(tr) = bT{t) is the candidate for a point in Mj+i; see Fig. 4.
a new point in Mi+1
Let us consider the task of finding Mi+\ at some prescribed increment A* from a known circular list Mi representing SVi. The circular list Mj+i is constructed pointwise. Let r € Mi and consider the (half)plane Tr through r that is (approximately) perpendicular to Ci at r. (In the implementation the normal to Tr is defined as the average of the two unit vectors through r and its immediate left and right neighbors.) Then WU(XQ) D TT is a well-defined one-dimensional curve locally near r, which is parametrized by the time it takes to reach
Fig. 4. The boundary value problem formulated for a mesh point r on the geodesic level set Ci is solved by a family of trajectories, starting at qr(t) on Ci and ending at br(t) in Tr, that is parametrized by integration time t. There is a unique first orbit such that ||6 r (
74
B. Krauskopf et al.
2.2. Mesh
2.3.
adaptation
Once all candidate points in Mj+i have been found, all for the same Aj, then it is decided whether the step size Aj was appropriate. To this end, it is checked that the curvature of (approximate) geodesies through all points r € Mj was not too large. This is done with a criterion that was originally introduced for one-dimensional global manifolds of maps [Hobson, 1993]. Let ar denote the angle between the line through r and br(tr) and the line through pr and r, where pr G Mj_j is the associated point of Mi_i on the approximate geodesic. The step of geodesic distance Aj was acceptable if both Oir < oWx, Ai-ar<
(Aa) m a x
and
(12) (13)
hold for all r £ Mi. In this case Mj + i is accepted and step i is complete. If there is some r 6 Mi that fails either (12) or (13) then Aj is halved and step i is repeated with this smaller Aj. Similarly, Aj may be doubled if for every r € Mi both ar and Aj • ar are well below the respective upper bounds in (12) or (13), say, below cerain and (Aa) m i n respectively. The parameters amin, £tmax, (Aa) m i n , and (Aa) m a x implicitly determine the mesh adaptation along geodesies and are fixed by the user before a computation. It is important to ensure that Q + i is also a good approximation of SVi+1. In other words, neighboring points of Mj+i may not be too close or too far from each other. When two neighboring points of Mj lead to two neighboring points of Mj+i at more than the prespecified distance Ajr from each other, then a new point is added in between. This is not done by interpolating between points of Mj+i but by applying step i of Sec. 2.2 for finding a new point in Mj+i to the middle point on Cj. In other words, no interpolation is ever performed between points that are more than Ajr distance apart. In order to ensure proper order relations between directly neighboring points of Mj+i a point is removed if two neighboring points in Mj+i lie closer together than a prespecified distance Syr. The mesh adaptation as decribed ensures that the overall error of a computation up to a prescribed geodesic distance L is bounded. This means that the computed piece of the manifold lies in an e- neighbor hood of Wu(xo), provided the accuray parameters are chosen small enough; see [Krauskopf & Osinga, 2003] for the proof.
The Lorenz approximated
manifold by geodesic
circles s
Figure 5 shows the Lorenz manifold W (0) represented by a total of 75 bands and with total geodesic distance 154.75. The manifold was computed starting with a mesh MQ of 20 points on Ss C Es(0) with S = 1.0. The computation was initiated with Ai = 0.25 and the mesh was generated using the accuracy parameters a min = 0.3, a m a x = 0.4, (Aa) m i n = 0.1, (Aa) m a x = 1.0, Ayr = 2.0, and 5r = 0.67. The coloring illustrates the geodesic distance from the origin, where blue is small, green is intermediate and red is large. The manifold was rendered as a twodimensional surface with the visualization package Geomview [Phillips et al, 1993]; other illustrations of the Lorenz manifold can be found in [Krauskopf k Osinga, 2003, 2004; Osinga & Krauskopf, 2002] and animations with [Krauskopf & Osinga, 2003, 2004]. Figure 5(a) shows the entire computed part of the Lorenz manifold from the common viewpoint; notice the similarity with the geodesic level sets in Fig. 2. Figure 5(b) shows an enlargement of the Lorenz manifold where the manifold is now transparent. This brings out the detail of the manifold, in particular, the development of a pair of extra helices that follow the main helix along the z-axis. Notice that points of the same color are on the same geodesic circle, which shows that points on Ws (0) that are close to the origin in Euclidean distance need not be close to the origin in geodesic distance. Figure 5(c) shows a further enlargement near the Lorenz attractor, which is illustrated in magenta by plotting the unstable manifold WU(Q). In this image only every second band is shown to obtain a see-through effect, showing clearly how the Lorenz manifold "rolls" into the Lorenz attractor. Figure 5(d) gives an impression of the computed mesh with an enlargement looking into one of the outer scrolls. Geodesic circles can be seen as spiraling curves (between bands of the same color). The approximate geodesies are the curves that point approximately radially out in the image. They are perpendicular to the geodesic circles, and locations where points were added can be identified as starting points of new approximate geodesies. Notice that the last six bands are closer together. The image illustrates how the distance between geodesic circles is determined by the curvature along geodesies, while the mesh distribution on the
A Survey of Methods for Computing (Uri)Stable Manifolds of Vector Fields
75
K L ^ HI
(a)
(b)
(c)
(d)
Fig. 5. The Lorenz manifold computed with the method of Krauskopf and Osinga up to geodesic distance 154.75. Panel (a) shows the entire manifold, panel (b) an enlargement where the manifold is transparent, panel (c) a further enlargement near the Lorenz attractor (in magenta) where only every second band is shown, and panel (d) the computed mesh when looking into the outer scroll.
geodesic circles is allowed to vary between Syr — 0.67 and A^r = 2.0.
3. B V P Continuation of Trajectories It seems very natural to use parametrization (8) for defining a one-parameter family that describes the
unstable manifold Wu (xo) of a saddle equilibrium xo of (1). An approximation to WU(XQ) could then be attempted by simple integration of Eq. (1) for a sufficient number of initial conditions that lie on the circle (or ellipse) Ss of small radius 6 in the stable eigenspace Eu(x.o) centered at xo- However, as was already explained in Sec. 1.3, this procedure
76
B. Krauskopf et al.
does not generally produce WU(X.Q) as a surface. The main task is to properly space the initial conditions around the circle, so that the result gives a reasonable distribution of the computed trajectories along the stable manifold. This is a major problem because the entire calculated trajectory (e.g. of a fixed finite length) depends very sensitively on the initial condition. The method of Doedel uses numerical continuation to solve this problem. The basic idea of continuation is to follow a (one-dimensional) branch of solutions that exists according to the Implicit Function Theorem around a regular root of a system of m equations with m + 1 unknowns. The step size in the continuation procedure (see Sec. 3.1 for details) measures the change of the entire computed trajectory (and various parameters), and not just the change in the initial condition. It is this key property of continuation that generally results in a reasonable distribution of trajectories along the stable manifold. In this section we only consider the computation of one-parameter families of trajectories, which together describe a two-dimensional (un)stable manifold of a fixed point. Most existing continuation algorithms can handle the computation of such one-dimensional families (also called solution branches); see, for example [Beyn et al., 2002; Doedel et al, 1991a; Doedel et al, 1991b; Keller, 1977; Rheinboldt, 1986; Seydel, 1995], and [Kuznetsov, 1998, Chapter 10]. The continuation method described here was implemented in the continuation package AUTO [Doedel, 1981; Doedel et al, 1997; Doedel et al, 2000] by specifying the respective driver files. Continuation algorithms have also been developed for the higher-dimensional case; see, for example [Allgower & Georg, 1996; Henderson, 2002]. Hence, this method could be applied, in principle, equally well to compute manifolds of dimension larger than two.
3.1. Pseudo-arclength
continuation
Let us begin with a discussion of some basic notions of continuation. Consider the finite-dimensional equation F(X) = 0,
F: R m + 1 - • R m ,
(14)
where F is assumed to be sufficiently smooth. This equation has one more variable than it has equations. Given a solution XQ, one has, generically, a
locally unique solution branch that passes through XQ. TO compute a next point, say, X\, on this branch, one can use Newton's method to solve the extended system F(X1) = 0,
(15)
(Xi - X0)*X0 = As.
(16)
Here XQ is the unit tangent to the path of solutions at XQ, the symbol * denotes transpose, and As is a step size in the continuation procedure. The vector XQ is a null vector of the m x (m + 1)dimensional Jacobian matrix FX{XQ), and it can be computed at little cost [Doedel et al, 1991a]. This continuation method is known as Keller's pseudoarclength method [Keller, 1977]. The size of the pseudo-arclength step As is normally adapted along the branch, depending, for example, on the convergence history of Newton's method. It is very important to note that the stepsize is measured with respect to all components of the solution, and not just one. The continuation procedure is well posed near a regular solution XQ, that is, if the null space of FX(XQ) is one-dimensional. Namely, in this case the Jacobian of the entire system (15)—(16) at XQ, that is, the (m + 1) x (m + 1) matrix
(T) is nonsingular. The Implicit Function Theorem then guarantees that a locally unique solution branch passes through XQ. This branch can be parametrized locally by As. Moreover, for As sufficiently small, and for sufficiently accurate initial approximation (for example, when taking X[ — XQ + ASXQ), Newton's method for solving Eqs. (15)-(16) converges.
3.2. Boundary value problem formulation When computing a branch of solutions to an ODE of the form (1), parametrized by initial conditions and the integration time T, one must keep in mind that (1) has infinitely many solutions and boundary or integral constraints must be imposed. Furthermore, the pseudo-arclength constraint (16) is then typically given in functional form; more details can be found in [Doedel et al, 1991b]. This means that the possibly unknown total integration time T is embedded in the equations. To this end, the vector
A Survey of Methods for Computing (Un) Stable Manifolds of Vector Fields
field (1) is rescaled so that integration always takes place over the interval [0,1], and the actual integration time T appears as a parameter. Hence, in this context, Eqs. (15)-(16) take the form x'1(<) = /(xi(t),Ai),
(18)
6(xi(0),xi(l),Ai) = 0,
(19)
/ g(xi(s),Ai)ds = 0, Jo
(20)
/ (xi(r)-Xp(T))*Xp(r)dr Jo + (Ai-Ao)*A 0 = As,
(21)
where the dimension of Ai must be chosen consistently with the dimensions of the boundary conditions (19) and the integral constraints (20) in order to ensure a one-dimensional family of solutions. Again, we stress that the continuation stepsize is for the entire solution X, and not just for the parameter vector Ai. Equations (15)-(16) must be solved for X\ = (xi(-),Ai), given a previous solution XQ = (xp(-), Ao) of the ODE and the path tangent XQ — (xp(-),Ao). That is, in a function space setting, Eqs. (18)-(20) correspond to the equation F(X) = 0, as in Eq. (14). Note that the dimension (7n + l) of X = (x(-), A) may be much larger than the dimension n of the phase space of (1). In particular, A always contains the parameter T, which may or may not vary during the continuation; see Sec. 3.3 for specific examples. If A = T t h e n / > ! ( * ) , Ai) = T / ( X l ( t ) ) . In each continuation step, Eqs. (18)-(21) are solved by a numerical boundary value algorithm. Here, the package AUTO [Doedel, 1981; Doedel et al, 1997; Doedel et al, 2000] is used, which uses piecewise polynomial collocation with Gauss-Legendre collocation points (also called orthogonal collocation), similar to COLSYS with adaptive mesh selection [Ascher et al, 1995; De Boor & Swartz, 1973; Russell & Christiansen, 1978]. In combination with continuation, this allows the numerical solution of "difficult" orbits. Moreover, for the case of periodic solutions, AUTO determines the characteristic multipliers (or Floquet multipliers) that determine asymptotic stability and bifurcation properties, as a byproduct of the decomposition of the Jacobian of the boundary value collocation system [Doedel et al, 1991b; Fairgrieve & Jepson, 1991]; see also [Lust, 2001].
77
3.3. BVP continuation of the (un)stable manifold of an equilibrium Consider now the situation that (1) has a saddle equilibrium xo with a two-dimensional unstable manifold, meaning that the Jacobian D / ( x o ) has exactly two eigenvalues \i\ and //2 with positive real part. Suppose further that vi and V2 are the associated (generalized) eigenvectors. We are looking for solutions of the system x'(i) = T/(x(i)),
(22)
x(0) = x 0 + <5(cos(0)Vl + sin(0)v 2 ),
(23)
which is a combination of Eqs. (18) and (19) with A = (9,T). Note that in Eqs. (22)-(23) the continuation equation corresponding to Eq. (21) (or Eq. (16)) has been omitted, even though it is an essential