This book is based on research on the rigorous proof of chaos and bifurcations in 2-D quadratic maps, especially the invertible case such as the Hnon map, and in 3-D ODE's, especially piecewise linear systems such as the Chua's circuit. In addition, the book covers some recent works in the field of general 2-D quadratic maps, especially their classification into equivalence classes, and finding regions for chaos, hyperchaos, and non-chaos in the space of bifurcation parameters. Following the main introduction to the rigorous tools used to prove chaos and bifurcations in the two representative systems, is the study of the invertible case of the 2-D quadratic map, where previous works are oriented toward Hnon mapping. 2-D quadratic maps are then classified into 30 maps with well-known formulas. Two proofs on the regions for chaos, hyperchaos, and non-chaos in the space of the bifurcation parameters are presented using a technique based on the second-derivative test and bounds for Lyapunov exponents. Also included is the proof of chaos in the piecewise linear Chua's system using two methods, the first of which is based on the construction of Poincar map, and the second is based on a computer-assisted proof. Finally, a rigorous analysis is provided on the bifurcational phenomena in the piecewise linear Chua's system using both an analytical 2-D mapping and a 1-D approximated Poincar mapping in addition to other analytical methods.

This book is based on research on the rigorous proof of chaos and bifurcations in 2-D quadratic maps, especially the invertible case such as the Hénon map, and in 3-D ODE's, especially piecewise linear systems such as the Chua's circuit. In addition, the book covers some recent works in the field of general 2-D quadratic maps, especially their classification into equivalence classes, and finding regions for chaos, hyperchaos, and non-chaos in the space of bifurcation parameters.Following the main introduction to the rigorous tools used to prove chaos and bifurcations in the two representative systems, is the study of the invertible case of the 2-D quadratic map, where previous works are oriented toward Hénon mapping. 2-D quadratic maps are then classified into 30 maps with well-known formulas. Two proofs on the regions for chaos, hyperchaos, and non-chaos in the space of the bifurcation parameters are presented using a technique based on the second-derivative test and bounds for Lyapunov exponents. Also included is the proof of chaos in the piecewise linear Chua's system using two methods, the first of which is based on the construction of Poincaré map, and the second is based on a computer-assisted proof. Finally, a rigorous analysis is provided on the bifurcational phenomena in the piecewise linear Chua's system using both an analytical 2-D mapping and a 1-D approximated Poincaré mapping in addition to other analytical methods.

Chaos is the idea that a system will produce very different long-term behaviors when the initial conditions are perturbed only slightly. Chaos is used for novel, time- or energy-critical interdisciplinary applications. Examples include high-performance circuits and devices, liquid mixing, chemical reactions, biological systems, crisis management, secure information processing, and critical decision-making in politics, economics, as well as military applications, etc. This book presents the latest investigations in the theory of chaotic systems and their dynamics. The book covers some theoretical aspects of the subject arising in the study of both discrete and continuous-time chaotic dynamical systems. This book presents the state-of-the-art of the more advanced studies of chaotic dynamical systems.

This collection of review articles is devoted to new developments in the study of chaotic dynamical systems with some open problems and challenges. The papers, written by many of the leading experts in the field, cover both the experimental and theoretical aspects of the subject. This edited volume presents a variety of fascinating topics of current interest and problems arising in the study of both discrete and continuous time chaotic dynamical systems. Exciting new techniques stemming from the area of nonlinear dynamical systems theory are currently being developed to meet these challenges. Presenting the state-of-the-art of the more advanced studies of chaotic dynamical systems, Frontiers in the Study of Chaotic Dynamical Systems with Open Problems is devoted to setting an agenda for future research in this exciting and challenging field.

Robust chaos is defined by the absence of periodic windows and coexisting attractors in some neighborhoods in the parameter space of a dynamical system. This unique book explores the definition, sources, and roles of robust chaos. The book is written in a reasonably self-contained manner and aims to provide students and researchers with the necessary understanding of the subject. Most of the known results, experiments, and conjectures about chaos in general and about robust chaos in particular are collected here in a pedagogical form. Many examples of dynamical systems, ranging from purely mathematical to natural and social processes displaying robust chaos, are discussed in detail. At the end of each chapter is a set of exercises and open problems (more than 260 in the whole book) intended to reinforce the ideas and provide additional experiences for both readers and researchers in nonlinear science in general, and chaos theory in particular.

Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems, i.e., cellular automata and other related discrete complex systems. Thus, arrays of locally connected finite state machines, or cells, update their states simultaneously, in discrete time, by the same transition rule. The classical dynamics in these systems is Markovian: only the actual configuration is taken into account to generate the next one. Generalizing the conventional view on spatially extended discrete dynamical systems evolution by allowing cells (or nodes) to be featured by some trait state computed as a function of its own previous state-values, the transition maps of the classical systems are kept unaltered, so that the effect of memory can be easily traced. The book demonstrates that discrete dynamical systems with memory are not only priceless tools for modeling natural phenomena but unique mathematical and aesthetic objects.

Annotation This text introduces cellular automata from a rigorous nonlinear dynamics perspective. It supplies the missing link between nonlinear differential and difference equations to discrete symbolic analysis. It provides an analysis, and classification of the empirical results presented in Wolfram's 'New Kind of Science'.

This unprecedented book offers all the details of the mathematical mechanics underlying state-of-the-art modeling of skeletal muscle contraction. The aim is to provide an integrated vision of mathematics, physics, chemistry and biology for this one understanding. The method is to take advantage of modern mathematical technology — Eilenberg-Mac Lane category theory, Robinson infinitesimal calculus and Kolmogorov probability theory — to examine a succession of distinguishable universes of particles, and continuous, thermodynamic, chemical, and molecular bodies, all with a focus on proofs by algebraic calculation without set theory. Also provided are metaphors and analogies, and careful distinction between representational pictures, mental model drawings, and mathematical diagrams.High school mathematics teachers, undergraduate and graduate college students, and researchers in mathematics, physics, chemistry, and biology may use this integrated publication to broaden their perspective on science, and to experience the precision that mathematical mechanics brings to understanding the muscular mechanism of nearly all animal behavior.

This penultimate volume contains numerous original, elegant, and surprising results in 1-dimensional cellular automata. Perhaps the most exciting, if not shocking, new result is the discovery that only 82 local rules, out of 256, suffice to predict the time evolution of any of the remaining 174 local rules from an arbitrary initial bit-string configuration. This is contrary to the well-known folklore that 256 local rules are necessary, leading to the new concept of quasi-global equivalence.Another surprising result is the introduction of a simple, yet explicit, infinite bit string called the super string S, which contains all random bit strings of finite length as sub-strings. As an illustration of the mathematical subtlety of this amazing discrete testing signal, the super string S is used to prove mathematically, in a trivial and transparent way, that rule 170 is as chaotic as a coin toss.Yet another unexpected new result, among many others, is the derivation of an explicit basin tree generation formula which provides an analytical relationship between the basin trees of globally-equivalent local rules. This formula allows the symbolic, rather than numerical, generation of the time evolution of any local rule corresponding to any initial bit-string configuration, from one of the 88 globally-equivalent local rules.But perhaps the most provocative idea is the proposal for adopting rule 137, over its three globally-equivalent siblings, including the heretofore more well-known rule 110, as the prototypical universal Turing machine.

A Physarum machine is a programmable amorphous biological computer experimentally implemented in the vegetative state of true slime mould Physarum polycephalum. It comprises an amorphous yellowish mass with networks of protoplasmic veins, programmed by spatial configurations of attracting and repelling gradients. This book demonstrates how to create experimental Physarum machines for computational geometry and optimization, distributed manipulation and transportation, and general-purpose computation. Being very cheap to make and easy to maintain, the machine also functions on a wide range of substrates and in a broad scope of environmental conditions. As such a Physarum machine is a 'green' and environmentally friendly unconventional computer. The book is readily accessible to a nonprofessional reader, and is a priceless source of experimental tips and inventive theoretical ideas for anyone who is inspired by novel and emerging non-silicon computers and robots. An account on Physarum Machines can be viewed at http: //www.youtube.com/user/PhysarumMachines.