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

29 - Nonlinear filtering

from PART VII - DATA ASSIMILATION: STOCHASTIC/DYNAMIC MODELS

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

This chapter provides an overview of the methods for recursively estimating the state of a nonlinear stochastic dynamical system based on a set of observations that (a) depend (nonlinearly) on the state being estimated and (b) are corrupted by additive white noise. The exact solution to this problem involves characterizing the evolution of the posterior probability density function over the state space, ℝn. This evolution equation can easily be derived from first principles. However, except in special cases (linear dynamics and linear observations) it is often difficult to explicitly characterize the form of the density as a function of space and time. Numerical methods are the only recourse to solving this class of infinite dimensional problems. Given this challenge and the difficulty, researchers have sought for alternate characterization, namely to compute the evolution of the moments of distribution of states being estimated. Ideally, one would require infinitely many moments to provide an equivalent characterization of the distribution. This infinite dimensional problem is further exacerbated by the fact that the rth moment often depends on the qth moment, for q > r. Computational feasibility demands that we find a “good” finite dimensional approximation to this infinite system of coupled moments.

One useful idea is to find the closure property among these moments, namely to find the least positive integer p such that the first p moments depend only among themselves and not on moments of order larger than p.

Type
Chapter
Information
Dynamic Data Assimilation
A Least Squares Approach
, pp. 509 - 533
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
×