Fr. 69.00

Practical Numerical Algorithms for Chaotic Systems

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

One of the basic tenets of science is that deterministic systems are completely predictable-given the initial condition and the equations describing a system, the behavior of the system can be predicted 1 for all time. The discovery of chaotic systems has eliminated this viewpoint. Simply put, a chaotic system is a deterministic system that exhibits random behavior. Though identified as a robust phenomenon only twenty years ago, chaos has almost certainly been encountered by scientists and engi neers many times during the last century only to be dismissed as physical noise. Chaos is such a wide-spread phenomenon that it has now been reported in virtually every scientific discipline: astronomy, biology, biophysics, chemistry, engineering, geology, mathematics, medicine, meteorology, plasmas, physics, and even the social sci ences. It is no coincidence that during the same two decades in which chaos has grown into an independent field of research, computers have permeated society. It is, in fact, the wide availability of inex pensive computing power that has spurred much of the research in chaotic dynamics. The reason is simple: the computer can calculate a solution of a nonlinear system. This is no small feat. Unlike lin ear systems, where closed-form solutions can be written in terms of the system's eigenvalues and eigenvectors, few nonlinear systems and virtually no chaotic systems possess closed-form solutions.

List of contents

1 Steady-State Solutions.- 1.1 Systems.- 1.2 Limit sets.- 1.3 Summary.- 2 Poincaré Maps.- 2.1 Definitions.- 2.2 Limit Sets.- 2.3 Higher-order Poincaré maps.- 2.4 Algorithms.- 2.5 Summary.- 3 Stability.- 3.1 Eigenvalues.- 3.2 Characteristic multipliers.- 3.3 Lyapunov exponents.- 3.4 Algorithms.- 3.5 Summary.- 4 Integration.- 4.1 Types.- 4.2 Integration error.- 4.3 Stiff equations.- 4.4 Practical considerations.- 4.5 Summary.- 5 Locating Limit Sets.- 5.1 Introduction.- 5.2 Equilibrium points.- 5.3 Fixed points.- 5.4 Closed orbits.- 5.5 Periodic solutions.- 5.6 Two-periodic solutions.- 5.7 Chaotic solutions.- 5.8 Summary.- 6 Manifolds.- 6.1 Definitions and theory.- 6.2 Algorithms.- 6.3 Summary.- 7 Dimension.- 7.1 Dimension.- 7.2 Reconstruction.- 7.3 Summary.- 8 Bifurcation Diagrams.- 8.1 Definitions.- 8.2 Algorithms.- 8.3 Summary.- 9 Programming.- 9.1 The user interface.- 9.2 Languages.- 9.3 Library definitions.- 10 Phase Portraits.- 10.1 Trajectories.- 10.2 Limit sets.- 10.3 Basins.- 10.4 Programming tips.- 10.5 Summary.- A The Newton-Raphson Algorithm.- B The Variational Equation.- C Differential Topology.- C.1 Differential topology.- C.2 Structural stability.- D The Poincaré Map.- E One Lyapunov Exponent Vanishes.- F Cantor Sets.- G List of Symbols.

Product details

Authors Leon Chua, Thomas Parker, Thomas S Parker, Thomas S. Parker
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 25.07.2012
 
EAN 9781461281214
ISBN 978-1-4612-8121-4
No. of pages 348
Dimensions 158 mm x 18 mm x 233 mm
Weight 552 g
Illustrations XIV, 348 p.
Subject Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.