Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-14T22:40:36.109Z Has data issue: false hasContentIssue false

19 - Classical algorithms for data assimilation

from PART V - DATA ASSIMILATION: STOCHASTIC/STATIC 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

With the advent of numerical weather prediction (NWP) in the post-WWII period of the 1950s, it became clear that numerical weather map analysis was a necessary adjunct to the prediction. Whereas a subjective hand analysis of weather data was the standard through the mid-twentieth century, the time constraints of operational NWP made it advisable to analyze the variables on a network of grid points in an objective fashion. It is worth mentioning, however, that the limited availability of computers in the early 1950s led the Norwegian weather service to prepare initial data for the one-level barotropic forecast by hand. In fact, the forecast (a 24-hour prediction) was also prepared graphically by methods that were akin to those discussed in Chapter 2 (Section 2.6). These forecasts compared favorably with the computer-generated results in the USA and Sweden. Nevertheless, by the mid-1950s, objective data assimilation via computer was the rule. We review several of these early methods of data assimilation.

In section 19.1 we provide a brief review of the polynomial approximation method with a discussion of two ways of handling the balance constraints – as strong and weak constraints. An algorithm based on Tikhonov regularization is described in section 19.2. A class of iterative techniques known as successive correction methods (SCM) is reviewed in section 19.3 along with convergence properties of these schemes. The concluding section 19.4 derives the mechanics of the optimum interpolation method and its relation to SCM.

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