A setoriented path following method for the approximation of parameter dependent attractors
Abstract
In this work we present a setoriented path following method for the computation of relative global attractors of parameterdependent dynamical systems. We start with an initial approximation of the relative global attractor for a fixed parameter computed by a setoriented subdivision method. By using previously obtained approximations of the parameterdependent relative global attractor we can track it with respect to a onedimensional parameter without restarting the whole subdivision procedure. We illustrate the feasibility of the setoriented path following method by exploring the dynamics in models for shear flows during the transition to turbulence.
1 Introduction
Over the last two decades socalled setoriented numerical methods have been developed in the context of the numerical treatment of finite dimensional dynamical systems (e.g., [12, 13, 14, 27, 29]). Here, the basic idea is to cover the objects of interest such as attractors, invariant manifolds or almost invariant sets by outer approximations which are created via subdivision and continuation techniques. The numerical effort depends essentially on the dimension of the global attractor, i.e., it is easier to compute a onedimensional attractor in a tendimensional space than to compute a threedimensional attractor in a fourdimensional space [13]. The setoriented techniques have been used successfully in several different application areas such as molecular dynamics ([19, 46, 10]), astrodynamics ([17, 16, 15]) and ocean dynamics ([28]). Moreover, a setoriented numerical framework has recently been developed which allows to perform uncertainty quantification for dynamical systems from a global point of view [18] and the computation of finite dimensional attractors or unstable manifolds of infinite dimensional dynamical systems [11, 52, 51]. In this work we connect these setoriented algorithms with ideas from bifurcation analysis and path following methods in order to efficiently treat parameter dependencies in the underlying dynamical system.
Systems of physical interest typically depend on parameters appearing in the defining systems of equations, i.e., one considers dynamical systems of the form
(1) 
where are the variables, are the system parameters, and is assumed to be sufficiently smooth. By varying , the qualitative structure of the solutions might change significantly, e.g., stable equilibria of the dynamical system might become unstable. Such phenomena are known as bifurcations and the parameter values are called bifurcation parameters (see [34, 36, 32, 49] for a detailed overview).
Bifurcations typically come in two kinds. On the one hand, one can look at local bifurcations [34, 32], where the analysis of such bifurcations is generally performed by studying the corresponding vector fields near equilibrium points. That is, one can usually reduce the problem to the analysis of an equation of the form
(2) 
Starting with an initial the aim is to find numerically an approximation of a solution curve depending on which is implicitly defined by (2). The basic idea of path following methods which tackle this kind of problem for parameterdependent fixed points and steady states can be found, e.g., in [1] and [2]. For the numerical treatment of bifurcation problems there exist a wide range of software tools, e.g., the wellknown software package AUTO [21]. A firstversion of AUTO has already been developed in 1981. More recent contributions to bifurcation analysis software are the MATLAB packages MATCONT [20] and COCO [7].
On the other hand, there are global bifurcations [31, 49] for which it is not sufficient to reduce the study to a neighborhood of an equilibrium or a fixed point. For example, these bifurcations occur when invariant sets, such as periodic orbits, collide with equilibria. Therefore, typical examples are formations of homoclinic and heteroclinic orbits which can also be found numerically with the software package AUTO [21] and COCO by formulating and solving an appropriate boundary value problem (e.g., [22]). In addition, MATCONT is able to continue homoclinic and heteroclinic orbits by a homotopy method [8].
In this work we extend the subdivision method for the approximation of the so–called relative global attractor to parameterdependent dynamical systems, i.e., we design a path following method from a global point of view, which indirectly allows the numerical analysis of global bifurcations. Note that the relative global attractor contains all backward invariant sets and, in particular, the homoclinic or heteroclinic connections. Using previously obtained approximations of the relative global attractor we can track it with respect to a onedimensional parameter without restarting the whole subdivision procedure. Since one computation of an attracting set might be very expensive by using the setoriented method, the algorithm developed in this article can reduce the overall computational cost significantly. The setoriented path following algorithm has been implemented in the dynamical systems software package GAIO (Global Analysis of Invariant Objects) [9], which is available for MATLAB (see https://github.com/gaioguy/GAIO).
We will use the setoriented path following method to explore the dynamics of shear flows during the transition to turbulence. In contrast to convection or TaylorCouette flows, where the transition can be captured by sequences of bifurcations that branch off the laminar state [4, 5], shear flows such as pipe flow or plane Couette flow do not show a linear instability of the laminar profile [45, 33]. The transition is then mediated by the presence of 3d states that form in saddlenode bifurcations [44, 24, 23, 25]. Very close to the bifurcation, the states of the upper branches can be stable, but they soon undergo secondary bifurcations and period doubling cascades [39, 3, 50]. Crisis bifurcations destroy the attractors and give rise to the open saddles that underlie the observed transience of the turbulent state [38, 40].
Exploring the dynamics in the full phase space is very complicated because of the highdimensionality of the relevant subspaces, though notable progress has been made in some cases [35, 30]. In order to prepare for the application to such computationally expensive examples, we begin here with an analysis of simple models that capture much of the phenomenology of shear flows: they have a laminar state that is linearly stable and a saddlenode bifurcation that represents the transition to turbulence. The models even contain the transition from an attractor to a transient saddle.
The simplest model where the modes have a physical interpretation is the fourdimensional model proposed by Waleffe [47]: the four components represent the transversal velocity components, the vortices, the streak, and the mean velocity. With the methods described here, we are able to trace the appearance of the attractor and its growth as the Reynolds number increases. We will then extend the analysis to the case of the ninedimensional model discussed in [42, 43].
A detailed outline of the paper is as follows: in Section 2.1 we briefly summarize the subdivision method introduced in [13]. In Section 2.2 we then develop the setoriented path following method which allows us to compute attracting sets of parameterdependent dynamical systems without restarting the subdivision procedure. In Section 3 we illustrate the efficiency of the path following method for two different reduced order models from fluid dynamics, namely, a fourdimensional model of selfsustained flows and a ninedimensional model of turbulent shear flows. Conclusions are given in Section 4.
2 A setoriented path following method
We consider parameter dependent dynamical systems of the form
(3) 
where and is a homeomorphism for each parameter in an open subset and uniformly continuous in on bounded sets, e.g., could be a timemap for the system (1). In what follows, for fixed we use the abbreviation . Moreover, we assume that has a compact global attractor for each , that is, the compact set attracts any bounded set . Later on, we will additionally assume that is upper semicontinuous in .
The aim of this work is to develop a setoriented path following method for the approximation of depending on the parameter . Since this method is based on the framework developed in [13] we start with a short review of the related material.
2.1 Brief review of the subdivision method
Let be a compact set. For a homeomorphism we define the global attractor relative to by
(4) 
Observe that if is the compact global attractor of .
As a first step we approximate this set with a subdivision procedure introduced in [13] for a fixed , that is, . Roughly speaking, the idea of the algorithm is to start with a finite family of compact subsets of that are a partition of . Then we refine this partition and remove those subsets that do not contain parts of the relative global attractor. By continuing this process we generate a sequence of finite collections of compact subsets of such that the diameter
converges to zero and the union approaches the relative global attractor for .
More precisely, let be the initial collection, e.g., . Then we inductively obtain from for in two steps.

Subdivision: Construct a new collection such that
and
where .

Selection: Define the new collection by
The first step guarantees that the collections consist of successively finer sets for increasing . In fact, by construction
In the second step we remove each subset whose preimage does neither intersect itself nor any other subset in .
Remark 2.1.
In the application of the subdivision scheme for the computation of the relative global attractor we have to perform the selection step
Thus, we have to decide whether or not the preimage of a given set has a nonzero intersection with another set , i.e.,
(5) 
Numerically this is realized as follows: we discretize each box by a finite set of test points and replace the condition (5) by
The selection step is responsible for the fact that the unions approach the relative global attractor. Denote by the collection of compact sets obtained after subdivision steps, that is
(6) 
Note that these sets form a nested sequence . Therefore the limit
exists and the following result has been proven in [13]:
Proposition 2.2.
Let be the global attractor relative to , and let be a finite collection of closed subset with . Then the sets obtained by the subdivision algorithm contain the relative global attractor, for all , and moreover
2.2 Path following method for the approximation of relative global attractors
In this section we develop a path following algorithm that allows to compute the relative global attractor for various parameter values of (3) by reusing previously obtained coverings. The idea of this method is to first approximate the relative global attractor for and then to use a covering of this set, denoted by , as a starting point to compute the relative global attractor for sufficiently close to .
We start with the following observation.
Lemma 2.3.
Let be a homeomorphism and assume that has a compact global attractor . Furthermore, let be compact sets such that . Then,
where is the global attractor relative to for .
Proof.
This statement follows directly by the definition of the global attractor relative to a compact set (cf. (4)) and the fact that . ∎
As a direct consequence we obtain the following result.
Proposition 2.4.
Let be a homeomorphism and assume that has a compact global attractor . Let be compact sets such that and denote by , , the corresponding sets obtained after subdivision and selection steps (see (6)). Then
where denotes the usual Hausdorff distance between two compact subsets .
Proposition 2.4 states that by performing sufficiently many subdivision and selection steps we obtain a good approximation of the attracting set no matter how we choose the initial covering as long as .
In what follows, let us assume that is a compact set such that for all . We denote by a finite family of compact sets , , which all contain the global attractor relative to of the map . Next, either we fix and choose sufficiently small such that or we fix and choose sufficiently close to such that . In any case Lemma 2.3 and Proposition 2.4 allows us to approximate the global attractor of the map using the initial covering with the subdivision algorithm described in the previous section. Observe that we can always choose for every , since and for by assumption.
To discuss the choice of for fixed we have to analyze the change of the attractor when the parameter is varied. To this end, we define the distance between two subsets of as
This distance allows us to define the continuity of attractors as follows:
Definition 2.5.
Let . The family of attractors is upper semicontinuous at if
(7) 
The attractor is called upper semicontinuous if is upper semicontinuous for each .
Note that upper semicontinuity at implies that for every there exists a neighborhood of such that for all , where denotes the neighborhood of . Thus, the attractor cannot become larger instantaneously by varying which is a naturally needed property for our proposed path following scheme. In fact, if the attracting set suddenly “explodes” we cannot assure that any previously computed covering besides still covers . For the sake of completeness we note that lower semicontinuity of , i.e.,
prevents a sudden shrinking of which holds for instance for gradient systems with hyperbolic fixed points [37]. However, this would be, in general, no issue for our proposed algorithm.
We are now in the position to prove that for each there is a range of parameters such that the attractor can be approximated by the subdivision algorithm with the initial compact set .
Proposition 2.6.
Let be the family of sets generated by the subdivision method such that for all . Suppose that there is such that for all and is upper semicontinuous at . Then for every there exists such that for all . In particular, can be approximated by using the initial compact set .
Proof.
Let be fixed. Due to the upper semicontinuity of in there is such that
Thus, we conclude by assumption that
∎
In the following we will call such feasible and Proposition 2.6 guarantees the existence of a feasible . Throughout the remainder of this article we now suppose that is upper semicontinuous and the additional assumptions of Proposition 2.6 hold. Then the numerical realization of the setoriented path following algorithm can be described as follows:
In Figure 1, we illustrate two steps of Algorithm LABEL:alg:pathFollowing for the Lorenz system [41] given by
(8)  
where we use as our parameter of interest. We note that the derivation of the Lorenz model shows that is related to the aspect ratio of the convection cells.
Remark 2.7.

Instead of following the path along in positive direction one can also take and follow the path in the negative direction.

Intuitively, choosing a larger decreases the range of feasible parameters . However, one has to perform less subdivision and selection steps to reach the same level, i.e., the same fineness of the final box covering of . With more knowledge on the upper semicontinuity property (7) we can make this more precise in the following Proposition.

If is not feasible, i.e., , might not contain all of and thus, the subdivision algorithm does not approximate the whole attractor . However, to make the algorithm more robust, we reintroduce sets if an image of a test point is not contained in any set of the current collection .
After discussing the choice of for fixed the following Proposition tells us, how to choose for a fixed step size in the parameter space , i.e., how to choose when is given.
Proposition 2.8.
Let and with . Suppose there is a constant such that
(9) 
and for one . Then and, in particular, is feasible for .
Proof.
According to (9) the neighborhood of contains and by assumption we immediately obtain
as claimed. ∎
3 Numerical examples
In this section we present results of computations carried out for a four and a ninedimensional reduced order model from fluid dynamics.
3.1 A fourdimensional model of selfsustained flows
As a first example, we consider a fourdimensional nonlinear model of selfsustained flows introduced in [47] and further discussed in [48]. The four variables of the model represent the spanwise velocity components (), the vortices (), the streak (), and the mean profile () (cf. [48] for more explanations of the model). Their dynamics is given by
(10) 
where is the Reynolds number, and , , , , and are positive parameters. For the parameters, we take values , , and ; a saddlenode bifurcation then appears for .
Our goal is to numerically analyze how the attracting sets change for the Reynolds numbers . We define and denote by the timemap of (10) which depends on the Reynolds number and the integration time . For the following analysis we fix the integration time of . Furthermore, we choose the initial box in which we want to approximate the relative global attractor . According to Algorithm LABEL:alg:pathFollowing we fix and . Following of Remark 2.7 (a) we start the path following algorithm for the Reynolds number and define for such that the interval is discretized equidistantly. A detailed analysis of (10) for can be found in [48]. In what follows, we will study the attractor from a global point of view. To this end, Figure 2 and Figure 4 show threedimensional projections of the relative global attractor obtained by Algorithm LABEL:alg:pathFollowing for different Reynolds numbers.
For a parameter value just below the saddlenode bifurcation, i.e., for , the attracting set does not contain any invariant structures besides the laminar profile . For just above the saddle node bifurcation, i.e., for , Figure 2 (a) shows that the attractor now contains an upper branch steady solution, as well as the lower branch saddle state. This situation persists up to , after which the upper branch undergoes a supercritical Hopf bifurcation.
The limit cycle is stable (cf. Figure 2 (b)) until (cf. Figure 2 (c)), where it disappears in a homoclinic bifurcation. Note that the attracting set does not change significantly, although the dynamics does: in the homoclinic bifurcation the attractor rips open and becomes a transient saddle. In order to demonstrate this change in the dynamics, we compare in Figure 3 (a) and (b) the average lifetimes for each box in the attracting set for and , respectively.
For we see a strict separation in the attracting set by the edge state: all boxes between the edge state and the laminar state have finite lifetimes, as they are attracted towards the laminar profile. All boxes inside the lobe around the upper branch state have infinite lifetimes because they are attracted to the limit cycle and cannot return to the laminar profile. Here, test points in each box were only integrated for times up to : the choice of time is not essential, since for a closed attractor around the upper branch state no trajectory can return to the laminar flow. For the limit cycle is not stable anymore, and all points except for the fixed points and the limit cycle return to the laminar profile. Observe that the obtained box coverings do not only cover the laminar profile but also the unstable manifolds which is due to the fact that the relative global attractor contains all backward invariant sets.
For the attractor develops a more complicated structure with folds and other features (Figure 4 (a–d)), that arise from the projection from the fourdimensional state space to the threedimensional image plane.
Finally, for another stable limit cycle appears (cf. Figure 4 (e) and (f)).
3.2 A ninedimensional model for turbulent shear flows
As a second example we consider a Fourier based ninedimensional model for a turbulent shear flow with free slip boundaries and a sinusoidal base profile. A first version with 8 degrees of freedom was described by Waleffe [47, 48], and extended to 9 modes in [42, 43]. The model is based on a Fourier expansion of the velocity field, and every component can be assigned to a specific flow field. In addition to the Reynolds number, the model has two spatial parameters describing the domain size in spanwise and downstream direction. The choice we consider here is the NBC domain (Nagata, Busse, Clever [44, 6]), i.e., a box with in spanwise and in downstream direction. For these parameters, the first state that appears is a periodic orbit, at . The periodic orbit is unstable from the onset, so that the dynamics is transient without the need for the occurrence of a crisis bifurcation. However, the lifetime increases very rapidly with Reynolds number [42].
Again, we choose the Reynolds number as our parameter of interest and compute the relative global attractor for Reynolds numbers starting with an initial and then decreasing in steps of one, , . Due to the complexity of the dynamics in the ninedimensional phase space it is hard to visualize the attracting set. An impression of the set may be obtained by threedimensional projections onto the modes that correspond to in the fourdimensional model (10) and to the modes which represent the principal components of the set.
In Figure 5 we see that these projections of the attractor look like dense balls with no discernable interior structure. A measure of the increasing complexity of the dynamics is the dimension of the attracting set, here quantified by the boxcounting dimension (cf. [26]) of the box coverings obtained by Algorithm LABEL:alg:pathFollowing. Figure 6 shows that this dimension increases with Reynolds number. For the dimension of the attracting set is about and increases to about for and most likely even higher values for .
4 Conclusions
The setoriented path following method is a powerful tool for the numerical analysis of global bifurcations for attracting sets. With the method developed in this paper the actual covering of an attracting set for a parameter value can be used as an initial covering for a parameter which is sufficiently close to . Thus, we do not need to restart the subdivision method, thereby significantly reducing the overall computational time. However, this path following method is only defined for finite dimensional dynamical systems. Therefore, it should be desirable to extend this work to the infinite dimensional setting, i.e., for the parameter dependent computation of attractors of infinite dimensional dynamical systems. In this context the results of [11, 52, 51] would have to be adapted.
The results in this article show that setoriented methods can also be used in moderatedimensional settings, where they can provide insight into the dynamics of shear flows during the transition to turbulence in simple models. The similarities in the behaviour of the lowdimensional models and fully resolved numerical simulations suggests that the global organization of phase space will be similar, even though such a study is computationally out of reach for highdimensional attractors.
Acknowledgments
This work is supported by the Priority Programme SPP 1881 Turbulent Superstructures of the Deutsche Forschungsgemeinschaft.
References
 [1] E. L. Allgower and K. Georg. Continuation and path following. Acta numerica, 2:1–64, 1993.
 [2] E. L. Allgower and K. Georg. Numerical path following. Handbook of numerical analysis, 5:3–207, 1997.
 [3] M. Avila, F. Mellibovsky, N. Roland, and B. Hof. StreamwiseLocalized Solutions at the Onset of Turbulence in Pipe Flow. Phys Rev Lett, 110(22):224502, May 2013.
 [4] S. Chandrasekhar. Hydrodynamic and hydromagnetic stability. Oxford University Press, Oxford, 1961.
 [5] P. Chossat and G. Iooss. The CouetteTaylor Problem. SpringerVerlag, 1994.
 [6] RM Clever and Fritz H Busse. Tertiary and quaternary solutions for plane couette flow. Journal of Fluid Mechanics, 344:137–153, 1997.
 [7] H. Dankowicz and F. Schilder. Recipes for continuation, volume 11 of Computational Science and Engineering. SIAM, 2013.
 [8] V. De Witte, W. Govaerts, Y. A. Kuznetsov, and M. Friedman. Interactive initialization and continuation of homoclinic and heteroclinic orbits in matlab. ACM Transactions on Mathematical Software (TOMS), 38(3):18, 2012.
 [9] M. Dellnitz, G. Froyland, and O. Junge. The algorithms behind GAIO — Set oriented numerical methods for dynamical systems. In Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems, pages 145–174. SpringerVerlag, 2001.
 [10] M. Dellnitz, K. A. Grubits, J. E. Marsden, K. Padberg, and B. Thiere. Set oriented computation of transport rates in 3degree of freedom systems: the Rydberg atom in crossed fields. Regular and Chaotic Dynamics, 10(2):173–192, 2005.
 [11] M. Dellnitz, M. Hesselvon Molo, and A. Ziessler. On the computation of attractors for delay differential equations. Journal of Computational Dynamics, 3(1):93–112, 2016.
 [12] M. Dellnitz and A. Hohmann. The Computation of Unstable Manifolds using Subdivision and Continuation. In Nonlinear Dynamical Systems and Chaos, pages 449–459. Springer, 1996.
 [13] M. Dellnitz and A. Hohmann. A subdivision algorithm for the computation of unstable manifolds and global attractors. Numerische Mathematik, 75:293–317, 1997.
 [14] M. Dellnitz and O. Junge. On the approximation of complicated dynamical behavior. SIAM Journal on Numerical Analysis, 36(2):491–515, 1999.
 [15] M. Dellnitz and O. Junge. Set oriented numerical methods in space mission design. Modern Astrodynamics, 1:127–153, 2006.
 [16] M. Dellnitz, O. Junge, W. S. Koon, F. Lekien, M. W. Lo, J. E. Marsden, K. Padberg, R. Preis, S. D. Ross, and B. Thiere. Transport in dynamical astronomy and multibody problems. International Journal of Bifurcation and Chaos, 15(03):699–727, 2005.
 [17] M. Dellnitz, O. Junge, M. Lo, J. E. Marsden, K. Padberg, R. Preis, S. Ross, and B. Thiere. Transport of Marscrossing asteroids from the quasiHilda region. Physical Review Letters, 94(23):231102, 2005.
 [18] M. Dellnitz, S. Klus, and A. Ziessler. A setoriented numerical approach for dynamical systems with parameter uncertainty. SIAM Journal on Applied Dynamical Systems, 16(1):120–138, 2017.
 [19] P. Deuflhard, M. Dellnitz, O. Junge, and C. Schütte. Computation of essential molecular dynamics by subdivision techniques. In Computational Molecular Dynamics: Challenges, Methods, Ideas, pages 98–115. SpringerVerlag, 1999.
 [20] A. Dhooge, W. Govaerts, and Y. A. Kuznetsov. Matcont: a matlab package for numerical bifurcation analysis of odes. ACM Transactions on Mathematical Software (TOMS), 29(2):141–164, 2003.
 [21] E. J. Doedel. Auto: A program for the automatic bifurcation analysis of autonomous systems. Congr. Numer, 30:265–284, 1981.
 [22] E. J. Doedel and M. J. Friedman. Numerical computation of heteroclinic orbits. Journal of Computational and Applied Mathematics, 26(12):155–170, 1989.
 [23] B. Eckhardt. Turbulence transition in pipe flow: some open questions. Nonlinearity, 21(1):T1–T11, December 2007.
 [24] B. Eckhardt, T. M. Schneider, B. Hof, and J. Westerweel. Turbulence Transition in Pipe Flow. Annu Rev Fluid Mech, 39(1):447–468, January 2007.
 [25] Bruno Eckhardt. Transition to turbulence in shear flows. Physica A, 504:121–129, August 2018.
 [26] K. Falconer. Fractal geometry: mathematical foundations and applications. John Wiley & Sons, 2013.
 [27] G. Froyland and M. Dellnitz. Detecting and locating nearoptimal almost invariant sets and cycles. SIAM Journal on Scientific Computing, 24(6):1839–1863, 2003.
 [28] G. Froyland, C. Horenkamp, V. Rossi, N. Santitissadeekorn, and A. Sen Gupta. Threedimensional characterization and tracking of an Agulhas ring. Ocean Modelling, 5253:69–75, 2012.
 [29] Gary Froyland, Simon Lloyd, and Naratip Santitissadeekorn. Coherent sets for nonautonomous dynamical systems. Physica D: Nonlinear Phenomena, 239:1527–1541, 2010.
 [30] J. F. Gibson, J. Halcrow, and P. Cvitanović. Equilibrium and travellingwave solutions of plane Couette flow. J Fluid Mech, 638:243, September 2009.
 [31] M. Golubitsky and I. Stewart. The symmetry perspective: from equilibrium to chaos in phase space and physical space, volume 200. Springer Science & Business Media, 2003.
 [32] M. Golubitsky, I. Stewart, and D. G. Schaeffer. Singularities and groups in bifurcation theory, volume 2. Springer Science & Business Media, 2012.
 [33] S. Grossmann. The onset of shear flow turbulence. Rev Mod Phys, 72(2):603–618, April 2000.
 [34] J. Guckenheimer and P. Holmes. Local bifurcations. In Nonlinear oscillations, dynamical systems, and bifurcations of vector fields, pages 117–165. Springer, 1983.
 [35] J. Halcrow, J. F. Gibson, P. Cvitanović, and D. Viswanath. Heteroclinic connections in plane Couette flow. J Fluid Mech, 621:365, February 2009.
 [36] J. K. Hale and H. Koçak. Dynamics and bifurcations, volume 3. Springer Science & Business Media, 2012.
 [37] Jack K Hale and Geneviève Raugel. Lower semicontinuity of attractors of gradient systems and applications. Annali di Matematica pura ed applicata, 154(1):281–326, 1989.
 [38] B. Hof, J. Westerweel, T. M. Schneider, and B. Eckhardt. Finite lifetime of turbulence in shear flows. Nature, 443(7107):59–62, September 2006.
 [39] T. Kreilos and B. Eckhardt. Periodic orbits near onset of chaos in plane Couette flow. Chaos, 22(4):047505, 2012.
 [40] T. Kreilos, B. Eckhardt, and T. M. Schneider. Increasing Lifetimes and the Growing Saddles of Shear Flow Turbulence. Phys Rev Lett, 112(4):044503, January 2014.
 [41] E. N. Lorenz. Deterministic nonperiodic flow. Journal of the Atmospheric Sciences, 20(2):130–141, 1963.
 [42] J. Moehlis, H. Faisst, and B. Eckhardt. A lowdimensional model for turbulent shear flows. New Journal of Physics, 6(1):56, 2004.
 [43] J. Moehlis, H. Faisst, and B. Eckhardt. Periodic orbits and chaotic sets in a lowdimensional model for shear flows. SIAM Journal on Applied Dynamical Systems, 4(2):352–376, 2005.
 [44] M. Nagata. Threedimensional finiteamplitude solutions in plane Couette flow : bifurcation from infinity. J Fluid Mech, 217:519–527, August 1990.
 [45] P. J. Schmid and D. S. Henningson. Stability and Transition of Shear Flows. Springer, New York, 1999.
 [46] C. Schütte, W. Huisinga, and P. Deuflhard. Transfer operator approach to conformational dynamics in biomolecular systems. In Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems, pages 191–223. SpringerVerlag, 2001.
 [47] F. Waleffe. Hydrodynamic stability and turbulence: Beyond transients to a selfsustaining process. Studies in applied mathematics, 95(3):319–343, 1995.
 [48] F. Waleffe. Transition in shear flows. nonlinear normality versus nonnormal linearity. Physics of Fluids, 7(12):3060–3066, 1995.
 [49] S. Wiggins. Global bifurcations and chaos: analytical methods, volume 73. Springer Science & Business Media, 2013.
 [50] S. Zammert and B. Eckhardt. Crisis bifurcations in plane Poiseuille flow. Phys Rev E, 91(4):041003, April 2015.
 [51] A. Ziessler. Analysis of Infinite Dimensional Dynamical Systems by SetOriented Numerics. PhD thesis, Paderborn University, 2018.
 [52] A. Ziessler, M. Dellnitz, and R. Gerlach. The numerical computation of unstable manifolds for infinite dimensional dynamical systems by embedding techniques. arXiv preprint arXiv:1808.08787, 2018.