Practical Numerical Algorithms for Chaotic Systems
Springer (Publisher)
198th Edition
Published in January 1992
Book
Hardback
XIV, 348 pages
978-3-540-96689-0 (ISBN)
Description
This volume has two goals. The first to explain the significant features of chaotic systems in an intuitive yet mathematically sound manner. To this end, the authors rely on mathematics as a language to describe the solutions and properties of systems, but they rarely state theorems and even less often prove them. No prior knowledge of nonlinear system is necessary. The second goal is to present robust, reliable algorithms for simulating nonlinear dynamics. A verbal description of an algorithm often makes complete sense until someone actually sits down to implement it. To avoid this problem, the authors provide detailed pseudocode for each algorithm. Though simulations are a useful tool, simulation data must be interpreted carefully, checked against intuition and theory, and used only for purposes for which it is suited. The authors therefore also present the theoretical underpinnings of the algorithms. Most of the algorithms presented in the book are available in the software package INSITE (Interactive Nonlinear Systems Investigative Toolkit for Everyone).
INSITE is a collection of interactive, graphically oriented programs for the simulation and investigation of nonlinear systems with an emphasis on chaotic systems. The software package is distributed separately.
INSITE is a collection of interactive, graphically oriented programs for the simulation and investigation of nonlinear systems with an emphasis on chaotic systems. The software package is distributed separately.
More details
Edition
198., 3rd corr. printing
Language
English
Place of publication
Berlin
Germany
Target group
College/higher education
Professional and scholarly
Illustrations
152 figs.
Dimensions
Height: 240 mm
Weight
660 gr
ISBN-13
978-3-540-96689-0 (9783540966890)
Schweitzer Classification
Content
Contents: Steady-State Solutions- Poincar Maps. Stability. Integration. Locating Limit Sets. Manifolds. Dimension. Bifurcation Diagrams. Programming. Phase Portraits. The Newton-Raphson Algorithm. The Variational Equation. Differential Topology. The Poincar Map. One Lyapunov Exponent Vanishes. Cantor Sets. List ot Symbols. Bibliography. Index.