Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-08T02:32:34.259Z Has data issue: false hasContentIssue false

7 - Introduction to multifractals

Published online by Cambridge University Press:  05 October 2013

Joseph L. McCauley
Affiliation:
University of Houston
Get access

Summary

Incomplete but optimal information: the natural coarsegraining of phase space

How can one characterize an invariant set of a chaotic dynamical system and the motion on that set in a way that makes basic theoretical quantities of interest available for comparison with experiment or computation? Because a formulation of the theory based upon finite resolution is needed in both cases, we generalize the results of Chapter 4 and introduce a formalism that is based upon a hierarchy of more and more refined coarsegrained descriptions of both the invariant set and the motion. Within this finite description, it is sometimes useful to introduce the f(α)-spectrum. The f(α)-spectrum, in the end, depends upon two things: the invariant set and the frequency with which the dynamical system visits different parts of the invariant set. A coarsegrained description of both properties is demanded by virtue of the fact that invariant sets of chaotic dynamical systems have, mathematically, the cardinality of the continuum.

We have seen by the example of the Lorenz model that strange attractors can lead at least approximately to one-dimensional chaotic maps (Chapter 2). In that case, one starts with a certain time series {z(t)} that follows from plotting maxima of the z coordinate against the time, yielding a sequence of numbers z(tn) = zn at discrete times tn, where n = 1,2, 3, … In the Lorenz model, the phase space flow is three-dimensional and the points on the orbit that include the discrete time series {zn} do not fall within a single plane, nor is there any known simple analytic pattern among the various times {tn}.

Type
Chapter
Information
Chaos, Dynamics, and Fractals
An Algorithmic Approach to Deterministic Chaos
, pp. 186 - 211
Publisher: Cambridge University Press
Print publication year: 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×