Where Can Buy Applied and Computational Measurable Dynamics 1st Edition Erik M. Bollt Ebook With Cheap Price
Where Can Buy Applied and Computational Measurable Dynamics 1st Edition Erik M. Bollt Ebook With Cheap Price
Where Can Buy Applied and Computational Measurable Dynamics 1st Edition Erik M. Bollt Ebook With Cheap Price
com
https://ebookname.com/product/applied-and-computational-
measurable-dynamics-1st-edition-erik-m-bollt/
OR CLICK BUTTON
DOWNLOAD EBOOK
https://ebookname.com/product/computational-river-dynamics-1st-
edition-weiming-wu/
https://ebookname.com/product/computational-river-dynamics-1st-
edition-weiming-wu-2/
https://ebookname.com/product/applied-computational-fluid-
dynamics-techniques-an-introduction-based-on-finite-element-
methods-2nd-ed-edition-lohner/
https://ebookname.com/product/advertising-and-promotion-6th-
edition-michael-a-belch/
Information Rights Vol 1 2 A Practitioner s Guide to
Data Protection Freedom of Information and Other
Information Rights 6th Edition Philip Coppel Kc
https://ebookname.com/product/information-rights-
vol-1-2-a-practitioner-s-guide-to-data-protection-freedom-of-
information-and-other-information-rights-6th-edition-philip-
coppel-kc/
https://ebookname.com/product/the-global-decline-of-the-
mandatory-death-penalty-constitutional-jurisprudence-and-
legislative-reform-in-africa-asia-and-the-caribbean-andrew-novak/
https://ebookname.com/product/cognitive-neuroscience-of-human-
systems-work-and-everyday-life-1st-edition-chris-forsythe/
https://ebookname.com/product/introduction-to-functional-
equations-1st-edition-prasanna-k-sahoo/
https://ebookname.com/product/in-the-nature-of-landscape-
cultural-geography-on-the-norfolk-broads-1st-edition-david-
matless/
Reactive Species Detection in Biology From Fluorescence
to Electron Paramagnetic Resonance Spectroscopy 1st
Edition Frederick A. Villamena
https://ebookname.com/product/reactive-species-detection-in-
biology-from-fluorescence-to-electron-paramagnetic-resonance-
spectroscopy-1st-edition-frederick-a-villamena/
Downloaded 02/08/23 to 155.210.84.108 . Redistribution subject to SIAM license or copyright; see https://epubs.siam.org/terms-privacy
MM18_Bollt-Santitissadeekorn_FM-10-04-13.indd 1
Dynamics
Measurable
Applied and
Computational
10/18/2013 10:42:04 AM
Mathematical Modeling Editor-in-Chief
and Computation Richard Haberman
Southern Methodist
Downloaded 02/08/23 to 155.210.84.108 . Redistribution subject to SIAM license or copyright; see https://epubs.siam.org/terms-privacy
University
About the Series
The SIAM series on Mathematical Modeling and Computation draws attention to the
wide range of important problems in the physical and life sciences and engineering Editorial Board
that are addressed by mathematical modeling and computation; promotes the
interdisciplinary culture required to meet these large-scale challenges; and encourages Alejandro Aceves
the education of the next generation of applied and computational mathematicians,
physical and life scientists, and engineers. Southern Methodist
University
The books cover analytical and computational techniques, describe significant
mathematical developments, and introduce modern scientific and engineering
applications. The series will publish lecture notes and texts for advanced undergraduate- Andrea Bertozzi
or graduate-level courses in physical applied mathematics, biomathematics, and University of California,
mathematical modeling, and volumes of interest to a wide segment of the community Los Angeles
of applied mathematicians, computational scientists, and engineers.
Appropriate subject areas for future books in the series include fluids, dynamical Bard Ermentrout
systems and chaos, mathematical biology, neuroscience, mathematical physiology,
epidemiology, morphogenesis, biomedical engineering, reaction-diffusion in chemistry,
University of Pittsburgh
nonlinear science, interfacial problems, solidification, combustion, transport theory,
solid mechanics, nonlinear vibrations, electromagnetic theory, nonlinear optics, wave Thomas Erneux
propagation, coherent structures, scattering theory, earth science, solid-state physics, Université Libre de
and plasma physics.
Bruxelles
Erik M. Bollt and Naratip Santitissadeekorn, Applied and Computational Measurable Bernie Matkowsky
Dynamics Northwestern University
Daniela Calvetti and Erkki Somersalo, Computational Mathematical Modeling:
An Integrated Approach Across Scales
Robert M. Miura
Jianke Yang, Nonlinear Waves in Integrable and Nonintegrable Systems New Jersey Institute
A. J. Roberts, Elementary Calculus of Financial Mathematics of Technology
James D. Meiss, Differential Dynamical Systems
E. van Groesen and Jaap Molenaar, Continuum Modeling in the Physical Sciences Michael Tabor
Gerda de Vries, Thomas Hillen, Mark Lewis, Johannes Müller, and Birgitt Schönfisch, University of Arizona
A Course in Mathematical Biology: Quantitative Modeling with Mathematical and
Computational Methods
Ivan Markovsky, Jan C. Willems, Sabine Van Huffel, and Bart De Moor, Exact and
Approximate Modeling of Linear Systems: A Behavioral Approach
R. M. M. Mattheij, S. W. Rienstra, and J. H. M. ten Thije Boonkkamp, Partial
Differential Equations: Modeling, Analysis, Computation
Johnny T. Ottesen, Mette S. Olufsen, and Jesper K. Larsen, Applied Mathematical
Models in Human Physiology
Ingemar Kaj, Stochastic Modeling in Broadband Communications Systems
Peter Salamon, Paolo Sibani, and Richard Frost, Facts, Conjectures, and
Improvements for Simulated Annealing
Lyn C. Thomas, David B. Edelman, and Jonathan N. Crook, Credit Scoring and Its
Applications
Frank Natterer and Frank Wübbeling, Mathematical Methods in Image Reconstruction
Per Christian Hansen, Rank-Deficient and Discrete Ill-Posed Problems: Numerical
Aspects of Linear Inversion
Michael Griebel, Thomas Dornseifer, and Tilman Neunhoeffer, Numerical
Simulation in Fluid Dynamics: A Practical Introduction
Khosrow Chadan, David Colton, Lassi Päivärinta, and William Rundell, An
Introduction to Inverse Scattering and Inverse Spectral Problems
Charles K. Chui, Wavelets: A Mathematical Tool for Signal Analysis
Applied and
Computational
Measurable
Dynamics
Erik M. Bollt
Clarkson University
Potsdam, New York
Naratip Santitissadeekorn
University of North Carolina
Chapel Hill, North Carolina
10 9 8 7 6 5 4 3 2 1
All rights reserved. Printed in the United States of America. No part of this book may be
reproduced, stored, or transmitted in any manner without the written permission of the publisher.
For information, write to the Society for Industrial and Applied Mathematics, 3600 Market Street,
6th Floor, Philadelphia, PA 19104-2688.
Trademarked names may be used in this book without the inclusion of a trademark symbol.
These names are used in an editorial context only; no infringement of trademark is intended.
MATLAB is a registered trademark of The MathWorks, Inc. For MATLAB product information,
please contact The MathWorks, Inc., 3 Apple Hill Drive, Natick, MA 01760-2098 USA,
508-647-7000, Fax: 508-647-7001, [email protected], www.mathworks.com.
Figures 1.1, 4.15, 6.24, 7.20-23, 7.29-30, and text of Sections 4.4.2-5 reprinted with permission
from Elsevier.
Figure 1.17 reprinted courtesy of NASA.
Figure 1.18 reprinted courtesy of HYCOM.
Figures 1.12, 1.20-21, 3.2, 6.2-4, 6.27, 6.30, 6.32-34, 7.25-28, 9.10, 9.12-15, Table 9.1, and text
of Section 9.8.1 reprinted with permission from World Scientific Publishing.
Text of Sections 4.2.2-4 reprinted with permission from Taylor and Francis Group LLC Books.
Figure 5.7 reprinted with permission from Springer Science+Business Media.
Figures 5.11-13, 6.29, 6.35, 7.23, 7.31-32, 9.8 reprinted with permission from the American
Physical Society.
Figure 6.16 reprinted with permission from Noris-Spiele.
Figures 9.7 and 9.16 reprinted with permission from IOP Science.
Figure 9.11 reprinted with permission from IEEE.
is a registered trademark.
Contents
Preface xi
vii
viii Contents
Downloaded 02/08/23 to 155.210.84.108 . Redistribution subject to SIAM license or copyright; see https://epubs.siam.org/terms-privacy
Bibliography 333
Index 355
Downloaded 02/08/23 to 155.210.84.108 . Redistribution subject to SIAM license or copyright; see https://epubs.siam.org/terms-privacy
Preface
Measurable dynamics has traditionally referred to ergodic theory, which is in some sense a
sister topic to dynamical systems and chaos theory. However, the topic has until recently
been a highly theoretical mathematical topic which is generally less obvious to those prac-
titioners in applied areas, who may not find obvious links to practical, real-world problems.
During the past decade, facilitated by the advent of high-speed computers, it has become
practical to represent the notion of a transfer operator discretely but to high resolution
thanks to rapidly developing algorithms and new numerical methods designed for the pur-
pose. An early book on this general topic is Cell-to-Cell Mapping: A Method of Global
Analysis for Nonlinear Systems [167] from 1987.1 A tremendous amount of progress and
sophistication has come to the empirical perspective since then.
Rather than discussing the behaviors of complex dynamical systems in terms of fol-
lowing the fate of single trajectories, it is now possible to empirically discuss global ques-
tions in terms of evolution of density. Now complementary to the traditional geometric
methods of dynamical systems transport study, particularly by stable and unstable man-
ifold structure and bifurcation analysis, we can analyze transport activity and evolution
by matrix representation of the Frobenius–Perron transfer operator. While the traditional
methods allow for an analytic approach, when they work, the new and fast-developing com-
putational tools discussed here allow for detailed analysis of real-world problems that are
simply beyond the reach of traditional methods. Here we will draw connections between
the new methods of transport analysis based on transfer operators and the more traditional
methods. The goal of this book is not to become a presentation of the general topic of
dynamical systems, as there are already several excellent textbooks that achieve this goal
in a manner better than we can hope. We will bring together several areas, as we will draw
connections between topological dynamics, symbolic dynamics, and information theory
to show that they are also highly relevant to the Ulam–Galerkin representations. In these
parts of the discussion, we will compare and contrast notions from topological dynamics
to measurable dynamics, the latter being the first topic of this book. That is, if measurable
dynamics means a discussion of a dynamical system in consideration of how much, how
big, and other notions that require measure structure to discuss transport rates, topological
dynamics can be considered as a parallel topic of study that asks similar questions in the
absence of a measure that begets scale. As such, the mechanism and geometry of trans-
port are more the focus. Therefore, including a discussion of topological dynamics in our
primary discussion here on measurable dynamics should be considered complementary.
xi
xii Preface
Downloaded 02/08/23 to 155.210.84.108 . Redistribution subject to SIAM license or copyright; see https://epubs.siam.org/terms-privacy
There are several excellent previous related texts on mathematical aspects of trans-
fer operators which we wish to recommend as possible supplements. In particular, La-
sota and Mackay [198] give a highly regarded discussion of the theoretical perspective of
Frobenius–Perron operators in dynamical systems, whose material we overlap in as far as
we need these elements for the computational discussion here. Boyarsky and Gora [50] also
give a sharp presentation of an ensembles density perspective in dynamical systems, but
more specialized for one-dimensional maps, and some of the material and proofs therein
are difficult to find elsewhere. Of course the book by Baladi [11] is important in that it
gives a thoroughly rigorous presentation of transfer operators, including a unique perspec-
tive. We recommend highly the book by Zhou and Ding, [324], which covers a great deal
of theoretical information complementary to the work discussed in this book, including
Ulam’s method and piecewise constant approximations of invariant density, piecewise lin-
ear Markov models, and especially analysis of convergence. Also an in-depth study can
be found concerning connections of the theory of Frobenius–Perron operators and the ad-
joint Koopman operator, as well as useful background in measure theory and functional
analysis. The book by McCauley [215] includes a useful perspective regarding what is
becoming a modern perspective on computational insight into behaviors of dynamical sys-
tems, especially experimentally observed dynamical systems. That is, finite realizations of
chaotic data can give a great deal of insight. This is a major theme which we also develop
here toward the perspective that a finite time sample of a dynamical system is not just an
estimate of the long time behavior, as suggested perhaps by the traditional perspective, but
in fact finite time samples are most useful in their own right toward understanding finite
time behavior of a dynamical system. After all, any practical, real-world observation of a
dynamical system can be argued to exist only during a time window which cannot possibly
be infinite in duration.
There are many excellent textbooks on the general theory of dynamical systems,
clearly including Robinson [268], Guckenheimer and Holmes [146], Devaney [95], Alli-
good, Sauer, and Yorke [2], Strogatz [301], Perko [251], Meiss [218], Ott [244], Arnold [4],
Wiggins [316], and Melo and van Strein [89], to name a few. Each of these has been very
popular and successful, and each is particularly strong in special aspects of dynamical sys-
tems as well as broad presentation. We cannot and should not hope to repeat these works
in this presentation, but we do give what we hope is enough background of the general
dynamical systems theory in order that this work can be somewhat self-contained for the
nonspecialist. Therefore, there is some overlap with other texts insofar as background in-
formation on the general theory is given, and we encourage the reader to investigate further
in some of the other cited texts for more depth and other perspectives. More to the point of
the central theme of this textbook, the review article by Dellnitz and Junge [87] and then
later the Ph.D. thesis by Padberg [247] (advised by Dellnitz) both give excellent presen-
tations of a more computationally based perspective of measurable dynamical systems in
common with the present text, and we highly recommend them. A summary of the German
school’s approach to the empirical study of dynamical systems can be found in [112], and
[82]. Also, we recommend the review by Froyland [121]. Finally, we highly recommend
the book by Hsu [167], and see also [166], which is an early and less often cited work in
the current literature, as we rarely see “cell-to-cell mappings” cited lately. While lacking
the transfer oriented formalism behind the analysis, this cell-to-cell mapping paradigm is
clearly a precursor to the computational methods which are now commonly called set ori-
ented methods. Also, we include a discussion and contrast to the early ideas by Ulam [307]
Preface xiii
Downloaded 02/08/23 to 155.210.84.108 . Redistribution subject to SIAM license or copyright; see https://epubs.siam.org/terms-privacy
called the Ulam method. Here we hope to give a useful broad presentation in a manner that
includes some necessary background to allow a sophisticated but otherwise not specialized
student or researcher to dive into this topic.
Acknowledgments. Erik Bollt would like to thank the several students and col-
leagues for discussions and cooperation that have greatly influenced the evolution of his
perspective on these topics over several years, and who have made this work so much more
enjoyable as a shared activity. He would also like to thank the National Science Founda-
tion and the Office of Naval Research and the Army Research Office, who have supported
several aspects of this work over the recent decade.
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Chapter 1
Dynamical Systems,
Ensembles, and Transfer
Operators
1
2 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
discuss
• exploring global dynamics and characterization of the global attractors,
• estimating invariant manifolds,
• partitioning the phase space into invariant regions, almost invariant regions, and co-
herent sets,
• rates of transport between these partitioned regions,
• decay of correlation,
• associated information theoretic descriptions.
As we will discuss throughout this book, the question of transport can be boiled
down to a question of walks in graphs, stochastic matrices, Markov chains, graph parti-
tioning questions, and matrix analysis, together with Galerkin’s methods for discussing
the approximation. We leave this section with a picture in Fig. 1.1, which in some sense
highlights so many of the techniques in the book. We will refer back to this figure often
throughout this text. For now, we just note that the figure is an approximation of the ac-
tion on the phase space of a Henon mapping as the action of a directed graph. The Henon
mapping,
for parameter values a = 1.4, b = 0.3, is frequently used as a research tool and as a ped-
agogical example of a smooth chaotic mapping in the plane. It is a diffeomorphism that
highlights many issues of chaos and chaotic attractors in more than one dimension. Such
mappings are not only interesting in their own right, but they also offer a step toward un-
derstanding differential equations by Poincaré section mappings.
and partly for historical reasons. In Fig. 1.2 we see the mapping and the time series it
produces for a specific initial condition, x 0 = 0.4, where a time series is simply the function
of the output values with respect to time. An orbit is a sequence starting at a single initial
4 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Figure 1.2. The logistic map (left) produces a time series (right) shown for a given
initial condition x 0 = 0.4.
condition,
{x 0 , x 1 , x 2 , x 3 . . .} = {x 0 , L(x 0 ), L 2 (x 0 ), L 3 (x 0 ), . . .}, (1.3)
where
In this case, the orbit from x 0 = 0.4 is the sequence {x 0 , x 1 , x 2 , . . .} = {0.4, 0.96, 0.1536, . . .}.
The time series perspective illustrates the trajectory of a single initial condition in time,
which as an orbit runs “forever” and we are simply inspecting a finite segment. In this
perspective, we ask how a single initial state evolves. Perhaps there is a limit point? Perhaps
there is a stable periodic orbit? Perhaps the orbit is unbounded? Or perhaps the orbit is
chaotic?
At this stage it is useful to give some definition of a dynamical system. A math-
ematically detailed definition of a dynamical system is given in Chapter 2 in Definitions
2.1–2.3. Said plainly for now, a dynamical system is
1. a state space (phase space), usually a manifold, together with
2. a notion of time, and
3. an evolution rule (often a continuous evolution rule) that brings forward states to new
states as time progresses.
Generally, dynamical systems can be considered of two general types, continuous time as
in flows (or semiflows) usually from differential equations, and discrete time mappings.
For instance, the mapping x n+1 = L(x n ) in Example 1.1, Eq. (1.2), is a discrete time map,
L : [0, 1] → [0, 1]. In this case, (1) the state space is the unit interval, [0, 1], (2) time is taken
to be the iteration number and it is discrete, and (3) the mapping L(x n ) = 4x n (1 − x n ) is the
evolution rule which assigns new values to the old values. The phrase dynamical system is
usually reserved to mean that the evolution rule is deterministic, meaning the same input
1.2. The Ensemble Perspective 5
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
will always yield the same output in a function mapping–type relationship, whereas the
phrase stochastic dynamical system can be used to denote those systems with some kind
of randomness in the behavior. Each of these will be discussed in subsequent chapters.
Another perspective we pursue will be to ask what happens to the evolution of many
different initial conditions, the so-called ensemble of initial conditions. To illustrate this
idea, we provide the following example.
Example 1.2 (following an ensemble of initial conditions in the logistic map). Imagine
that instead of following one initial condition, we choose N initial conditions, {x 0i }i=1,...,N
(let N = 106, a million, for the sake of specificity). Choosing those initial conditions by
a random number generator, approximating uniform, U (0, 1), we follow each one. Now
it would not be reasonable to plot a time series for all million states. The corresponding
plot to Fig. 1.2 (right) would be too busy; we would only see a solid band. Instead, we
accumulate the information as a histogram, an empirical representation of the probabil-
ity density function. A histogram of N uniformly chosen initial conditions is shown in
Fig. 1.4 (left). Iterating each one of the initial conditions under the logistic map yields
{x 1i }i=1,...,N = {L(x 0i )}i=1,...,N and so forth, through each iteration. Due to the very large
number of data points, we can only reasonably view the data statistically, as histograms, the
profile of each evolving upon each successive iteration, as shown in the successive panels
of Fig. 1.3.
4 4
x 10 x 10
1200 3.5 2.5
3
1000
2
2.5
800
1.5
2
count
count
count
600
1.5
1
400
1
0.5
200
0.5
0 0 0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
x x x
Figure 1.3. Histograms depicting the evolution of many (N = 106) initial condi-
tions under the logistic map. (Left) Initially, {x 0i }i=1,...,N are chosen uniformly by U (0, 1)
in this experiment. (Middle) After one iterate, each initial condition x 0i moves to its iterate,
x 1i = L(x 0i ), and the full histogram, {x 1i }i=1,...,N is shown. (Right) The histogram of the
second iterate, {x 1i }i=1,...,N is shown.
There are central tenants of ergodic theory to be found in this example. The property
of ergodic is defined explicitly in Sections 3.5 and 3.5.1, but a main tenant is highlighted
by the Birkhoff theorem describing coincidence of time averages and space averages (see
Eq. (1.5)). Two major questions that may be asked of this example are
1. Will the profile of the histogram settle down to some form, or will it change forever?
2. Does the initial condition play a role, and, in particular, how does the specific initial
condition play a role in the answer to question 1?
It is not always true that a dynamical system will have a long-term steady state distribution,
as approximated by the histogram; the specific dynamical system is relevant, and for many
6 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
4 4 4
x 10 x 10 x 10
2.5 2.5 2.5
2 2 2
count
count
count
1 1 1
0 0 0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
x x x
dynamical systems, but not all, the initial condition may be relevant. When there is a steady
state distribution, loosely said, we will discuss the issue of natural measure, which is a sort
of stable ergodic invariant measure [171]. By invariant measure, we mean that the ensemble
of orbits may each move individually, but in such a way that their distribution nonetheless
remains the same.
More generally, there is the notion of an invariant measure (see Definition 3.4),
where invariant measure and ergodic invariant measure are discussed further in Sections 3.5
and 3.5.1. A transformation which has an invariant measure μ need not be ergodic, which
is another way of saying it favors just part of the phase space, or it may even be supported
on just part of the phase space. By contrast, the density2 as illustrated here by the his-
togram shown covers the whole of [0, 1], suggesting at least by empirical inspection3 that
the invariant density is absolutely continuous.4
Perhaps the greatest application of an ergodic invariant measure follows Birkhoff’s
ergodic theorem. Stated roughly, with respect to an ergodic T-invariant measure μ on a
measurable space (X, A), where A is the sigma algebra of measurable sets, time averages
and spatial averages may be exchanged,
1
n
lim f ◦ T i (x 0) = f (x)dμ(x), (1.5)
n→∞ n X
i=1
for μ-almost every initial condition. This is evidenced in that a long orbit segment of a
6
single initial condition {x j }10
j =1 yields essentially the same result as the long-term ensemble,
as seen in Fig. 1.3.
2 We will often speak of measure and density interchangeably. In fact they are dual. This is best un-
derstood when there is a Radon–Nikodým derivative [190], in the case of a positive absolutely contin-
uous measure-μ,
= g(x)d x. g is the density function when it exists, which expression denotes,
dμ(x)
μ(B) = B dμ(x) = B g(x)d x. In the case the measurable functions are cells of a histogram’s partition, this
is descriptive of the histogram. In the case of continuous functions g this reminds us of the fundamental
theorem of calculus.
3 The result does in fact hold by arguments that the invariant measure is absolutely continuous to Lebesgue
measure, which will not be presented here [50].
4 A positive measure μ(x) is called absolutely continuous when it has a Radon–Nikodým derivative
preimage [190] to Lebesgue measure dμ(x) = g(x)d x.
1.2. The Ensemble Perspective 7
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Example 1.3 (Birkhoff ergodic theorem and histograms). The statement that a his-
togram reveals the invariant measure for almost all initial conditions can be sharpened by
choosing the measurable function f in Eq. (1.5), as the characteristic (indicator) functions:
1 if x ∈ Bi
f (x) = χ Bi (x) = . (1.6)
0 else
n
n
f ◦ T j (x) = χ Bi (x j ). (1.7)
j =1 j =1
Also, Eq. (1.5) promises that we will almost never choose a bad initial condition but still
converge toward the same occupancy for cell B j . Likewise, repeating for each cell in the
partition produces a histogram such as in Fig. 1.3.
Example 1.4 (what can Birkhoff’s ergodic theorem say about Lyapunov exponents?).
In Chapter 8, we will discuss finite time Lyapunov exponents (FTLEs), which in brief are
related to derivatives averaged along finite orbit segments but multiplicatively, and how
the results vary depending on where in the phase space the initial condition is chosen, the
time length of the orbit segment, and how this information relates to transport. This is
in dramatic contrast to the traditional definition of Lyapunov exponents, which are almost
the same quantity, but averaged along an infinite orbit. In other words, if we choose a
measuring function
f (x) = ln |T (x)|, 5 (1.8)
then μ-almost every initial condition again will give the same result. Perhaps this “usual”
way of thinking of orbits as infinitely long, and Lyapunov exponents as limit averages with
the Birkhoff theorem stating that almost every starting point is the same, prevented the dis-
covery of the brilliant-for-its-simplicity but powerful idea of FTLEs, which are intrinsically
spatially dependent due to the finite time aspect.
To state more clearly the question of how important the initial condition is, in brief
the answer is almost not at all. In this sense, almost every initial condition stated in the
measure theoretic sense is “typical.” This means that with probability one we will choose
an initial condition which will behave as the ergodic case. To put the statement of this rarity
in perspective, in the same sense we may say that if we choose a number randomly from the
unit interval, with probability zero the number will be rational, and with probability one the
number will be irrational. Of course this does not mean it is impossible to choose a rational
number, just that the Lebesgue measure of the rationals is zero. By contrast, the situation
is opposite when performing the random selection on a computer. The number will always
be rational because (1) the random number generator is just a model of the uniform random
5 We are specializing to a one-dimensional setting so that we do not need to discuss issues related to the
Jacobian derivative matrices and diagonalizability at this early part of the book. In this case the Birkhoff
theorem describes the Lyapunov exponents as discussed here. The more general scenario in more than one
dimension requires Oseledets multiplicative ergodic theorem to handle products along orbits, as discussed
in Section 8.2, in contrast to the one-dimensional scenario in Section 8.1.
8 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
according to some new density ρ1 (x), then the problem becomes one of finding ρ1 (x) given
ρ0 (x). Likewise, we can look for the orbit of distributions,
{ρ0 (x), ρ1(x), ρ2 (x), . . .}. (1.11)
From the principle conservation of initial conditions follows a discrete continuity
equation,
ρ1 (x)d x = ρ0 (x)d x ∀B ∈ A, (1.12)
B f −1 (B)
from which will follow the dynamical system,
Pf : L 1 (X) → L 1 (X),
ρ0 (x) → ρ1 (x) = Pf [ρ0 ](x), (1.13)
6 A dynamical system is defined to be chaotic if it displays sensitive dependence to initial conditions and
a dense orbit [95, 12, 314, 213]. Or, according to [2], an orbit is chaotic if it is bounded, not asymptotically
periodic, and has a positive Lyapunov exponent.
7 A dynamical system T : X → X is linear if for any x , x ∈ X , and a, b ∈ R, T (ax + bx ) = aT (x ) +
1 2 1 2 1
bT (x2 ); otherwise the dynamical system is nonlinear.
8 More precisely, we wish that absolutely continuous densities map to absolutely continuous densities.
1.3. Evolution of Ensembles 9
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
and the assignment of a new density by the operator Pf is interpreted at each point x.
This continuity equation may be interpreted as follows. Formally, over a measure space
(X, A, μ), B ∈ A is any one of the measurable subsets. For simplicity of discussion, we
may interpret the B’s to be any one or collection of the cells used in describing the his-
tograms such as shown in Figs. 1.3 or 1.8. Then ρ0 (x) is an initial density descriptive of an
ensemble, such as the approximation depicted in Fig. 1.4 (left). When asking where each
of the initial conditions goes under the action of f , we are better suited to ask where orbits
distributed by ρ1 came from after one iteration of f . The preimage version Eq. (1.12) and
ρ1 (x )d x = ρ0 (x )d x
(1.14)
f (B) B
would give the same result as Eq. (1.13) if the mapping were piecewise smooth and one-
one, but many examples, including the logistic map, are not one-one, as shown in Fig. 1.5.
The continuity equation Eq. (1.12) is well stated for any measure space, (X, A, μ),
but assuming that X is an interval X = [a, b] and μ is Lebesgue measure, then we may
write x
Pf ρ(x )d x = ρ(x )d x ∀x ∈ [a, b], (1.15)
a f −1 ([a,x])
thus representing those B’s which are intervals [a, x]. For a noninvertible f , f −1 denotes
the union of all the preimages. Differentiating both sides of the equation, and assuming
differentiability, then the fundamental theorem of calculus gives
d
Pf ρ(x) = ρ(x )d x ∀x ∈ [a, b]. (1.16)
d x f −1 ([a,x])
Further assuming that f is invertible and differentiable allows application of the fundamen-
tal theorem of calculus and the chain rule to the right-hand side of the equation:
f −1 (x)
d d ρ( f −1 (x))
Pf ρ(x) = ρ(x )d x = ρ( f −1 (x))
( f −1 (x)) = −1 ∀x ∈ [a, b].
dx f −1 (a) dx | f ( f (x))|
(1.17)
However, since generally f may not be invertible, the integral derivation is applied over
each preimage, resulting in a commonly presented form of the Frobenius–Perron operator
for deterministic evolution of density in maps:
ρ(y)
Pf [ρ](x) = . (1.18)
| f (y)|
y:x= f (y)
The nature of this expression is a functional equation for the unknown density func-
tion ρ(x). Questions of the existence and uniqueness of solutions are related to the fun-
damental unique ergodicity question in ergodic theory. That is, can one find a special
distribution function that should be stated as a centrally important principle in the theory
of Frobenius–Perron operators?
An invariant density is a fixed “point” of the Frobenius–Perron operator: Functionally,
this can be stated as
ρ ∗ (x) = Pf [ρ ∗ ](x). (1.19)
10 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
One note is that we say an invariant density rather than the invariant density as there
can be many and even infinitely many. However, usually we are interested in the “domi-
nant” invariant measure, or other information related to dominant behaviors such as almost-
invariant sets. Further, is this fixed density (globally) stable? This is the critical question:
will general (most or all?) ensemble distributions settle to some unique density profile?
ρi (x) → ρ ∗ (x) as n → ∞? In the following example, we offer a geometric interpreta-
tion of the form of the Frobenius–Perron operator and its relationship to unique ergodicity.
More on this principle can be found discussed in Section 3.4.
Example 1.5 (Frobenius–Perron operator of the logistic map). The (usually two) preim-
age(s) of the logistic map in (1.2) at each point may be written as
√
−1 1± 1−x
L ± (x) = . (1.20)
2
Therefore, the Frobenius–Perron operator in (1.18) specializes to
√ √
1 1− 1−x 1+ 1−x
Pf [ρ](x) = √ ρ +ρ . (1.21)
4 1−x 2 2
This functional equation can be interpreted pictorially, as in Fig. 1.5; the collective ensem-
ble at cell B comes from those initial conditions at the two preimages f ±−1 (B) shown. The
preimage of the set may as shown in the cobweb diagram, scaled roughly as the inverse of
the derivative at the preimages. Roughly, the scaling occurs almost as if we were watch-
ing ray optics, where the preimages f −1 (B) focus on B through mirrors by the action of
the map, placed at B by the map, but scaled as if focused by the inverse of the derivative
because the ensemble of initial conditions at f −1 (B) shuttles into B.
It is a simple matter of substitution, and therefore application of trigonometric iden-
tities, to check that the function
1
ρ(x) = √ (1.22)
π x(1 − x)
is a fixed point of the operator in (1.21). This guess and check method is a valid way for
validating an invariant density. However, how does one make the guess? Comparison of the
experimental numerical histograms validate this density, comparing Eq. (1.22) to Figs. 1.3
and 1.4. By comparison to a simpler system, where the invariant density is easy to guess,
the invariant density of this logistic map is straightforward to derive.
Example 1.6 (Frobenius–Perron operator of the tent map). The tent map serves as a
simple example to derive invariant density and for comparison to the logistic map.
1
x n+1 = T (x n ) = 2 1 − 2 x − (1.23)
2
may also be viewed as a dynamical system on the unit interval, T : [0, 1] → [0, 1], shown
in Fig. 1.6 (left), and a “typical” time series is shown in Fig. 1.6 (middle). Repeating
the experiment of the evolution of an ensemble of initial conditions as was done for the
logistic map, Figs. 1.3 and 1.4, yields the histogram in Fig. 1.6 (right). Apparently from the
empirical experiment, the uniform density, U (0, 1), is invariant. This is straightforward to
validate analytically by checking that the Frobenius–Perron operator, Eq. (1.18), specializes
to
1 x x
PT [ν](x) = ν +ν 1− . (1.24)
4 4 4
Further, invariance (1.19) has a solution:
ν(x) = 1. (1.25)
Figure 1.6. The tent map (left), (3.56), a sample time series (middle), and a
histogram of a sample ensemble (right). This figure mirrors Fig. 1.3 shown for the logistic
map. Apparently here, the tent map suggests an invariant density which is uniform, U (0, 1).
12 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
The well-known change of variables between the dynamics of the fully developed
chaotic9 tent map (slope a = 2) and the fully developed logistic map (r = 4) is through the
change of variables
1
h(x) = (1 − cos(π x)), (1.26)
2
which is formally an example of a conjugacy in dynamical systems.
The fundamental equivalence relationship in the field of dynamical system, compar-
ing two dynamical systems, g1 : X → X and g2 : Y → Y , is a conjugacy.
Definition 1.1 (conjugacy). Two dynamical systems,
g1 : X → X and g2 : Y → Y , (1.27)
h : X → Y, (1.28)
a homeomorphism is that the two dynamical systems should take place in topologically
equivalent phase spaces. Further, solutions should correspond to solutions with the same
behavior in a continuous manner, and this is further covered by the pointwise commut-
ing principle h ◦ g1(x) = g2 ◦ h(x). By contrast, for example, without requiring that h is
one-one, two solutions may come from one, and so forth.
Returning to comparing the logistic and the tent maps, it can be checked that the
function
1
h(x) = (1 − cos(π x)), (1.31)
2
shown in Fig. 1.7 (upper right), is a conjugacy between g1 as the logistic map of Eq. (1.2),
(with the parameter value 4) and g2 as the tent map (3.56) (with parameter value 2), with
X = Y = [0, 1].
A graphical way to represent that commuter function (a function simply satisfying
Eq. (1.30) whether or not that function may be a homeomorphism [292]) is by what we call
a quadweb diagram, as illustrated in Fig. 1.7. A quadweb is a direct and pointwise graphi-
cal representation of the commuting diagram. In [292], we discuss further how representing
the commuting equation even when two systems may not be conjugate (and therefore the
commuter function is not a homeomorphism) has interesting relevance to relating dynam-
ical systems. Here we will simply note that the quadweb illustrates that a conjugacy is a
H : R2 → R2 . (1.34)
ρ : R2 → R+ . (1.35)
In Fig. 1.1 we illustrated both the chaotic attractor as well as the action of this mapping,
which is approximately a directed graph. The resulting invariant density, of a long time
10 This is equation in the simplest problems is called “u-change of variables” in elementary calculus books,
but is a form of the Radon–Nikodým derivative theorem in more general settings [190].
1.3. Useful Representations and Density of an ODE 15
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Figure 1.8. Henon map histogram approximating the invariant density. Notice
the irregular nature typical of the densities of such chaotic attractors, which are often
suspected of not being absolutely continuous.
This equation in its most basic physical realization describes the situation of a massless ball
bearing rolling in a double-welled potential,
1
P(x) = −x 2 + x 4 , (1.37)
4
16 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Figure 1.9. Duffing double-well potential, Eq. (1.37), corresponding to the Duff-
ing oscillator (a = 0 case). Unforced, the gradient flow can be illustrated as a massless
ball bearing in the double well as shown. Further forcing with a sinusoidal term can be
thought of as a ball bearing moving in the well, but the floor is oscillating, causing the ball
to sometimes jump from one of the two wells to the other.
which is then sinusoidally forced, as depicted in Fig. 1.9.11 This is a standard differential
equation in the pedagogy of dynamical systems. We use this problem as an example to
present the various presentations in representing the dynamics of a flow, including
• time series, Fig. 1.10,
• phase portrait, Fig. 1.11,
• Poincaré map, Figs. 1.12 and 1.13,
• attractor, also seen in Fig. 1.12,
• invariant density, Fig. 1.14.
Written in a convenient form as a system of first-order equations, with the substitution
y ≡ ẋ, (1.38)
ẋ = y,
ẏ = −ay − x − x 3 + b cosωt. (1.39)
As a time series of measured position x(t) and velocity y(t) of these equations,
with a = 0.02, b = 3, and ω = 1, we observe a signature chaotic oscillation as seen in
Fig. 1.10. This time series of an apparently erratic oscillation nonetheless comes from the
11 The gradient system case, where the autonomous part can be written − ∂ P , occurs when the viscous
∂x
friction part is zero, a = 0.
12 An autonomous differential equation can be written ẋ = F(x) without explicitly including t in the right-
hand side of the equation, and otherwise the differential equation is nonautonomous when it must be written
ẋ = f (x, t).
1.4. Useful Representations and Density of an ODE 17
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Figure 1.10. A Duffing oscillator can give rise to a chaotic time series, shown
here for both x(t) and y(t) solutions from Eq. (1.39), with a = 0.02, b = 3, and ω = 1.
deterministic evolution of the ODE (1.36). This is simply a plot of the variables x or y as a
function of time t.
A phase portrait in phase space, however, suppresses the time variable. Instead,
the t serves as a parameter which for representation of a solution curve in parametric form
(x(t), y(t)) ∈ R2 is seen in Fig. 1.11.
Augmenting with an extra time variable, τ (t) = t, from which dτdt = τ̇ = 1 gives the
autonomous three-dimensional equations of this flow:
ẋ = y,
ẏ = −ay − x − x 3 + b sin ωτ ,
τ̇ = 1. (1.40)
This form of the dynamical system allows us to represent solutions in a phase space,
(x(t), y(t), τ (t)) ∈ R3 , for each t. In this representation, the time variable is not suppressed
as we view the solution curves, (x(t), y(t), τ (t)). Thus generally one can represent a nonau-
tonomous differential equation as an autonomous differential equation by embedding in
larger phase space.
A convenient way to study topological and measurable properties of the dynamical
system presented by a flow is to produce a discrete time mapping by the Poincaré section
method to produce a Poincaré mapping. That is, a codimension-1 “surface” is placed
transverse to the flow so that (almost every) solution will pierce it, and then rather than
18 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
recording every point on the flow, it is sufficient to record the values at the instants of
piercing.
In the case of the Duffing oscillator, a suitable Poincaré surface is a special case called
a “stroboscopic” section, by ωτ = 2πk for k ∈ Z. The brilliance of Poincaré’s trick allows
the ordered discrete values (x(tk ), y(tk )), tk = 2 πk
ω , or rather we simply write (x k , yk ), to
represent the flow on its attractor. In this manner, Fig. 1.12 replaces Fig. 1.11, and in many
ways this representation as a discrete time mapping,
is easier to analyze, or at least there exists a great many new tools otherwise not available
to the ODE perspective alone. For the sake of classification, when the right-hand side of
the differential equation is in the form of an autonomous vector field, as we represented in
the case of Eq. (1.40), we write specifically
G : R3 → R3 ,
G(x, y, τ ) = y, −ay − x − x 3 + b, 1. (1.42)
If the vector field G is Lipschitz,13,14 then it is known that there is continuous de-
pendence both with respect to initial conditions and with respect to parameters as proven
through Gronwall’s inequality [164, 251]. It follows that the Poincaré mapping F in
Eq. (1.41) must be a continuous function in two dimensions, F : R2 → R2 , corresponding
to a two-dimensional dynamical system in its own right. If, further, G ∈ C 2 (R3 ), then F is
a diffeomorphism which brings with it a great many tools from the field of differentiable
dynamical systems, such as transport study by stable and unstable manifold analysis.
13 G : Rn → Rn is Lipschitz in a region ⊂ Rn if there exists a constant L > 0, G(z)− G(z̃) ≤ Lz − z̃
for all z, z̃ ∈ ; the Lipschitz property can be considered as a form of stronger continuity (often called
Lipschitz continuity) but not quite as strong as differentiability, which allows for the difference quotient
limit z → z̃ to maintain the constant L.
14 Perhaps the most standard existence and uniqueness theorem used in ODE theory is the Picard–
Lindelöf theorem: an initial value problem ż = G(t, z), z(t0 ) = z 0 has a unique solution z(t) at least for
time t ∈ [t0 − , t0 + ] for some time range > 0 if G is Lipschitz in z and continuous in t in an open neigh-
borhood containing
(t0 , z(t0 )). The standard proof relies on Picard iteration of an integral form of the ODE,
z(t) = z(t0 ) = tt G(s, z(s))ds, which with the Lipschitz condition can be proven to converge in a Banach
0
space by the contraction mapping theorem [251]. Existence and uniqueness is a critical starting condition
to discuss an ODE as a dynamical system, meaning one initial condition does indeed lead to one outcome
which continues (at least for awhile), and correspondingly often the analysis herein may be as a discrete time
mapping by Poincaré section.
20 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Figure 1.13. The Poincaré mapping shown in Fig. 1.12 are surfaces =
{(x, y, τ ) : (x, τ ) ∈ R2 , τ ∈ 2πk
ω } caricatured as the flow from Eq. (1.39), with a = 0.02,
b = 3, and ω = 1, pierces the surfaces.
In fact, the Duffing oscillator is an excellent example for presentation of the Poincaré
mapping method. There exists a two-dimensional Duffing mapping—in this case a diffeo-
morphism. Such is common with differential equations arising from physical and espe-
cially mechanical problems. All this said, the common scenario is that we cannot explicitly
represent the function F : R2 → R2 . In Fig. 1.12 we show the attractor corresponding to
the Duffing oscillator on the left, and a caricature of the stroboscopic method whose flight
produces F on the right. In practice, a computer is required for all examples we have expe-
rienced to numerically integrate chaotic differential equations, and thus further to estimate
the mapping F and a finite number of sample points.
Just as in the case of the logistic map, where a histogram as in Figs. 1.3, 1.4, and
1.6 gives further information regarding the long-term fate of ensembles of initial con-
1.4. Useful Representations and Density of an ODE 21
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
ditions, we can make the same study in the case of differential equations by using the
Poincaré mapping representation. The question is the same, but posed in terms of the
Poincaré mapping. How do ensembles of initial conditions evolve under the discrete map-
ping, (x k+1 , yk+1 ) = F(x k , yk ), as represented by a histogram over R2 ? See Fig. 1.14. The
result of an experiment of a numerical simulation of one initial condition is expected to
represent the same fate of many samples, for almost all initial conditions. That is true if
one believes the system is ergodic, and thus follows the Birkhoff ergodic theorem (1.5).
See also the discussion regarding natural measure near Eq. (3.78). The idea is that the
same long-term averages sampled in the histogram boxes are almost always the same with
respect to choosing initial conditions. Making these statements of ergodicity into mathe-
matically rigorous statements turns out to be notoriously difficult even for the most famous
chaotic attractors from the most favored differential equations from physics and mathemat-
ics. This mathematical intricacy is certainly beyond the scope of this book and we refer to
Lai-Sang Young for a good starting point [323]. This is true despite the apparent ease with
which we can simulate and seemingly confirm ergodicity of a map or differential equation
through computer simulations. Related questions include existence of a natural measure,
presence of uniform hyperbolicity, and representation by symbolic dynamics, to name a
few.
In subsequent chapters, we will present the theory of transfer operator methods to
interpret invariant density, mechanism, and almost invariant sets leading to steady states,
almost steady states, and coherent structures partitioning the phase space. Further, we will
show how the action of the mapping by a transfer operator may be approximated by a
22 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Figure 1.15. The attractor of the Duffing oscillator flow in its phase space
(x(t), y(t)) has relative density approximated by a histogram. Contrasts to the Poincaré
mapping presentation of the same orbit segments are shown in Fig. 1.14.
graph action generated by a stochastic matrix, through the now classic Ulam method, and
how graph partitioning methods approximate and can be pulled back to present relevant
structures in the phase space of the dynamical system.
Finally in this section for sake of contrast, we may consider the histogram resulting
directly from following a single orbit of the flow as shown in the phase space but without
resorting to the Poincaré mapping. That is, it is the approximation of relative density from
the invariant measure of the attractor of the flow in the phase space. See Figure 1.15. This
is in contrast to the density of the more commonly used and perhaps more useful Poincaré
mapping as shown in Fig. 1.14. As was seen for the Henon map in Fig. 1.1, considering
the action of the mapping on a discrete grid leads to a directed graph approximation of
the action of the map. We will see that this action becomes a discrete approximation of
the Frobenius–Perron operator, and as such it will serve as a useful computational tool.
The convergence with respect to refinement we call the Ulam–Galerkin method and will be
discussed in subsequent chapters. Also a major topic of this book will be the many algorith-
mic uses for this presentation as a method for transport analysis. There are a great number
of computational methods that we will see become available when considering these di-
rected graph structures. We will be discussing these methods, as well as the corresponding
questions of convergence and representation, in subsequent chapters.
A major strength of this computational perspective for global analysis is the pos-
sibility to analyze systems known empirically only through data. As a case study and an
important application [36], consider the spreading of oil following the 2010 Gulf of Mexico
1.4. Useful Representations and Density of an ODE 23
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Deepwater Horizon oil spill disaster. On April 20, 2010, an oil well cap explosion below
the Deepwater Horizon, an offshore oil rig in the Gulf of Mexico, started the worst human-
caused submarine oil spill ever. Though a historic tragedy for the marine ecosystem, the
unprecedented monitoring of the spill in real time by satellites and increased modeling of
the natural oceanic flows has provided a wealth of data, allowing analysis of the flow dy-
namics governing the spread of the oil. In [36] we studied two computational analyses de-
scribing the mixing, mass transport, and flow dynamics related to oil dispersion in the Gulf
of Mexico over the first 100 days of the spill. Transfer operator methods were used to de-
termine the spatial partitioning of regions of homogeneous dynamics into almost-invariant
sets, and FTLEs were used to compute pseudobarriers to the mixing of the oil between
these regions. The two methods give complementary results, which we will give in sub-
sequent chapters. As we will present from several different perspectives, these data make
a useful presentation for generating a comprehensive description of the oil flow dynamics
over time, and for discussing the utility of many of the methods described herein.
Basic questions in oceanic systems concern large-scale and local flow dynamics
which naturally partition the seascape into distinct regions. Following the initial explo-
sion beneath the Deepwater Horizon drilling rig on April 20, 2010, oil continued to spill
into the Gulf of Mexico from the resulting fissure in the well head on the sea floor. Spill
rates have been estimated at 53,000 barrels per day by the time the leak was controlled by
the “cap” fix three months later. It is estimated that approximately 4.9 million barrels, or
185 million gallons, of crude oil flowed into the Gulf of Mexico, making it the largest ever
submarine oil spill. The regional damage to marine ecology was extensive, but impacts
were seen on much larger scales as well, as some oil seeped into the Gulf Stream, which
transported the oil around Florida and into the Atlantic Ocean. Initially, the amount of
oil that would disperse into the Atlantic was overestimated, because a prominent dynam-
ical structure arose in the Gulf early in the summer preventing oil from entering the Gulf
Stream. The importance of computational tools for analyzing the transport mechanisms
governing the advective spread of the oil may therefore be considered self-evident in this
problem. Fig. 1.16. shows a satellite image of the Gulf of Mexico off the coast of Louisiana
on May 24, 2010 just over a month after the initial explosion. The oil is clearly visible in
white in the center of the image, and the spread of the oil can already be seen. During the
early days of the spill the Gulf Stream was draining oil out of the Gulf and, eventually,
into the Atlantic. This spread was substantially tempered later in the summer, due to the
development of a natural eddy in the central Gulf of Mexico, which acted as a barrier to
transport.
The form of the data is an empirical nonautonomous vector field f (x, t), x ∈ R2 , here
derived from an ocean modeling source called the HYCOM model [173]. One time shot
from May 24, 2010 is shown in Fig. 1.17. Toward transfer operator methods, in Fig. 1.18 we
illustrate time evolution of several rectangle boxes suggesting the Ulam–Galerkin method
to come in Chapter 4, and analogous to what was already shown in Figs. 1.1 and 1.19. In
practice a finer grid covering would be used rather than this coarse covering which is used
for illustrative purposes. The kind of partition result we may expect using these directed
graph representations of the Frobenius–Perron transfer operator can be seen in Fig. 1.20.
Discussion of almost-invariant sets, coherent sets, and issues related to transport and mea-
sure based partitions in dynamical systems from Markov models are discussed in detail
in Chapter 5. For now we can say that the prime direction leading to this computational
avenue is asking three simple questions:
24 Chapter 1. Dynamical Systems, Ensembles, and Transfer Operators
Downloaded 12/05/13 to 134.99.128.41. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php
Figure 1.16. Satellite view of the Gulf of Mexico near Louisiana during the oil
spill disaster, May 24, 2010. The oil slick spread is clearly visible and large. The image,
taken by NASA’s Terra satellite, is in the public domain.
• Where does the product (oil) go, at least in relatively short time scales?
• Where does the product not go, at least in relatively short time scales?
• Are there regions which stay together and barriers to transport between regions?
These are questions of transport and of partition of the space relative to which transport
can be discussed. Also related to partition is the boundary of partition for which there is a
complementary method that has become useful. The theory of FTLEs will be discussed in
Chapter 8, along with highlighting interpretations as barriers to transport and shortcomings
for such interpretations. See, for example, an FTLE computation for the Fig. 1.17 Gulf
of Mexico data in Fig. 1.21. In the following chapters these computations and supporting
theory will be discussed.
Exploring the Variety of Random
Documents with Different Content
common possession. The heightened glow cast by danger and death
on the faces of the young, and its fading into the rather flat daylight
of survival; the psychological dislocation of armistice; the weariness
of reconstruction; the shift in Franco-American relations that
followed President Wilson’s intervention in European affairs; and
the place of American women in the adventures of the A. E. F.”
(Preface) The three parts of the book are: The wing of death; Pax in
bello; The city of confusion.
“It is, indeed, amazing that Miss Sergeant is able to make her
meagre details of vivid interest, but such is her art that she ably
succeeds in holding attention throughout the pages of this novel
journal.” C. K. H.
“Miss Sergeant has done much more than give a vivid record of
hospital experiences. That indeed, although interesting, is the least
part of an unusual book. The figures which Miss Sergeant draws
from real life, frequently giving initials or only first names, are
extraordinarily vivid and human.”
“The book is the work of a historian at grips with reality, and has
the stamp of the best qualities of political writing.” N. C.
“The story of the voyage that six men made in an open boat across
eight hundred miles of the roughest water in the world, to bring relief
to the twenty-two companions who remained on the island, rivals the
best sea tale ever written. It is good for any one to read such a
narrative as ‘South!’ We see what men may be.”
“For each matter which Mr Shackleton has not set down, there are
a dozen that he has. Mr Shackleton is always interesting.” G. M. H.
“An old time story of youthful romance and hot adventure, well
seasoned ... with simple love and pleasant humor”—thus the author
himself correctly describes his story. In the early forties, when the
hero’s fortunes are at their lowest, an old aunt leaves him a legacy of
four old keys, a box full of small gold figures of Inca gods, an
undecipherable manuscript and the family estate with 5000 acres to
hold in trust for his wife to be. The first three items point to family
secrets all of which develop and unravel in the course of the story in
quaintly romantic fashion with underground passages and chambers
and hidden treasures. Of immediate interest to Barent, however, is to
find a wife that is to save him from a debtor’s prison. How a wealthy
land greedy neighbor of the Creighton estate offers his daughter to
fill the place; how the daughter resents the bargain; how Barent tears
up the contract when he finds he loves her and faces a variety of
troubles instead; how the tables turn and how Ronella comes to
require Barent’s help; and how the two really love each other more
than gold and acres, make a fascinating tale.
“For two years and a half a prisoner of war in Turkey, the author
devoted nearly half of that period to the writing of this work. If,
perhaps, somewhat premature as a presentment of philosophy, the
book is at all events an essay at the expression of a young man’s
‘positive assurance in the value of man as a real creator.’ Beginning
with negations, the author advances by degrees to the conclusions
that there is ‘more in life than mechanism, and more in reason than
intellect’; that intellect is ‘so formed as to grasp mechanism wholly’;
and that reason is so formed as to reflect life wholly and to find for
life a purpose which is not yet palpable, though psychologically
evident.”—Ath
“It is a tale which will really give great pleasure in the reading; but
its weak construction and the hackneyed coincidences which lie at
the back of it must prevent its ranking very high among novels of the
moment.”
[2]
SHEFFIELD, MRS ADA (ELIOT). Social case
history; its construction and content. *$1 Russell
Sage foundation 360
20–19858
The book belongs to the Social work series and deals with the
recording of the relief workers’ cases and the purposes it subserves.
The record is made with a view to three ends: (1) the immediate
purpose of furthering effective treatment of individual clients, (2) the
ultimate purpose of general social betterment, and (3) the incidental
purpose of establishing the case worker herself in critical thinking.
To expound these three ends from every point of view is the purpose
of the book. It is indexed and contains: The purpose of a social case
history; A basis for the selection of material; Documents that
constitute the history; Composition of the narrative; The narrative in
detail; The wider implications of case recording.
“It is rather long drawn out, and not straight to the point....
Anyway, the angler who can’t learn something and get many new
thrills from the book will not be found hereabouts.”
Reviewed by W. W. Willoughby
“He gives many valuable tips about hotels, boats, and railroads in
an entertaining way. His chapters on Lima and Buenos Aires are
rather long, but his chatty method of writing gives charm to the
volume.”