DOCSLIB.ORG

Determining the D-Dimensional Symbolic Dynamics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Determining the D-Dimensional Symbolic Dynamics spatiotemporal cats or, try herding 6 cats siminos/spatiotemp, rev. 6798: last edit by Predrag Cvitanovi´c,03/08/2019 Predrag Cvitanovi´c,Boris Gutkin, Li Han, Rana Jafari, Han Liang, and Adrien K. Saremi April 1, 2019 Contents 1 Cat map7 1.1 Adler-Weiss partition of the Thom-Arnol’d cat map.......7 1.2 Adler-Weiss partition of the Percival-Vivaldi cat map......9 1.2.1 Adler-Weiss linear code partition of the phase space... 16 1.3 Perron-Frobenius operators and periodic orbits theory of cat maps 18 1.3.1 Cat map topological zeta function............. 19 1.3.2 Adler / Adler98........................ 20 1.3.3 Percival and Vivaldi / PerViv................ 21 1.3.4 Isola / Isola90......................... 22 1.3.5 Creagh / Creagh94...................... 23 1.3.6 Keating / Keating91..................... 24 1.4 Green’s function for 1-dimensional lattice............. 25 1.5 Green’s blog.............................. 28 1.6 Z2 = D1 factorization......................... 31 1.7 Any piecewise linear map has “linear code”............ 32 1.8 Cat map blog............................. 33 References.................................. 47 1.9 Examples................................ 53 exercises 61 2 Statistical mechanics applications 67 2.1 Cat map................................ 67 2.2 New example: Arnol’d cat map................... 67 2.3 Diffusion in Hamiltonian sawtooth and cat maps......... 70 References.................................. 75 3 Spatiotemporal cat 77 3.1 Elastodynamic equilibria of 2D solids............... 79 3.2 Cats’ GHJSC16blog.......................... 80 References.................................. 94 4 Ising model in 2D 97 4.1 Ihara zeta functions.......................... 101 4.1.1 Clair / Clair14......................... 101 2 CONTENTS 4.1.2 Maillard............................ 105 4.2 Zeta functions in d=2......................... 108 References.................................. 111 5 Checkerboard 117 5.1 Checkerboard model......................... 117 5.1.1 Checkerboard literature................... 118 References.................................. 119 6 Hill’s formula 120 6.1 Generating functions; action..................... 120 6.2 Homoclinic and periodic orbit actions in chaotic systems.... 122 6.3 Hill’s formula............................. 124 6.3.1 Generating function literature................ 130 6.4 Noether’s theorem.......................... 132 References.................................. 132 7 Symbolic dynamics: a glossary 135 7.1 Symbolic dynamics, inserts..................... 139 References.................................. 139 8 Han’s blog 141 8.1 Rhomboid corner partition...................... 143 8.2 Reduction to the reciprocal lattice.................. 157 8.3 Rhomboid center partition...................... 163 8.3.1 Reduction to the reciprocal lattice............. 173 8.4 Time reversal............................. 175 8.5 Reduction to the fundamental domain............... 182 8.6 Spatiotemporal cat partition..................... 185 8.7 Running blog............................. 194 References.................................. 241 9 Frequencies of Cat Map Winding Numbers 244 9.1 Introduction.............................. 244 9.2 Numbers of periodic orbits..................... 245 9.2.1 Keating’s counting of periodic points........... 246 9.3 Relative frequencies of cat map words............... 246 9.3.1 Numerical computations.................. 247 9.3.2 Entropy............................ 248 9.4 Spatiotemporal cat.......................... 249 9.4.1 Frequencies of symbols................... 250 9.4.2 Frequency of blocks of length two............. 251 9.4.3 Frequencies of [2×2] spatiotemporal domains...... 253 9.5 Summary................................ 253 References.................................. 254 6814 (predrag–6798) 3 03/08/2019 siminos/spatiotemp CONTENTS 10 Symbolic Dynamics for Coupled Cat Maps 255 10.1 Introduction.............................. 255 10.2 Arnol’d Cat Map........................... 256 10.2.1 Periodic orbits - first approach............... 257 10.2.2 Periodic orbits - second approach............. 257 10.2.3 Symbolic dynamics for 1 particle.............. 260 10.3 Coupled Cat Maps.......................... 262 10.3.1 Computation of symbols................... 262 10.3.2 Nature of our alphabet.................... 264 10.3.3 Admissibility of sequences of more than 2 symbols... 266 10.4 Future work................................ 268 References.................................. 269 11 Rana’s blog 272 References.................................. 274 12 Adrien’s blog 275 12.1 Introduction.............................. 275 12.2 Arnol’d cat map............................ 276 12.2.1 First approach......................... 276 12.2.2 2nd approach......................... 277 12.2.3 Computing periodic orbits................. 277 12.3 Coupled Cat Maps.......................... 286 12.3.1 Periodic orbits......................... 286 12.3.2 Ergodic orbits......................... 287 12.4 Adrien’s blog............................. 291 References.................................. 294 13 Spatiotemporal cat, blogged 296 References.................................. 320 03/08/2019 siminos/spatiotemp 4 6814 (predrag–6798) CONTENTS This is a project of many movable parts, so here is a guide where to blog specific topics (or where to find them) • chapter 1.9 Cat map • sect. 6.1 1-dimensional action • sect. 1.5 1-dimensional / cat map lattice Green’s functions • sect. 1.8 cat map blog • chapter3 d-dimensional spatiotemporal cat • chapter 13 Spatiotemporal cat blog • chapter 8.2 Reduction to the reciprocal lattice • sect. 3.2 Herding five cats [1] edits • chapter4 2D Ising model; Ihara and multi-dimensional zetas • chapter5 Checkerboard • chapter6 Hill’s formula • chapter7 Symbolic dynamics: a glossary • chapter8 Han’s blog • chapter 11 Rana’s blog • chapter 12 Adrien’s blog Blog fearlessly: this is your own lab-book, a chronology of your learning and research that you might find invaluable years hence. 6814 (predrag–6798) 5 03/08/2019 siminos/spatiotemp Chapter 1 Cat map If space is infinite, we are in no particular point in space. If time is infinite, we are in no particular point in time. — The Book of Sand, by Jorge Luis Borges What is a natural way to cover the torus, in such a way that the dynamics and the partition borders are correctly aligned? You are allowed to coordinatize the unit torus by any set of coordinates that covers the torus by a unit area. The origin is fixed under the action of A, and straight lines map into the straight lines, so Adler and Weiss did the natural thing, and used parallelograms (fol- lowing Bowen [28] we shall refer to such parallelograms as ‘rectangles’) with edges parallel to the two eigenvectors of A. Adler and Weiss observed that the torus in the new eigen-coordinates is covered by two rectangles, labelled A and B in figure 1.1. 1 1.1 Adler-Weiss partition of the Thom-Arnol’d cat map Figure 1.1 for the canonical Thom-Arnol’d cat map remark 1.4 2 1 A = : (1.1) 1 1 Note that [5] 2 2 1 1 1 = ; (1.2) 1 1 1 0 so each of equivalence classes with respect to centralizer is split into two equiv- alence classes with respect to the group {±An j n 2 Zg. (See also (4.18).) 1Predrag 2018-02-09: (1) motivate Manning multiples by doing the 1D circle map first. Maybe Robinson [76] does that. (2) motivate spatiotemporal cat by recent Gutkin et al. many-body paper 7 CHAPTER 1. CAT MAP B u W (0, 1) A u − s W ( 1, 0) W (3, 2) u W (0, 0) s s s s s (a) W (0, 0) W (0, 1) W (1, 1) W (2, 1) W (3, 1) 3' f ( ) 2' 1' 1 W u (0, 1) f ( ) u W (− 1, 0) W s (3, 2) W u (0, 0) s W (2, 2) (b) W s (0, 0) W s (0, 1) W s (1, 1) W s (2, 1) f(3) 5 4 f(5) 3 f(1) 1 f(4) 0 f(0) 4 3 5 B A 0 (c) 1 Figure 1.1: (a) Two-rectangles Adler-Weiss generating partition for the canon- ical Arnol’d cat map (1.1), with borders given by stable-unstable manifolds of the unfolded cat map lattice points near to the origin. (b) The first iterate of the partition. (c) The iterate pulled back into the generating partition, and the corresponding 5-letter transition graph. In (b) and (c) I have not bothered to re- label Crutchfield partition labels with our shift code. This is a “linear code,” in the sense that for each square on can count how many side-lengths are needed to pull the overhanging part of f(x) back into the two defining squares. (Figure by Crutchfield [34]) 03/08/2019 siminos/spatiotemp 8 6814 (predrag–6798) CHAPTER 1. CAT MAP String people, arXiv:1608.07845, find the identity 2 1 1 1 1 0 = = LL> (1.3) 1 1 0 1 1 1 significant: “The map corresponds to successive kicks, forwards and back- wards along the light cone [...]” As another example, with s = 4, Manning [67] discusses a Markov partition for the cat map (also discussed by Anosov, Klimenko and Kolutsky [5]) 3 1 A = : (1.4) 2 1 2CB In order to count all admissible walks, one associates with the transition graph such as the one in figure 1.1 (c) the connectivity matrix 1 1 C = ; (1.5) 1 2 where Cij is the number of ways (number of links) of getting to i from j. 1.2 Adler-Weiss partition of the Percival-Vivaldi cat map As illustrated in figure 1.2, the action of the cat map in the Percival-Vivaldi [73] “two-configuration representation” is given by the antisymmetric area preserv- ing [2×2] matrix 0 1 A = (1.6) −1 s For the Arnol’d value s = 3, in one time step the map stretches the unit square into a parallelogram, and than wraps it around the torus 3 times, as in fig- ure 1.2. Visualise the phase space as a bagel, with x0 axis a circle on the outside of the bagel. This circle is divided into three color segments, which map onto each other as you got in the x1 axis direction. Now apply the inverse map - you get 3 strips intersecting the the above strips, for 9 rectangles in all: a full shift, i.e., a ternary Smale horseshoe. So on the torus there are only 3 strips - there is no distinction between the two outer letters A1 = {−1; 2g = {red, yellow}, it is the same third strip.
Load more

Recommended publications
  • Anosov Diffeomorphism with a Horseshoe That Attracts Almost Any Point
    DISCRETE AND CONTINUOUS doi:10.3934/dcds.2020017 DYNAMICAL SYSTEMS Volume 40, Number 1, January 2020 pp. 441–465 ANOSOV DIFFEOMORPHISM WITH A HORSESHOE THAT ATTRACTS ALMOST ANY POINT Christian Bonatti Institut de Math´ematiquesde Bourgogne, Universit´ede Bourgogne Dijon 21004, France Stanislav Minkov Brook Institute of Electronic Control Machines 119334, Moscow, Vavilova str., 24, Russia Alexey Okunev Loughborough University LE11 3TU, Loughborough, UK Ivan Shilin National Research University Higher School of Economics Faculty of Mathematics, 119048, Moscow, Usacheva str., 6, Russia (Communicated by Sylvain Crovisier) Abstract. We present an example of a C1 Anosov diffeomorphism of a two- torus with a physical measure such that its basin has full Lebesgue measure and its support is a horseshoe of zero measure. 1. Introduction. Consider a diffeomorphism F that preserves a probability mea- sure ν. The basin of ν is the set of all points x such that the sequence of measures n 1 δ := (δ + ··· + δ n−1 ) x n x F (x) converges to ν in the weak-∗ topology. A measure is called physical if its basin has positive Lebesgue measure. It is well known (see [3], [11], [12], or [1, x1:3]) that any transitive C2 Anosov diffeomorphism (note that all known Anosov diffeomorphisms are transitive) has a unique physical measure and • the basin of this measure has full Lebesgue measure, • the support of this measure coincides with the whole phase space. In C1 dynamics there are many phenomena that are impossible in C2. Bowen [2] has constructed an example of a C1 diffeomorphism of the plane with a thick horseshoe (i.e., a horseshoe with positive Lebesgue measure) and Robinson and Young [10] have embedded a thick horseshoe in a C1 Anosov diffeomorphism of T2 2010 Mathematics Subject Classification.
    [Show full text]
  • Approximating Stable and Unstable Manifolds in Experiments
    PHYSICAL REVIEW E 67, 037201 ͑2003͒ Approximating stable and unstable manifolds in experiments Ioana Triandaf,1 Erik M. Bollt,2 and Ira B. Schwartz1 1Code 6792, Plasma Physics Division, Naval Research Laboratory, Washington, DC 20375 2Department of Mathematics and Computer Science, Clarkson University, P.O. Box 5815, Potsdam, New York 13699 ͑Received 5 August 2002; revised manuscript received 23 December 2002; published 12 March 2003͒ We introduce a procedure to reveal invariant stable and unstable manifolds, given only experimental data. We assume a model is not available and show how coordinate delay embedding coupled with invariant phase space regions can be used to construct stable and unstable manifolds of an embedded saddle. We show that the method is able to capture the fine structure of the manifold, is independent of dimension, and is efficient relative to previous techniques. DOI: 10.1103/PhysRevE.67.037201 PACS number͑s͒: 05.45.Ac, 42.60.Mi Many nonlinear phenomena can be explained by under- We consider a basin saddle of Eq. ͑1͒ which lies on the standing the behavior of the unstable dynamical objects basin boundary between a chaotic attractor and a period-four present in the dynamics. Dynamical mechanisms underlying periodic attractor. The chosen parameters are in a region in chaos may be described by examining the stable and unstable which the chaotic attractor disappears and only a periodic invariant manifolds corresponding to unstable objects, such attractor persists along with chaotic transients due to inter- as saddles ͓1͔. Applications of the manifold topology have secting stable and unstable manifolds of the basin saddle.
    [Show full text]
  • Robust Transitivity of Singular Hyperbolic Attractors
    Robust transitivity of singular hyperbolic attractors Sylvain Crovisier∗ Dawei Yangy January 22, 2020 Abstract Singular hyperbolicity is a weakened form of hyperbolicity that has been introduced for vector fields in order to allow non-isolated singularities inside the non-wandering set. A typical example of a singular hyperbolic set is the Lorenz attractor. However, in contrast to uniform hyperbolicity, singular hyperbolicity does not immediately imply robust topological properties, such as the transitivity. In this paper, we prove that open and densely inside the space of C1 vector fields of a compact manifold, any singular hyperbolic attractors is robustly transitive. 1 Introduction Lorenz [L] in 1963 studied some polynomial ordinary differential equations in R3. He found some strange attractor with the help of computers. By trying to understand the chaotic dynamics in Lorenz' systems, [ABS, G, GW] constructed some geometric abstract models which are called geometrical Lorenz attractors: these are robustly transitive non- hyperbolic chaotic attractors with singularities in three-dimensional manifolds. In order to study attractors containing singularities for general vector fields, Morales- Pacifico-Pujals [MPP] first gave the notion of singular hyperbolicity in dimension 3. This notion can be adapted to the higher dimensional case, see [BdL, CdLYZ, MM, ZGW]. In the absence of singularity, the singular hyperbolicity coincides with the usual notion of uniform hyperbolicity; in that case it has many nice dynamical consequences: spectral decomposition, stability, probabilistic description,... But there also exist open classes of vector fields exhibiting singular hyperbolic attractors with singularity: the geometrical Lorenz attractors are such examples. In order to have a description of the dynamics of arXiv:2001.07293v1 [math.DS] 21 Jan 2020 general flows, we thus need to develop a systematic study of the singular hyperbolicity in the presence of singularity.
    [Show full text]
  • Invariant Measures for Hyperbolic Dynamical Systems
    Invariant measures for hyperbolic dynamical systems N. Chernov September 14, 2006 Contents 1 Markov partitions 3 2 Gibbs Measures 17 2.1 Gibbs states . 17 2.2 Gibbs measures . 33 2.3 Properties of Gibbs measures . 47 3 Sinai-Ruelle-Bowen measures 56 4 Gibbs measures for Anosov and Axiom A flows 67 5 Volume compression 86 6 SRB measures for general diffeomorphisms 92 This survey is devoted to smooth dynamical systems, which are in our context diffeomorphisms and smooth flows on compact manifolds. We call a flow or a diffeomorphism hyperbolic if all of its Lyapunov exponents are different from zero (except the one in the flow direction, which has to be 1 zero). This means that the tangent vectors asymptotically expand or con- tract exponentially fast in time. For many reasons, it is convenient to assume more than just asymptotic expansion or contraction, namely that the expan- sion and contraction of tangent vectors happens uniformly in time. Such hyperbolic systems are said to be uniformly hyperbolic. Historically, uniformly hyperbolic flows and diffeomorphisms were stud- ied as early as in mid-sixties: it was done by D. Anosov [2] and S. Smale [77], who introduced his Axiom A. In the seventies, Anosov and Axiom A dif- feomorphisms and flows attracted much attention from different directions: physics, topology, and geometry. This actually started in 1968 when Ya. Sinai constructed Markov partitions [74, 75] that allowed a symbolic representa- tion of the dynamics, which matched the existing lattice models in statistical mechanics. As a result, the theory of Gibbs measures for one-dimensional lat- tices was carried over to Anosov and Axiom A dynamical systems.
    [Show full text]
  • Linear Response, Or Else
    Linear response, or else Viviane Baladi Abstract. Consider a smooth one-parameter family t ft of dynamical systems ft, with t < ϵ. !→ | | Assume that for all t (or for many t close to t =0) the map ft admits a unique physical invariant probability measure µt. We say that linear response holds if t µt is differentiable at t =0(possibly !→ in the sense of Whitney), and if its derivative can be expressed as a function of f0, µ0, and ∂tft t=0. | The goal of this note is to present to a general mathematical audience recent results and open problems in the theory of linear response for chaotic dynamical systems, possibly with bifurcations. Mathematics Subject Classification (2010). Primary 37C40; Secondary 37D25, 37C30, 37E05. Keywords. Linear response, transfer operator, Ruelle operator, physical measure, SRB measure, bi- furcations, differentiable dynamical system, unimodal maps, expanding interval maps, hyperbolic dy- namical systems. 1. Introduction A discrete-time dynamical system is a self-map f : M M on a space M. To any point n → 0 x M is then associated its (future) orbit f (x) n Z+ where f (x)=x, and n∈ n 1 { | ∈ } f (x)=f − (f(x)), for n 1, represents the state of the system at time n, given the “ini- ≥ n tial condition” x. (If f is invertible, one can also consider the past orbit f − (x) n Z+ .) { | ∈ } In this text, we shall always assume that M is a compact differentiable manifold (possibly with boundary), with the Borel σ-algebra, endowed with a Riemannian structure and thus normalised Lebesgue measure.
    [Show full text]
  • Equilibrium States and the Ergodic Theory of Anosov Diffeomorphisms
    Rufus Bowen Equilibrium States and the Ergodic Theory of Anosov Diffeomorphisms New edition of Lect. Notes in Math. 470, Springer, 1975. April 14, 2013 Springer Preface The Greek and Roman gods, supposedly, resented those mortals endowed with superlative gifts and happiness, and punished them. The life and achievements of Rufus Bowen (1947{1978) remind us of this belief of the ancients. When Rufus died unexpectedly, at age thirty-one, from brain hemorrhage, he was a very happy and successful man. He had great charm, that he did not misuse, and superlative mathematical talent. His mathematical legacy is important, and will not be forgotten, but one wonders what he would have achieved if he had lived longer. Bowen chose to be simple rather than brilliant. This was the hard choice, especially in a messy subject like smooth dynamics in which he worked. Simplicity had also been the style of Steve Smale, from whom Bowen learned dynamical systems theory. Rufus Bowen has left us a masterpiece of mathematical exposition: the slim volume Equilibrium States and the Ergodic Theory of Anosov Diffeomorphisms (Springer Lecture Notes in Mathematics 470 (1975)). Here a number of results which were new at the time are presented in such a clear and lucid style that Bowen's monograph immediately became a classic. More than thirty years later, many new results have been proved in this area, but the volume is as useful as ever because it remains the best introduction to the basics of the ergodic theory of hyperbolic systems. The area discussed by Bowen came into existence through the merging of two apparently unrelated theories.
    [Show full text]
  • Chapter 2 Structural Stability
    Chapter 2 Structural stability 2.1 Denitions and one-dimensional examples A very important notion, both from a theoretical point of view and for applications, is that of stability: the qualitative behavior should not change under small perturbations. Denition 2.1.1: A Cr map f is Cm structurally stable (with 1 m r ∞) if there exists a neighbour- hood U of f in the Cm topology such that every g ∈ U is topologically conjugated to f. Remark 2.1.1. The reason that for structural stability we just ask the existence of a topological conju- gacy with close maps is because we are interested only in the qualitative properties of the dynamics. For 1 1 R instance, the maps f(x)= 2xand g(x)= 3xhave the same qualitative dynamics over (and indeed are topologically conjugated; see below) but they cannot be C1-conjugated. Indeed, assume there is a C1- dieomorphism h: R → R such that h g = f h. Then we must have h(0) = 0 (because the origin is the unique xed point of both f and g) and 1 1 h0(0) = h0 g(0) g0(0)=(hg)0(0)=(fh)0(0) = f 0 h(0) h0(0) = h0(0); 3 2 but this implies h0(0) = 0, which is impossible. Let us begin with examples of non-structurally stable maps. 2 Example 2.1.1. For ε ∈ R let Fε: R → R given by Fε(x)=xx +ε. We have kFε F0kr = |ε| for r all r 0, and hence Fε → F0 in the C topology.
    [Show full text]
  • Hartman-Grobman and Stable Manifold Theorem
    THE HARTMAN-GROBMAN AND STABLE MANIFOLD THEOREM SLOBODAN N. SIMIC´ This is a summary of some basic results in dynamical systems we discussed in class. Recall that there are two kinds of dynamical systems: discrete and continuous. A discrete dynamical system is map f : M → M of some space M.A continuous dynamical system (or flow) is a collection of maps φt : M → M, with t ∈ R, satisfying φ0(x) = x and φs+t(x) = φs(φt(x)), for all x ∈ M and s, t ∈ R. We call M the phase space. It is usually either a subset of a Euclidean space, a metric space or a smooth manifold (think of surfaces in 3-space). Similarly, f or φt are usually nice maps, e.g., continuous or differentiable. We will focus on smooth (i.e., differentiable any number of times) discrete dynamical systems. Let f : M → M be one such system. Definition 1. The positive or forward orbit of p ∈ M is the set 2 O+(p) = {p, f(p), f (p),...}. If f is invertible, we define the (full) orbit of p by k O(p) = {f (p): k ∈ Z}. We can interpret a point p ∈ M as the state of some physical system at time t = 0 and f k(p) as its state at time t = k. The phase space M is the set of all possible states of the system. The goal of the theory of dynamical systems is to understand the long-term behavior of “most” orbits. That is, what happens to f k(p), as k → ∞, for most initial conditions p ∈ M? The first step towards this goal is to understand orbits which have the simplest possible behavior, namely fixed and periodic ones.
    [Show full text]
  • Ζ−1 Using Theorem 1.2
    UC San Diego UC San Diego Electronic Theses and Dissertations Title Ihara zeta functions of irregular graphs Permalink https://escholarship.org/uc/item/3ws358jm Author Horton, Matthew D. Publication Date 2006 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California UNIVERSITY OF CALIFORNIA, SAN DIEGO Ihara zeta functions of irregular graphs A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics by Matthew D. Horton Committee in charge: Professor Audrey Terras, Chair Professor Mihir Bellare Professor Ron Evans Professor Herbert Levine Professor Harold Stark 2006 Copyright Matthew D. Horton, 2006 All rights reserved. The dissertation of Matthew D. Horton is ap- proved, and it is acceptable in quality and form for publication on micro¯lm: Chair University of California, San Diego 2006 iii To my wife and family Never hold discussions with the monkey when the organ grinder is in the room. |Sir Winston Churchill iv TABLE OF CONTENTS Signature Page . iii Dedication . iv Table of Contents . v List of Figures . vii List of Tables . viii Acknowledgements . ix Vita ...................................... x Abstract of the Dissertation . xi 1 Introduction . 1 1.1 Preliminaries . 1 1.2 Ihara zeta function of a graph . 4 1.3 Simplifying assumptions . 8 2 Poles of the Ihara zeta function . 10 2.1 Bounds on the poles . 10 2.2 Relations among the poles . 13 3 Recovering information . 17 3.1 The hope . 17 3.2 Recovering Girth . 18 3.3 Chromatic polynomials and Ihara zeta functions . 20 4 Relations among Ihara zeta functions .
    [Show full text]
  • Arxiv:1711.06300V1
    EXPLICIT BLOCK-STRUCTURES FOR BLOCK-SYMMETRIC FIEDLER-LIKE PENCILS∗ M. I. BUENO†, M. MARTIN ‡, J. PEREZ´ §, A. SONG ¶, AND I. VIVIANO k Abstract. In the last decade, there has been a continued effort to produce families of strong linearizations of a matrix polynomial P (λ), regular and singular, with good properties, such as, being companion forms, allowing the recovery of eigen- vectors of a regular P (λ) in an easy way, allowing the computation of the minimal indices of a singular P (λ) in an easy way, etc. As a consequence of this research, families such as the family of Fiedler pencils, the family of generalized Fiedler pencils (GFP), the family of Fiedler pencils with repetition, and the family of generalized Fiedler pencils with repetition (GFPR) were con- structed. In particular, one of the goals was to find in these families structured linearizations of structured matrix polynomials. For example, if a matrix polynomial P (λ) is symmetric (Hermitian), it is convenient to use linearizations of P (λ) that are also symmetric (Hermitian). Both the family of GFP and the family of GFPR contain block-symmetric linearizations of P (λ), which are symmetric (Hermitian) when P (λ) is. Now the objective is to determine which of those structured linearizations have the best numerical properties. The main obstacle for this study is the fact that these pencils are defined implicitly as products of so-called elementary matrices. Recent papers in the literature had as a goal to provide an explicit block-structure for the pencils belonging to the family of Fiedler pencils and any of its further generalizations to solve this problem.
    [Show full text]
  • Ihara Zeta Functions
    Audrey Terras 2/16/2004 fun with zeta and L- functions of graphs Audrey Terras U.C.S.D. February, 2004 IPAM Workshop on Automorphic Forms, Group Theory and Graph Expansion Introduction The Riemann zeta function for Re(s)>1 ∞ 1 −1 ζ ()sp== 1 −−s . ∑ s ∏ () n=1 n pprime= Riemann extended to all complex s with pole at s=1. Functional equation relates value at s and 1-s Riemann hypothesis duality between primes and complex zeros of zeta See Davenport, Multiplicative Number Theory. 1 Audrey Terras 2/16/2004 Graph of |Zeta| Graph of z=| z(x+iy) | showing the pole at x+iy=1 and the first 6 zeros which are on the line x=1/2, of course. The picture was made by D. Asimov and S. Wagon to accompany their article on the evidence for the Riemann hypothesis as of 1986. A. Odlyzko’s Comparison of Spacings of Zeros of Zeta and Eigenvalues of Random Hermitian Matrix. See B. Cipra, What’s Happening in Math. Sciences, 1998-1999. 2 Audrey Terras 2/16/2004 Dedekind zeta of an We’ll algebraic number field F, say where primes become prime more ideals p and infinite product of about number terms field (1-Np-s)-1, zetas Many Kinds of Zeta Np = norm of p = #(O/p), soon O=ring of integers in F but not Selberg zeta Selberg zeta associated to a compact Riemannian manifold M=G\H, H = upper half plane with arc length ds2=(dx2+dy2)y-2 , G=discrete group of real fractional linear transformations primes = primitive closed geodesics C in M of length −+()()sjν C ν(C), Selberg Zs()=− 1 e (primitive means only go Zeta = ∏ ∏( ) around once) []Cj≥ 0 Reference: A.T., Harmonic Analysis on Symmetric Duality between spectrum ∆ on M & lengths closed geodesics in M Spaces and Applications, I.
    [Show full text]
  • Uniformly Hyperbolic Control Theory Christoph Kawan
    HYPERBOLIC CONTROL THEORY 1 Uniformly hyperbolic control theory Christoph Kawan Abstract—This paper gives a summary of a body of work at the of control-affine systems with a compact and convex control intersection of control theory and smooth nonlinear dynamics. range. The main idea is to transfer the concept of uniform hyperbolicity, These results are grounded on the topological theory of central to the theory of smooth dynamical systems, to control- affine systems. Combining the strength of geometric control Colonius-Kliemann [7] which provides an approach to under- theory and the hyperbolic theory of dynamical systems, it is standing the global controllability structure of control systems. possible to deduce control-theoretic results of non-local nature Two central notions of this theory are control and chain that reveal remarkable analogies to the classical hyperbolic the- control sets. Control sets are the maximal regions of complete ory of dynamical systems. This includes results on controllability, approximate controllability in the state space. The definition of robustness, and practical stabilizability in a networked control framework. chain control sets involves the concept of "-chains (also called "-pseudo-orbits) from the theory of dynamical systems. The Index Terms—Control-affine system; uniform hyperbolicity; main motivation for this concept comes from the facts that (i) chain control set; controllability; robustness; networked control; invariance entropy chain control sets are outer approximations of control sets and (ii) chain control sets in general are easier to determine than control sets (both analytically and numerically). I. INTRODUCTION As examples show, chain control sets can support uniformly hyperbolic and, more generally, partially hyperbolic structures.
    [Show full text]