Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-15T02:31:14.863Z Has data issue: false hasContentIssue false

32 - Predictability: a deterministic view

from PART VIII - PREDICTABILITY

Published online by Cambridge University Press:  18 December 2009

John M. Lewis
Affiliation:
National Severe Storms Laboratory, Oklahoma
S. Lakshmivarahan
Affiliation:
University of Oklahoma
Sudarshan Dhall
Affiliation:
University of Oklahoma
Get access

Summary

In this chapter we describe a deterministic approach to stability and predictability of dynamic systems. While the classical stability theory deals with characterizing the growth and behavior of perturbations around an equilibrium state of a system, the goal of the predictability theory is to quantify the growth and behavior of infinitesimally small perturbations superimposed on an evolving trajectory – be it stable, unstable or chaotic – of the given dynamical system. Any two states that are infinitesimally close to each other are called analogs. Thus, predictability theory seeks to characterize the future evolution of analogous states. Since every trajectory starts from an initial state, predictability analysis is often recast as one of analyzing the sensitive dependence on initial state. Despite this difference in goals, both stability and predictability theories depend heavily on the same set of mathematical ideas and tools drawn from the spectral (eigenvalue) theory of finite dimensional (matrix) operators.

The goals and problems related to deterministic predictability theory are reviewed in the opening Section 32.1. Section 32.2 through 32.5 provide a succinct review of stability theory of dynamical systems. Predictability analysis using singular vectors is developed in Section 32.6. A summary of a fundamental theorem of Osledec leading to the definition of Lyapunov vectors and Lyapunov indices is given in Section 32.7. This section also contains two related algorithms for computing Lyapunov indices. The concluding Section 32.8 describes two methods for generating deterministic ensembles using which one can assess evolution of the spread among the trajectories measured among other things through the sample covariance.

Type
Chapter
Information
Dynamic Data Assimilation
A Least Squares Approach
, pp. 581 - 627
Publisher: Cambridge University Press
Print publication year: 2006

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
×