Numerical Continuation Methods For Dynamical Systems Path Following and Boundary Value Problems Understanding Complex Systems 1st Edition Bernd Krauskopf PDF Download
Numerical Continuation Methods For Dynamical Systems Path Following and Boundary Value Problems Understanding Complex Systems 1st Edition Bernd Krauskopf PDF Download
https://ebookgate.com/product/dynamical-inverse-problems-of-
distributed-systems-vyacheslav-i-maksimov/
ebookgate.com
https://ebookgate.com/product/green-s-functions-and-boundary-value-
problems-third-edition-ivar-stakgold/
ebookgate.com
https://ebookgate.com/product/differential-equations-with-boundary-
value-problems-2nd-edition-john-polking/
ebookgate.com
Dynamical Systems 2010th Edition Werner Krabs
https://ebookgate.com/product/dynamical-systems-2010th-edition-werner-
krabs/
ebookgate.com
https://ebookgate.com/product/formal-methods-applied-to-complex-
systems-1st-edition-jean-louis-boulanger/
ebookgate.com
https://ebookgate.com/product/applied-differential-equations-with-
boundary-value-problems-1st-edition-vladimir-a-dobrushkin/
ebookgate.com
https://ebookgate.com/product/case-studies-in-system-of-systems-
enterprise-systems-and-complex-systems-engineering-1st-edition-alex-
gorod/
ebookgate.com
https://ebookgate.com/product/software-enabled-control-information-
technology-for-dynamical-systems-1st-edition-tariq-samad/
ebookgate.com
Springer Complexity
Springer Complexity is an interdisciplinary program publishing the best research
and academic-level teaching on both fundamental and applied aspects of complex
systems – cutting across all traditional disciplines of the natural and life sciences,
engineering, economics, medicine, neuroscience, social and computer science.
Complex Systems are systems that comprise many interacting parts with the abil-
ity to generate a new quality of macroscopic collective behavior the manifestations
of which are the spontaneous formation of distinctive temporal, spatial or functional
structures. Models of such systems can be successfully mapped onto quite diverse
“real-life” situations like the climate, the coherent emission of light from lasers,
chemical reaction-diffusion systems, biological cellular networks, the dynamics of
stock markets and of the internet, earthquake statistics and prediction, freeway traf-
fic, the human brain, or the formation of opinions in social systems, to name just
some of the popular applications.
Although their scope and methodologies overlap somewhat, one can distinguish
the following main concepts and tools: self-organization, nonlinear dynamics, syn-
ergetics, turbulence, dynamical systems, catastrophes, instabilities, stochastic pro-
cesses, chaos, graphs and networks, cellular automata, adaptive systems, genetic al-
gorithms and computational intelligence.
The two major book publication platforms of the Springer Complexity program
are the monograph series “Understanding Complex Systems” focusing on the vari-
ous applications of complexity, and the “Springer Series in Synergetics”, which is
devoted to the quantitative theoretical and methodological foundations. In addition
to the books in these two core series, the program also incorporates individual titles
ranging from textbooks to major reference works.
Understanding Complex Systems
Founding Editor: J.A. Scott Kelso
Future scientific and technological developments in many fields will necessarily depend upon com-
ing to grips with complex systems. Such systems are complex in both their composition – typically
many different kinds of components interacting simultaneously and nonlinearly with each other
and their environments on multiple levels – and in the rich diversity of behavior of which they are
capable.
The Springer Series in Understanding Complex Systems series (UCS) promotes new strategies
and paradigms for understanding and realizing applications of complex systems research in a wide
variety of fields and endeavors. UCS is explicitly transdisciplinary. It has three main goals: First,
to elaborate the concepts, methods and tools of complex systems at all levels of description and in
all scientific fields, especially newly emerging areas within the life, social, behavioral, economic,
neuro- and cognitive sciences (and derivatives thereof); second, to encourage novel applications
of these ideas in various fields of engineering and computation such as robotics, nano-technology
and informatics; third, to provide a single forum within which commonalities and differences in the
workings of complex systems may be discerned, hence leading to deeper insight and understanding.
UCS will publish monographs, lecture notes and selected edited contributions aimed at commu-
nicating new findings to a large multidisciplinary audience.
Karl Friston
Institute of Cognitive Neuroscience, University College London,
London, UK
Hermann Haken
Center of Synergetics, University of Stuttgart, Stuttgart, Germany
Janusz Kacprzyk
System Research, Polish Academy of Sciences, Warsaw, Poland
Jürgen Kurths
Nonlinear Dynamics Group, University of Potsdam,
Potsdam, Germany
Linda Reichl
Center for Complex Quantum Systems, University of Texas,
Austin, USA
Peter Schuster
Theoretical Chemistry and Structural Biology, University of Vienna, Vienna, Austria
Frank Schweitzer
System Design, ETH Zurich, Zurich, Switzerland
Didier Sornette
Entrepreneurial Risk, ETH Zurich, Zurich, Switzerland
Bernd Krauskopf . Hinke M. Osinga . Jorge
Galán-Vioque (Eds.)
Numerical Continuation
Methods for Dynamical
Systems
Path following and boundary value problems
ABC
Dr. Bernd Krauskopf Dr. Hinke M. Osinga
Dept of Engineering Mathematics Dept of Engineering Mathematics
University of Bristol University of Bristol
Bristol Bristol
BS8 1TR BS8 1TR
United Kingdom United Kingdom
A C.I.P. Catalogue record for this book is available from the Library of Congress
ISSN 1860-0832
ISBN 978-1-4020-6355-8 (HB)
ISBN 978-1-4020-6356-5 (e-book)
Published by Springer,
P.O. Box 17, 3300 AA Dordrecht, The Netherlands
In association with
Canopus Publishing Limited,
27 Queen Square, Bristol BS1 4ND, UK
www.springer.com and www.canopusbooks.com
All Rights Reserved
© Canopus Publishing Limited 2007
No part of this work may be reproduced, stored in a retrieval system, or transmitted in
any form or by any means, electronic, mechanical, photocopying, microfilming, record-
ing or otherwise, without written permission from the Publisher, with the exception of
any material supplied specifically for the purpose of being entered and executed on a
computer system, for exclusive use by the purchaser of the work.
A Continuing Influence in Dynamics
a copy of the first edition of the Auto86 manual, with its authentic ochre
Caltech cover, came in very handy. We quote from the preface, dated May
1986:
The Auto package was first written in 1979. It was based on a
related program written in 1976 while the author was working with H.B
Keller at the California Institute of Technology. A first publication
referring to the package by its current name appeared in [22].
Applications often revealed some inadequacy in the algorithms and
resulted in changes. The applications also pointed to additional capa-
bilities that would be useful to have integrated in the package, and effort
was spent on making it easy to use. This explains the delay in publica-
tion of an extensive account of the algorithm implemented. Indeed, the
difference in effort between a theoretical analysis of a new method and
its implementation and integration appears to be considerable. We are
confident, however, that the methods and software presented here will
be of some use in the numerical exploration of nonlinear phenomena
in ordinary differential equations.
This quote not only highlights the intricate interplay at the very earliest stage
between the development of the software and applications, but it also contains
a major understatement: Auto has not just been “of some use”, but it has
been used by many hundreds of researchers from all around the world! To
give a rough idea of its impact in the general scientific community, ISI Web of
Knowledge reveals that the different versions of the Auto manual, which was
never published other than as a Caltech preprint, has more than 700 citations.
Similarly, the seminal reference [22] in the quote, the paper E.J. Doedel, Auto:
A program for the automatic bifurcation analysis of autonomous systems,
Cong. Num. 30 (Proc. 10th Manitoba Conf. Num. Math. and Comp.), 1981,
265–284, has more than 400 citations.
This book has been compiled on the occasion of Sebius Doedel’s 60th
birthday with the aim to illustrate the power and versatility of numerical
continuation techniques. As is demonstrated in the chapters of this book,
many recent developments build on the ideas of Sebius Doedel as implemented
in the package Auto, whose core of path following routine and collocation
boundary value problem solver is essentially still the same as when it was
released in 1986. It lies in the nature of the subject and the versatility of
Sebius Doedel’s work that we had to make a choice about which topics to
include. The emphasis of this book is on continuation methods for different
types of systems and dynamical objects, and on examples of how numerical
bifurcation analysis can be used in concrete applications. While recognizing
that there are other topics that could have been included, we believe that this
choice is in the spirit of the original motivation for the development of Auto
as expressed in the above quote. In this way, we hope to give an impression
of the continuing influence and future potential of these powerful numerical
methods for the bifurcation analysis of different types of dynamical systems.
A Continuing Influence in Dynamics VII
The book opens with an extended foreword by Herb Keller, who is widely
recognized as the founding father of numerical continuation. Chapter 1 is an
edited part of lecture notes that Sebius Doedel has been using in his own
courses. It introduces the basic concepts of numerical bifurcation analysis and
forms a basis for the remainder of the book. The other eleven chapters by
leading experts focus on selected topics that have been influenced strongly by
Sebius Doedel’s work. In fact, at least half of the chapters discuss research
in which he has been involved as a co-author. Chapter 2 by Willy Govaerts
and Yuri Kuznetsov surveys recent developments of interactive continuation
tools. Chapter 3 by Mike Henderson is concerned with higher-dimensional
continuation, and Chap. 4 by Bernd Krauskopf and Hinke Osinga discusses
the computation of invariant manifolds with a continuation approach. The
next three chapters are devoted to applications. In Chap. 5 Don Aronson and
Hans Othmer consider the dynamics of a SQUID consisting of two Josephson
junctions. Chapter 6 by Sebastian Wieczorek discusses global bifurcations
in laser systems, and Chap. 7 by Emilio Freire and Alejandro Rodrı́guez-
Luis demonstrates the use of numerical bifurcation analysis for the study of
electronic circuits. The remaining chapters deal with continuation for spe-
cial types of dynamical systems. Chapter 8 by John Guckenheimer and Drew
LaMar is concerned with slow-fast systems, and Chap. 9 by Jorge Galán-
Vioque and André Vanderbauwhede with symmetric Hamiltonian systems.
Spatially extended systems are the topic of Chap. 10 by Wolf-Jürgen Beyn
and Vera Thümmler and of Chap. 11 by Alan Champneys and Björn Sand-
stede. Finally, in Chap. 12 Dirk Roose and Róbert Szalai survey numerical
continuation techniques for systems with delay.
We are very grateful for the enthusiastic support from all who were in-
volved in this book project. First of all, we thank all authors for their con-
tributions and for making every effort to stay within the limits of a tight
production schedule. We also thank Tom Spicer of Canopus Publishing Ltd
for his support of this project from its conception to the final production of
the book. Last, but not least, we would like to thank Sebius Doedel for his
support over many years of collaboration, and for agreeing to the publication
of Chap. 1 without knowing exactly what we were up to. Happy birthday,
Sebius!
Herbert B Keller
Sebius (diminutive for Eusebius) Doedel obtained his Ph.D. in Applied Math-
ematics from the University of British Columbia in 1976. His advisor was my
friend and ex-colleague Jim Varah. As a consequence, I was able to employ
Sebius as a Research Fellow in Applied Mathematics at Caltech in 1975. Over
the next 26 years, he spent 13 of them at Caltech. However, he was also much
appreciated at Concordia University, where he was employed in 1979 and
rapidly rose to Professor of Computer Science, winning many awards which
fortunately included several years on leave with pay!
We cycled together occasionally, even in Holland, where Sebius was born.
I remember one ride in particular, when on a rather warm day we went east
from Pasadena to Claremont, about 28 miles each way. Somewhere along the
way, I became quite thirsty and so we stopped to get a cool drink. We sat
outside, relaxed and, I thought, enjoyed our drinks. I started to wax poetic
about how nice it was enjoying the outdoors and lovely California weather
when Sebius said: “Herb, do you know where we are?” I said: “sure, near
Claremont.” He replied: “This is Pomona, the drive-by shooting capital of the
world — I can’t wait to get out of here.” I have never again enjoyed going
past that part of our ride.
Early during his first appointment at Caltech, Sebius became interested
in bifurcation phenomena, two-point boundary value problems and numerical
path-following or continuation methods, perhaps as a result of sitting in on my
course in these areas. In 1976, I was writing the paper [17] in which pseudoar-
clength continuation was introduced and Sebius was willing to do some calcu-
lations to illustrate how these methods worked. Of course, he did a wonderful
job producing all of the results in §7 of that paper, but more importantly, as
a result, he essentially started working on Auto at that time. The first publi-
cation on Auto appeared in 1981 [7]. It has evolved dramatically since then,
culminating in Auto2000 [22], a fully parallel code in C++ with great graph-
ics (available for free via http://sourceforge.net/projects/auto2000/)
that was produced mainly by Randy Paffenroth, working at Caltech under
Sebius’s direction.
X Herbert B Keller
Auto is without a doubt the most powerful and efficient tool for determin-
ing the bifurcation structure of nonlinear parameter-dependent systems of al-
gebraic and ordinary differential equations. Influenced by his colleagues at the
University of British Columbia, who developed COLSYS [5], Sebius has em-
ployed orthogonal collocation approximations and mesh refinement to obtain
extremely high accuracy. The code is able to determine heteroclinic, homo-
clinic and periodic orbits, both stable and unstable, by means of a two-point
boundary value problem formulation. Using a brilliant elimination procedure,
the relatively sparse Jacobian is reduced to a low-dimensional dense matrix
from which the Floquet multipliers are computed. The bifurcation structure
at singular points is readily determined in this way.
The development of Auto is but one of the main projects that Sebius
has undertaken. In the course of this work powerful theoretical results have
been produced, many with colleagues and his students, in the general areas
of bifurcation theory, dynamical systems, periodic orbits, delay differential
equations, collocation methods for nonlinear elliptic PDEs, coupled oscillator
theory, control of bifurcation phenomena, continuation theory of manifolds,
and numerous additional topics. However, there is no doubt that the Auto
software has had a tremendous impact on many applied mathematics areas
and is, indeed, one of the leading tools in scientific computing. The code has
been incorporated into many other large software systems that solve nonlinear
problems involving continuation and bifurcation phenomena.
Essentially, all of the authors contributing to this volume have been coau-
thors with Sebius on papers related to the work presented here. However,
I would like to point out a few of my favorite contributions made through
these collaborations, not all of which have been fully appreciated yet. A bril-
liant contribution is contained in a paper by Wolf-Jürgen Beyn and Sebius
Doedel [6], in which it is shown that a continuous nonlinear boundary value
problem and the corresponding discretized problem have the same number of
solutions for all sufficiently fine meshes.
Sebius introduced a very powerful technique to keep computed families of
periodic solutions of autonomous differential equations in phase. The idea is
simply to minimize the ‘distance’ between neighboring solutions with respect
to a change in phase. That is, if u(t, λ) is the solution over the normalized
period 0 ≤ t ≤ 1 at parameter value λ, then the neighboring solution u(t, λ+δ)
with phase shift θ lies at distance
Z 1
D2 (θ) = || u(t + θ, λ + δ) − u(t, λ) ||2 dt.
0
We seek to minimize this distance with respect to the phase shift θ. Standard
calculus of variations near zero leads to the integral condition
Z 1
u̇∗ (t, λ + δ) u(t, λ) dt = 0.
0
Foreword XI
H. B. Keller
Caltech / UCSD
November, 2006
XII Herbert B Keller
References
1. J. C. Alexander, E. J. Doedel, and H. G. Othmer. On the resonance structure
in a forced excitable system. SIAM J. Appl. Math. 50(5):1373–1418, 1990.
2. D. G. Aronson, E. J. Doedel, and H. G. Othmer. An analytical and numerical
study of the bifurcations in a system of linearly-coupled oscillators. Physica D
25(1-3):20–104, 1987.
3. D. G. Aronson, E. J. Doedel, and H. G. Othmer. The dynamics of coupled
current-biased Josephson junctions. II. Internat. J. Bifur. Chaos Appl. Sci.
Engrg., 1(1): 51–66, 1991.
4. D. G. Aronson, E. J. Doedel, and D. H. Terman. A codimension-two point
associated with coupled Josephson junctions. Nonlinearity 10(5):1231–1255,
1997.
5. U. Ascher, J. Christiansen, and R. Russell. A collocation solver for mixed order
systems of boundary value problems. Math. Comp., 33(146):659–679, 1979.
6. W.-J. Beyn and E. J. Doedel. Stability and multiplicity of solutions to dis-
cretizations of nonlinear ordinary differential equations. SIAM J. Sci. Comp.,
2(1):107–120, 1981.
7. E. J. Doedel. Auto: a program for the automatic bifurcation analysis of au-
tonomous systems. Congr. Numer., 30:265–384, 1981.
8. E. J. Doedel, E. Freire, E. Gamero, and A. J Rodríguez-Luis. An analytical
and numerical study of a modified Van der Pol oscillator. J. Sound Vibration,
256(4):755–771, 2002.
9. E. J. Doedel and M. Friedman. Numerical computation of heteroclinic orbits.
Continuation techniques and bifurcation problems. J. Comput. Appl. Math.,
26(1-2):155–170, 1989.
10. E. J. Doedel, H. B. Keller, and J.-P. Kernevez. Numerical analysis and control
of bifurcation problems II: Bifurcation in infinite dimensions. Internat. J. Bifur.
Chaos Appl. Sci. Engrg., 1(4): 745–772, 1991.
11. E. J. Doedel and P. C. Leung. Numerical techniques for bifurcation problems
in delay equations. Congr. Numer., 34:225–237, 1982.
12. E. J. Doedel, R. C. Paffenroth, H. B. Keller, D. J. Dichmann, J. Galán-Vioque,
and A. Vanderbauwhede. Computation of periodic solutions of conservative
systems with applications to the 3-body problem. Internat. J. Bifur. Chaos
Appl. Sci. Engrg., 13(6): 1353–1381, 2003.
13. K. Engelborghs and E. J. Doedel. Convergence of a boundary value difference
equation for computing periodic solutions of neutral delay differential equations.
J. Differ. Equations Appl., 7(6):927–940, 2001.
14. K. Engelborghs and E. J. Doedel. Stability of piecewise polynomial collocation
for computing periodic solutions of delay differential equations. Numer. Math.,
91(4):627–648, 2002.
15. J. Galán-Vioque, F. J. Muñoz-Almaraz, E. Freire, E. J. Doedel, and A. Vander-
bauwhede. Stability and bifurcations of the figure-8 solution of the three-body
problem. Phys. Rev. Lett. 88(24):241101, 2002.
16. A. D. Jepson and H. B. Keller. Steady state and periodic solution paths: their
bifurcations and computations. In T. Kupper and H. D. Mittleman, editors,
Numerical Methods for Bifurcation Problems, pages 219–246. (Birkäuser Verlag,
1984).
Foreword XIII
Eusebius J Doedel
Numerical integrators can provide valuable insight into the transient behavior
of a dynamical system. However, when the interest is in stationary and peri-
odic solutions, their stability, and their transition to more complex behavior,
then numerical continuation and bifurcation techniques are very powerful and
efficient.
The objective of these notes is to make the reader familiar with the ideas
behind some basic numerical continuation and bifurcation techniques. This
will be useful, and is at times necessary, for the effective use of the software
Auto and other packages, such as XppAut [17], Content [24], Matcont
[21], and DDE-Biftool [16], which incorporate the same or closely related
algorithms.
These lecture notes are an edited subset of material from graduate courses
given by the author at the universities of Utah and Minnesota [9] and at
Concordia University, and from short courses given at various institutions,
including the Université Pierre et Marie Curie (Paris VI), the Centre de
Recherches Mathématiques of the Université de Montréal, the Technische
Universität Hamburg-Harburg, and the Benemérita Universidad Autónoma
de Puebla.
Let B denote a Banach space, that is, a complete, normed vector space. In
the presentation below it will be implicitly assumed that B is Rn , although
the results apply more generally. For x0 ∈ B, we denote by Sρ (x0 ) the closed
ball of radius ρ centered at x0 , that is,
xk+1 = F (xk ), k = 0, 1, 2, . . . .
Thus,
Hence xn+1 ∈ Sρ (x0 ), and by induction xk ∈ Sρ (x0 ) for all k. We now show
that {xk } is a Cauchy sequence:
1 Numerical Analysis of Nonlinear Equations 3
Then there exists δ, with 0 < δ ≤ ρ, and a unique function u(λ) that is
continuous on Sδ (λ0 ), with u(λ0 ) = u0 , such that
Proof. We use the notation G0u = Gu (u0 , λ0 ). Then we rewrite the problem
as
Hence, G(u, λ) = 0 if and only if u is a fixed point of F(·, λ). (Note that the
corresponding fixed point iteration is, in fact, the Chord Method for solving
G(u, λ) = 0.) We must verify the conditions of the Contraction Theorem.
Pick u, v ∈ Sρ1 (u0 ), and any fixed λ ∈ Sρ1 (λ0 ), where ρ1 is to be chosen
later. Then
−1 0
F(u, λ) − F(v, λ) = G0u Gu [u − v] − [G(u, λ) − G(v, λ)] . (1.1)
where in the last step we used the Mean Value Theorem to get Ĝ. Then (1.1)
becomes
|| F(u, λ) − F(v, λ) ||
≤ M || G0u − Ĝu (u, v, λ) || || u − v ||
Z 1
= M || Gu (u0 , λ0 ) − Gu (tu + (1 − t)v, λ) dt || || u − v ||
0
Z 1
≤M || Gu (u0 , λ0 ) − Gu (tu + (1 − t)v, λ) || dt || u − v ||
0
Z 1
≤M KL (|| u0 − (tu + (1 − t)v) || + || λ0 − λ ||) dt || u − v ||
0 | {z }
∈Sρ1 (u0 )
≤ M KL 2ρ1 || u − v || .
| {z }
≡K0
Therefore, if we take
1
ρ1 < ,
2M KL
then K0 < 1. The second condition of the Contraction Theorem is also satis-
fied, namely,
1 Numerical Analysis of Nonlinear Equations 5
|| F(u0 , λ) − u0 ||
= || F(u0 , λ) − F(u0 , λ0 ) ||
−1 −1
= || G0u [G0u u0 − G(u0 , λ)] − G0u [G0u u0 − G(u0 , λ0 )] ||
−1
= || G0u [G(u0 , λ0 ) − G(u0 , λ)] ||
≤ M KL || λ − λ0 ||
≤ M KL ρ,
(1 − K0 ) ρ1
ρ≤ .
M KL
Hence, for each λ ∈ Sρ (λ0 ) we have a unique solution u(λ). We now show that
u(λ) is continuous in λ. Let λ1 , λ2 ∈ Sρ (λ0 ), with corresponding solutions
u(λ1 ) and u(λ2 ). Then
|| u(λ1 ) − u(λ2 ) ||
= || F(u(λ1 ), λ1 ) − F(u(λ2 ), λ2 ) ||
≤ || F(u(λ1 ), λ1 ) − F(u(λ2 ), λ1 ) || + || F(u(λ2 ), λ1 ) − F(u(λ1 ), λ2 ) ||
≤ K0 || u(λ1 ) − u(λ2 ) || +
−1 −1
|| G0u [G0u u(λ2 ) − G(u(λ2 ), λ1 )] − G0u [G0u u(λ2 ) − G(u(λ2 ), λ2 )] ||
≤ K0 || u(λ1 ) − u(λ2 ) || +M KL || λ1 − λ2 || .
|{z}
<1
Hence,
M KL
|| u(λ1 ) − u(λ2 ) ||≤ || λ1 − λ2 ||,
1 − K0
which concludes the proof of the IFT. ⊔
⊓
So far, under mild assumptions, we have shown that there exists a locally
unique solution family u(λ). If we impose the condition that F(u, λ) is con-
tinuously differentiable in λ, then we can show that u(λ) is also continuously
differentiable. To this end, the Banach Lemma is very useful.
Lemma 1 (Banach Lemma). Let L : B → B be a linear operator with
|| L ||< 1. Then (I + L)−1 exists and
1
|| (I + L)−1 ||≤ .
1− || L ||
(I + L)(I + L)−1 = I
⇔ (I + L)−1 = I − L(I + L)−1
⇔|| (I + L)−1 || ≤ 1+ || L || || (I + L)−1 ||
1
⇔|| (I + L)−1 || ≤ .
1− || L ||
This proves the Banach Lemma. ⊔
⊓
The Banach Lemma can be used to show the following.
Lemma 2. Under the conditions of the IFT, there exists M1 > 0 and δ > 0
such that Gu (u, λ)−1 exists and || Gu (u, λ)−1 ||≤ M1 in Sδ (u0 ) × Sδ (λ0 ).
Proof. Using again the notation G0u = Gu (u0 , λ0 ), we have
Proof. Using the definition of (Fréchet) derivative, we are given that there
exists Gu (u, λ) such that G(u, λ)−G(v, λ) = Gu (u, λ) (u−v)+R1 (u, v, λ),
where R1 (u, v, λ) is such that
|| R1 (u, v, λ) ||
→ 0 as || u − v ||→ 0. (1.2)
|| u − v ||
|| R2 (u, λ, µ) ||
→ 0 as || λ − µ ||→ 0. (1.3)
|| λ − µ ||
with
|| r(λ, µ) ||
→ 0 as || λ − µ ||→ 0.
|| λ − µ ||
Now
0 = G(u(λ), λ) − G(u(µ), µ)
= G(u(λ), λ) − G(u(µ), λ) + G(u(µ), λ) − G(u(µ), µ)
= Gu (u(λ), λ) (u(λ) − u(µ)) + R1 (u(λ), u(µ), λ)
+Gλ (u(µ), λ) (λ − µ) + R2 (u(µ), λ, µ).
where
r = [Gλ (u(λ), λ) − Gλ (u(µ), λ)] (λ − µ) + R1 + R2 .
Let us, for the moment, ignore the harmless factor Gu (u(λ), λ)−1 and consider
each term of r. Since u and Gλ are continuous, we have
|| R2 (u(λ), λ, µ) ||
→ 0 as || λ − µ ||→ 0.
|| λ − µ ||
We now give some examples where the IFT is used to show that a given
solution persists, at least locally, when a problem parameter is changed. We
also identify some cases where the conditions of the IFT are not satisfied.
We can think of u1 as ‘fish’ and u2 as ‘sharks’, while the term λ(1−e−5u1 ) rep-
resents ‘fishing’, with ‘fishing-quota’ λ. When λ = 0 the stationary solutions
are
3u1 (1 − u1 ) − u1 u2 = 0
⇒ (u1 , u2 ) = (0, 0), (1, 0), ( 13 , 2).
−u2 + 3u1 u2 =0
The Jacobian matrix is
3 − 6u1 − u2 − 5λe−5u1 −u1
J= = J(u1 , u2 ; λ).
u2 −1 + 3u1
Hence, we have
1 Numerical Analysis of Nonlinear Equations 9
u1 3
5
8
4
9
1
1
2 lambda
u2
Fig. 1.1. Stationary solution branches of the predator-prey model (1.4). Solution 2
and solution 4 are branch points, while solution 8 is a Hopf bifurcation point.
3 0
J(0, 0; 0) = , eigenvalues 3, −1 (unstable);
0 −1
3 −1
J(1, 0; 0) = eigenvalues − 3, 2 (unstable);
,
0 2
(−1 − µ)(−µ) + 2 = 0 ⇔
µ2 + µ + 2 = 0 ⇔
1 −1 − 13 √
J( 3 , 2; 0) = , eigenvalues
6 0
µ± = −1±2 −7 ;
Re(µ± ) < 0 (stable).
All three Jacobians at λ = 0 are nonsingular. Thus, by the IFT, all three
stationary points persist for (small) λ 6= 0. In this problem we can explicitly
find all solutions (see Fig. 1.1):
I: (u1 , u2 ) = (0, 0).
MAX U1
0.90
0.80
15
0.70 14
0.60 12
0.50 11 13
5
0.40 4
9
0.30
8
0.20
0.10 2
1
0.00
-0.10
0.00 0.20 0.40 0.60 0.80 1.00
0.10 0.30 0.50 0.70 0.90 lambda
Fig. 1.2. Bifurcation diagram of the predator-prey model (1.4). The periodic solu-
tion branch is also shown. For stationary solutions the vertical axis is simply u1 , while
for periodic solutions max(u1 ) is plotted. Solid/dashed lines denote stable/unstable
solutions. Open squares are branch points; the solid square is a Hopf bifurcation.
Hence, the trivial solution is unstable if λ < 3/5, and stable if λ > 3/5, as
indicated in Fig. 1.2. Branch II has no stable positive solutions. At λH ≈
0.67 on Branch III (Solution 8 in Fig. 1.2) the complex eigenvalues cross
the imaginary axis. This crossing is a Hopf bifurcation. Beyond λH there are
periodic solutions whose period T increases as λ increases; see Fig. 1.3 for some
representative periodic orbits. The period becomes infinite at λ = λ∞ ≈ 0.7.
This final orbit is called a heteroclinic cycle.
From Fig. 1.2 we can deduce the solution behavior for increasing λ: Branch
III is followed until λH ; then the behavior becomes oscillatory due to the
periodic solutions of increasing period until λ = λ∞ ; finally, the dynamics
collapses to the trivial solution (Branch I).
The IFT is not only useful in the context of solution branches of equilibria.
The periodic orbits in Sect. 1.1.2 are also computed using the IFT principle.
This section gives an example of a solution branch of a two-point boundary
value problem. The Gelfand-Bratu problem [12] is defined as
′′
u (x) + λeu(x) = 0, ∀x ∈ [0, 1],
(1.5)
u(0) = u(1) = 0.
1 Numerical Analysis of Nonlinear Equations 11
U2
0.70
0.60
0.50
0.40
0.30
0.20
0.10
0.00
0.10 0.20 0.30 0.40 0.50 0.60 0.70
U1
Fig. 1.3. Some periodic solutions of the predator-prey model (1.4). The final orbits
are very close to a heteroclinic cycle.
MAX U
15.0
5
12.5
10.0
7.5
5.0
2.5
3
2
1
0.0
0.0 0.5 1.0 1.5 2.0 2.5 3.0 3.5 4.0
LAMBDA
Fig. 1.4. Bifurcation diagram of the Gelfand-Bratu equation (1.5). Note that there
are two solutions for 0 < λ < λC , where λC ≈ 3.51. There is one solution for λ = λC
and for λ ≤ 0, and are no solutions for λ > λC .
12 Eusebius J Doedel
U
15.0
12.5
5
10.0
7.5
5.0
4
3
2.5
1 2
0.0
0.00 0.20 0.40 0.60 0.80 1.00
0.10 0.30 0.50 0.70 0.90 X
The equations for column buckling (from nonlinear elasticity theory) [31] are
given by
1 Numerical Analysis of Nonlinear Equations 13
u′′1 (x) + µu1 (x) = 0,
u′3 (x) + 12 u′1 (x)2 + µβ = 0,
for x ∈ [0, 1], with
u1 (0) = u1 (1) = 0,
u3 (0) = −u3 (1) = λ (λ > 0),
is a solution for all λ. Are these solutions isolated? In the formal set-up,
consider
u′1 = u2 , u1 (0) = 0,
u′2 = −µu1 , u2 (0) = p, ⇒ u = u(x, p, µ; λ).
u′3 = − 12 u22 − µ, u3 (0) = λ.
We must have
u1 (1, p, µ; λ) = 0,
∼ F(p, µ; λ) = 0,
u3 (1, p, µ; λ) + λ = 0,
Now, if 2λ 6= k 2 π 2 , k = 1, 2, 3, . . . , then
v1′′ + 2λv1 = 0,
v1 (0) = v1 (1) = 0,
that is,
ε ′ g I
φ′′ (t) + φ (t) + sin φ(t) = .
R R mR
dφ dφ ds
Scaling time as s = c t we have φ′ = dt = ds dt = c φ̇ and, similarly, φ′′ = c2 φ̈,
we obtain
εc g I
c2 φ̈(s) + φ̇(s) + sin φ(s) = ,
R R mR
ε g I
φ̈ + φ̇ + sin φ = .
Rc Rc 2 m R c2
p
Choose c such that Rgc2 = 1, that is, c = g/R, and set ε̃ = ε/(R c) and
I˜ = I/(m R c2 ). Then the equation becomes φ̈ + ε̃ φ̇ + sin φ = I,
˜ or, dropping
the ˜, and using ′ ,
φ′′ + ε φ′ + sin φ = I. (1.7)
We shall consider special solutions, called rotations, that satisfy φ(t + T ) =
φ(t) + 2π, for all t or, equivalently,
≡0
z}|{
φ(T ) = φ(0) +2π (= 2π),
φ′ (T ) = φ′ (0),
φ′′ + sin φ = 0,
that is, (1.7) with ε = I = 0. Suppose the initial data for a rotation are
φ(0) = 0, and φ′ (0) = p > 0. We have φ(T ) = 2π, and φ′ (T ) = φ′ (0) = p.
Integration gives
R t ′ ′′ Rt
0
φ φ dt + 0 φ′ sin φ dt = 0
t
1 ′2 t
⇔ 2φ 0 − cos φ = 0
0
1 ′ 2 1 2
⇔ 2 φ (t) − cos φ(t) = p −1
2
1 ′ 2 1
⇔ φ (t) + 1 − cos φ(t) = p2 .
|2 {z } | {z } 2
kinetic energy potential energy
Thus,
dφ
p
φ′ (t) = dt = p2 − 2 + 2 cos φ(t)
dt 1
⇔ dφ =
p
2
p − 2 + 2 cos φ
Z 2π
R 2π dt 1
⇔ 0 dφ dφ = p dφ
2
p − 2 + 2 cos φ
0
Z 2π
1
⇔ T = p dφ.
0 p2 − 2 + 2 cos φ
We see that
T →0 as p → ∞,
and Z 2π
1
T → √ dφ = ∞ as p → 2.
0 2 + 2 cos φ
In fact, rotations exists for all p > 2.
φ′′ + ε φ′ + sin φ = I,
with φ(0) = 0 (which sets the phase) and φ′ (0) = p. We write the solution
as φ = φ(t; p, I, ε). Do there exist rotations, i.e., does there exist T such that
φ(T ; p, I, ε) = 2π and φ′ (T ; p, I, ε) = p?
16 Eusebius J Doedel
φ′′0 + sin φ0 = 0,
φ′′0 + ε φ′ + sin φ0 = I,
Proof. The Jacobian matrix with respect to T and I, of the algebraic system
φ(T ; p, I, ε) − 2π = 0,
φ′ (T ; p, I, ε) − p = 0,
evaluated at p = p0 , T = T0 , and I = ε = 0, is
′ 0
φ0 φI
J0 = ′ (T0 ).
φ′′0 φ0I
In particular,
′′ ′
φ0I + φ0I cos φ0 = 1, φ0I (0) = φ0I (0) = 0.
From ′′
φ0I φ′0 + φ0I cos φ0 φ′0 = φ′0 ,
and
φ′′0 + sin φ0 = 0 ⇒ φ′′′ ′
0 + cos φ0 φ0 = 0,
we have ′′
φ0I φ′0 − φ0I φ′′′ ′
0 = φ0 .
Hence,
′ 2π
φ0I (T0 ) = 6= 0.
p0
⊔
⊓
A more general analysis of this type for coupled pendula can be found in [1]
(see also Chap. 5).
G(x) = 0, G : Rn+1 → Rn .
Here, N (G0u ) denotes the null space of G0u , and R(G0u ) denotes the range of
G0u , i.e., the linear space spanned by the n columns of G0u .
18 Eusebius J Doedel
u
x0
u0
λ
λ
0
G(u, λ) = 0,
as well as the direction vector u̇0 = du/dλ, and we want to compute the
solution u1 at λ1 = λ0 + ∆λ; this is illustrated in Fig. 1.7.
To compute the solution u1 we use Newton’s method
(
(ν) (ν) (ν)
Gu (u1 , λ1 ) ∆u1 = −G(u1 , λ1 ),
(ν+1) (ν) (ν) (1.8)
u1 = u1 + ∆u1 , ν = 0, 1, 2, . . . .
"u"
u
1 du
u (= dλ
at λ0 )
u0
(0)
u1
∆λ
λ
λ0 λ1
After convergence, the new direction vector u̇1 can be computed by solving
uN −1
Then we can write the above as G(u, λ) = 0, where G : Rn × R → Rn , with
n = N − 1.
20 Eusebius J Doedel
"u"
u1
u0
( u0, λ 0 )
u0
∆s
λ0
λ
λ0 λ1
Hence, we must solve a tridiagonal system for each Newton iteration. The
solution branch has a fold where the parameter-continuation method fails; see
Figs. 1.4 and 1.5.
"X-space"
x1
x0
x
0
∆s
! (ν)
! (ν) (ν)
!
(G1u )(ν) (G1λ )(ν) ∆u1 G(u1 , λ1 )
(ν)
=− (ν) (ν)
,
u̇∗0 λ̇0 ∆λ1 (u1 − u0 )∗ u̇0 + (λ1 − λ0 ) λ̇0 − ∆s
with the new direction vector defined as
! ! !
G1u G1λ u̇1 0
= ,
u̇∗0 λ̇0 λ̇1 1
Note that
• In practice (u̇1 , λ̇1 ) can be computed with one extra back-substitution;
• The orientation of the branch is preserved if ∆s is sufficiently small;
• The direction vector must be rescaled, so that indeed || u̇1 ||2 +λ̇21 = 1.
Theorem 6. The Jacobian of the pseudo-arclength system is nonsingular at
a regular solution point.
Lγ = c,
U ∗ β = b,
δ = d − β ∗ γ.
and we can compute the solution (x, y) through the following steps:
Lf̂ = f ,
ĥ = h − β ∗ f̂ ,
y = ĥ/δ,
U x = f̂ − yγ.
= d − b∗ A−1 c,
which is nonzero by Conclusion (a) of the Bordering Lemma. ⊔
⊓
Remark 3. In pseudo-arclength continuation we have
! !
A c Gu Gλ
A= =
b∗ d u̇∗0 λ̇0 ,
that is, A = Gu , which is singular at a fold. Therefore, the bordering algorithm
will fail when it is used exactly at a fold. In practice, the method may still work.
We consider another approach, used in Auto, when discussing collocation
methods in Sect. 1.3.1.
We want to solve this boundary value problem (BVP) for u(·) and µ. In order
for this problem to be formally well posed we require that
nµ = nb + nq − n ≥ 0.
We can think of λ as the continuation parameter in which the solution (u, µ)
may be continued. A simple case is nq = 0, nb = n, for which nµ = 0.
1 Numerical Analysis of Nonlinear Equations 25
Auto solves boundary value problems using the method of orthogonal collo-
cation with piecewise polynomials [2, 7]. This method is very accurate, and
allows adaptive mesh-selection. The set-up is as follows.
First, we introduce a mesh
with
hj = tj − tj−1 , (1 ≤ j ≤ N ).
Define the space of (vector-valued) piecewise polynomials Phm as
n o
Phm = ph ∈ C[0, 1] | ph |[tj−1 ,tj ] ∈ P m ,
and such that ph satisfies the boundary and integral conditions. The collo-
cation points zj,i in each subinterval [tj−1 , tj ] are the (scaled) roots of the
mth-degree orthogonal polynomial (Gauss points); see Fig. 1.10 for a graph-
ical interpretation. Since each local polynomial is determined by (m + 1)n,
coefficients, the total number of degrees of freedom (considering λ as fixed) is
(m + 1)nN + nµ . This is matched by the total number of equations:
collocation: mnN,
continuity: (N − 1)n,
constraints: nb + nq (= n + nµ ).
If the solution u(t) of the BVP is sufficiently smooth then the order of accuracy
of the orthogonal collocation method is m, i.e.,
|| ph − u ||∞ = O(hm ).
0 1
t t t t
0 1 2 N
t j-1 tj
z j,1 z j,2 z j,3
t j-1 tj
t j-2/3 t j-1/3
lj,3(t) lj,1(t)
Fig. 1.10. The mesh {0 = t0 < t1 < · · · < tN = 1}. Collocation points and
‘extended-mesh points’ are shown for the case m = 3, in the jth mesh interval. Also
shown are two of the four local Lagrange basis polynomials.
{ℓj,i (t)}, j = 1, . . . , N, i = 0, 1, . . . , m,
by
m
Y t − tj− k
ℓj,i (t) = m
,
tj− mi − tj− k
k=0,k6=i m
where
i
tj− mi = tj −
hj .
m
The local polynomials can then be written as
m
X
pj (t) = ℓj,i (t)uj− mi .
i=0
u0 u1 u2 u1 u2 uN T λ
3 3
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • • • • • •
• • • • • •
• • • • • •
• • • • • • • • • • • • • • • • • • • • • •
• • • • • • • • • • • • • • • • • • • • • •
Fig. 1.11. Structure of the Jacobian for the case of n = 2 differential equations
with the number of mesh intervals N = 3, the number of collocation points per
mesh interval m = 3, the number of boundary conditions nb = 2, and the number
of integral constraints nq = 1. The last row corresponds to the pseudo-arclength
equation, which is not included in the nq = 1 count. From E.J. Doedel, H.B. Keller,
J.P. Kernévez, Numerical analysis and control of bifurcation problems (II): Bifurca-
tion in infinite dimensions, Internat. J. Bifur. Chaos Appl. Sci. Engrg. 1(4) (1991)
745–772 c 1991 World Scientific Publishing; reproduced with permission.
bi (u0 , uN , µ, λ) = 0, i = 1, . . . , nb ,
Preliminary Remarks.
FARRADAY’S SPECULATION.
Speculation touching Electric Conduction and the nature of Matter.
By Farraday.
Having expressed my objections to Farraday’s inferences
respecting matter, &c., I feel that justice requires that I should
submit the article which drew forth my strictures. At this time, when
electricity and matter are scrutinized with a view to understand the
analogous, but different, entities of the spirit world, the ideas of an
experimental investigator so eminently successful, must be of
interest to readers:
Light and electricity are two great and searching
investigators of the molecular structure of bodies, and it
was, while considering the probable nature of conduction
and insulation in bodies not decomposable by the
electricity to which they were subject, and the relation of
electricity to space contemplated as void of that which, by
the anatomist, is called matter, that considerations,
something like those which follow, were presented to my
mind.
If the view of the constitution of matter, already
referred to, be assumed to be correct, and I may be
allowed to speak of the particles of matter and of the
space between them (in water, or in the vapour of water,
for instance) as two different things, then space must be
taken as the only continuous part, for the particles are
considered as separated by space from each other. Space
will permeate all masses of matter in every direction like a
net, except that, in place of meshes, it will form cells,
isolating each atom from its neighbours, and itself only
being continuous.
Then take the case of a piece of shellac, a non-
conductor, and it would appear at once, from such a view
of its constitution, that space is an insulator, for if it were
a conductor, the shellac could not insulate, whatever
might be the relation as to conducting power of its
material atoms; the space would be like a fine metallic
web penetrating it in every direction, just as we may
imagine of a heap of siliceous sand having all its pores
filled with water, or as we may consider of a stick of black
wax, which, though it contains an infinity of particles of
conducting charcoal diffused through every part of it,
cannot conduct, because a non-conducting body (a resin)
intervenes and separates them one from another like the
supposed space in the lac.
Next take the case of a metal, platinum or potassium,
constituted, according to the atomic theory, in the same
manner. The metal is a conductor; but how can this be,
except space be a conductor, for it is the only continuous
part of the metal, and the atoms not only do not touch,
(by the theory,) but, as we shall see presently, must be
assumed to be a considerable way apart. Space,
therefore, must be a conductor, or else the metals could
not conduct, but would be in the situation of the black
sealing-wax referred to a little while ago.
But if space be a conductor, how then can shellac,
sulphur, &c. insulate? for space permeates them in every
direction. Or, if space be an insulator, how can a metal or
other similar body conduct?
It would seem, therefore, that in accepting the ordinary
atomic theory, space may be proved to be a non-
conductor in non-conducting bodies, and a conductor in
conducting bodies; but the reasoning ends in this, a
subversion of that theory altogether, for if space be an
insulator, it cannot exist in conducting bodies, and if it be
a conductor, it cannot exist in insulating bodies. Any
ground of reasoning which tends to such conclusions must
in itself be false.
In connection with such conclusions, we may consider
shortly what are the probabilities that present themselves
to the mind, if the extension of the atomic theory which
chemists have imagined be applied in conjunction with the
conducting powers of metals. If the specific gravity of the
metals be divided by the atomic numbers, it gives us the
number of atoms, upon the hypothesis, in equal bulks of
the metals. In the following table the first column of
figures expresses nearly the numbers of atoms in, and the
second column of figures the conducting power of, equal
volumes of the metals named:
Atoms. Conducting power.
1·00 gold 6·00
1·00 silver 4·66
1·12 lead 0·52
1·30 tin 1·00
2·20 platinum 1·04
2·27 zinc 1·80
2·87 copper 6·33
2·90 iron 1·00
ebookgate.com