Data Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading

Similar documents
Predict Global Earth Temperature using Linier Regression

Multivariate problems and matrix algebra

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

A Matrix Algebra Primer

Lecture 21: Order statistics

1B40 Practical Skills

Satellite Retrieval Data Assimilation

Student Activity 3: Single Factor ANOVA

Tests for the Ratio of Two Poisson Rates

Non-Linear & Logistic Regression

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

1 Linear Least Squares

Incorporating Ensemble Covariance in the Gridpoint Statistical Interpolation Variational Minimization: A Mathematical Framework

Continuous Random Variables

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Review of Calculus, cont d

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Best Approximation. Chapter The General Case

Reinforcement learning II

Estimation of Binomial Distribution in the Light of Future Data

LECTURE NOTE #12 PROF. ALAN YUILLE

The steps of the hypothesis test

CBE 291b - Computation And Optimization For Engineers

New Expansion and Infinite Series

Observability of flow dependent structure functions and their use in data assimilation

GNSS Data Assimilation and GNSS Tomography for Global and Regional Models

Review of Gaussian Quadrature method

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Statistical Physics I Spring Term Solutions to Problem Set #1

Bases for Vector Spaces

Tutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits.

Numerical integration

Maximum Likelihood Estimation for Allele Frequencies. Biostatistics 666

Chapter 2 Fundamental Concepts

Robust Predictions in Games with Incomplete Information

MIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model:

Chapter 5 : Continuous Random Variables

Math 270A: Numerical Linear Algebra

8 Laplace s Method and Local Limit Theorems

Robust Predictions in Games with Incomplete Information

Chapter 3 Polynomials

19 Optimal behavior: Game theory

Ordinary differential equations

Lecture 19: Continuous Least Squares Approximation

THE UNIVERSITY OF CHICAGO Booth School of Business Business 41914, Spring Quarter 2015, Mr. Ruey S. Tsay

A NOTE ON ESTIMATION OF THE GLOBAL INTENSITY OF A CYCLIC POISSON PROCESS IN THE PRESENCE OF LINEAR TREND

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics

Week 10: Line Integrals

Partial Derivatives. Limits. For a single variable function f (x), the limit lim

1 Probability Density Functions

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Detection and Estimation Theory

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

Robust Predictions in Games with Incomplete Information

NOTES AND CORRESPONDENCE. Ensemble Square Root Filters*

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Decision Networks. CS 188: Artificial Intelligence Fall Example: Decision Networks. Decision Networks. Decisions as Outcome Trees

Problem. Statement. variable Y. Method: Step 1: Step 2: y d dy. Find F ( Step 3: Find f = Y. Solution: Assume

NUMERICAL INTEGRATION

CHM Physical Chemistry I Chapter 1 - Supplementary Material

Lecture 3 Gaussian Probability Distribution

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

Method: Step 1: Step 2: Find f. Step 3: = Y dy. Solution: 0, ( ) 0, y. Assume

Numerical Methods I Orthogonal Polynomials

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Pre-Session Review. Part 1: Basic Algebra; Linear Functions and Graphs

X Z Y Table 1: Possibles values for Y = XZ. 1, p

Lecture 4: Piecewise Cubic Interpolation

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

UNIT 1 FUNCTIONS AND THEIR INVERSES Lesson 1.4: Logarithmic Functions as Inverses Instruction

13: Diffusion in 2 Energy Groups

First midterm topics Second midterm topics End of quarter topics. Math 3B Review. Steve. 18 March 2009

Review of basic calculus

Elementary Linear Algebra

Some multivariate methods

Numerical Integration

Stein-Rule Estimation and Generalized Shrinkage Methods for Forecasting Using Many Predictors

Best Approximation in the 2-norm

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon

Chapters 4 & 5 Integrals & Applications

1 The Riemann Integral

Numerical Integration

Jack Simons, Henry Eyring Scientist and Professor Chemistry Department University of Utah

The Regulated and Riemann Integrals

DATA ASSIMILATION IN A FLOOD MODELLING SYSTEM USING THE ENSEMBLE KALMAN FILTER

INTRODUCTION TO LINEAR ALGEBRA

Sufficient condition on noise correlations for scalable quantum computing

Measuring Electron Work Function in Metal

Classical Mechanics. From Molecular to Con/nuum Physics I WS 11/12 Emiliano Ippoli/ October, 2011

1 Online Learning and Regret Minimization

Probability Distributions for Gradient Directions in Uncertain 3D Scalar Fields

Lecture 14: Quadrature

ECON 331 Lecture Notes: Ch 4 and Ch 5

Integral equations, eigenvalue, function interpolation

Lecture 20: Numerical Integration III

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

Testing categorized bivariate normality with two-stage. polychoric correlation estimates

Transcription:

Dt Assimiltion Aln O Neill Dt Assimiltion Reserch Centre University of Reding

Contents Motivtion Univrite sclr dt ssimiltion Multivrite vector dt ssimiltion Optiml Interpoltion BLUE 3d-Vritionl Method Klmn Filter 4d-Vritionl Method Applictions of dt ssimiltion in erth system science

Motivtion

DARC Wht is dt ssimiltion? Dt ssimiltion is the technique whereby observtionl dt re combined with output from numericl model to produce n optiml estimte of the evolving stte of the system

Why We Need Dt Assimiltion rnge of observtions rnge of techniques different errors dt gps quntities not mesured quntities linked

DARC

Some Uses of Dt Assimiltion Opertionl wether nd ocen forecsting Sesonl wether forecsting Lnd-surfce process Globl climte dtsets Plnning stellite mesurements Evlution of models nd observtions DARC

Preliminry Concepts

Wht We Wnt o Know x t tmos stte vector s t c surfce fluxes model prmeters X t x t, s t, c

Wht We Also Wnt o Know Errors in models Errors in observtions Wht observtions to mke

DAA ASSIMILAION SYSEM Dt Cche A Error Sttistics model observtions O DAS A Numericl Model F B

he Dt Assimiltion Process observtions forecsts compre reject djust estimtes of stte & prmeters

X observtion model trjectory t

DARC Dt Assimiltion: n nlogy Driving with your eyes closed: open eyes every 0 seconds nd correct trjectory

Bsic Concept of Dt Assimiltion Informtion is ccumulted in time into the model stte nd propgted to ll vribles

DARC Wht re the benefits of dt ssimiltion? Qulity control Combintion of dt Errors in dt nd in model Filling in dt poor regions Designing observtionl systems Mintining consistency Estimting unobserved quntities

DARC Methods of Dt Assimiltion Optiml interpoltion or pprox to it 3D vritionl method 3DVr 4D vritionl method 4DVr Klmn filter with pproximtions

ypes of Dt Assimiltion Sequentil Non-sequentil Intermittent Continous

Sequentil Intermittent Assimiltion obs obs obs obs obs obs nlysis model nlysis model nlysis

Sequentil Continuous Assimiltion obs obs obs obs obs

Non-sequentil Intermittent Assimiltion obs obs obs obs obs obs nlysis + model nlysis + model nlysis + model

Non-sequentil Continuous Assimiltion obs obs obs obs obs obs nlysis + model

Sttisticl Approch to Dt Assimiltion

DARC

Dt Assimiltion Mde Simple sclr cse

Lest Squres Method Minimum Vrince re two mesurements the 0, 0 > < > < > < > >< < + + ε ε σ ε σ ε ε ε ε ε t t

Estimte of the observtio ns : t s liner combintio n + he nlysis should be unbised : < > t +

Lest Squres Method Continued subject to the constrint : men squred error by minimizing its Estimte + + > + < > + >< < t t t σ σ ε ε σ

Lest Squres Method Continued σ σ σ + σ σ σ + σ σ σ + he precision of the nlysis is the sum of the precisions of the mesurements he nlysis therefore hs higher precision thn ny single mesurement if the sttistics re correct

Vritionl Approch 0 for which the vlue of is + J J σ σ J

Mximum Likelihood Estimte Obtin or ssume probbility distributions for the errors he best estimte of the stte is chosen to hve the gretest probbility, or mximum likelihood If errors normlly distributed,unbised nd uncorrelted, then sttes estimted by minimum vrince nd mximum likelihood re the sme

Mximum Likelihood Approch Bysin Derivtion A s s u m e w e hve lredy mde n observtio n the bckground forecst in dt ssimiltion hen the probbilit y distributi on of the truth for Gussin error sttistics is :, p exp σ the prior pdf

Mximum Likelihood Continued Byes' s formul for the posterior p d f given the observtio n i s : p p p p exp σ exp σ since p Mximize We get the i s the normlisin g fctor independen t sme posterior nswer p d f minimizing the cost Equivlenc e holds for multi - dimension l cse s o r ln to estimte o f the function for truth Gussin sttistics

Simple Sequentil Assimiltion error vrince i s : nlysis the nd, by : given i s weight optiml he the " innovtion " i s where Let b o b b b o b o b o b W W W W σ σ σ σ σ + +

Comments he nlysis is obtined by dding first guess to the innovtion Optiml weight is bckground error vrince multiplied by inverse of totl vrince Precision of nlysis is sum of precisions of bckground nd observtion Error vrince of nlysis is error vrince of bckground reduced by - optiml weight

Simple Assimiltion Cycle Observtion used once nd then discrded Forecst phse to updte Anlysis phse to updte Obtin bckground s b t i+ M [ t i ] nd nd Obtin vrince of bckground s b b b i b i+ σ b σ σ t σ t lterntively σ t i+ σ t i

Simple Klmn Filter,,,,,,, M covrince i s : e r r o r bckground Forecst where M M hen bised! not model, ] [ before step s Anlysis Q M M M Q t M t i i b i b m i m i t i i t b i b m m i t i t + > < + + > < + + + + + σ ε σ ε ε ε ε ε ε

Multivrite Dt Assimiltion

Multivrite Cse x n x x t x stte vector y m y y t n vector observtio y

Stte Vectors x stte vector column mtrix x t true stte x b bckground stte x nlysis, estimte of x t

Ingredients of Good Estimte of the Stte Vector nlysis Strt from good first guess forecst from previous good nlysis Allow for errors in observtions nd first guess give most weight to dt you trust Anlysis should be smooth Anlysis should respect known physicl lws

Some Useful Mtrix Properties rnspose of product : A B B A Inverse of product : A B B A Inverse of trnspose : A A Positive definitene s s for symmetrix mtrix A : x, the sclr x A x > 0, unless x 0 this property is conserved through inversion

Observtions Observtions re gthered into n y observtion vector, clled the observtion vector Usully fewer observtions thn vribles in the model; they re irregulrly spced; nd my be of different kind to those in the model Introduce n observtion opertor to mp from model stte spce to observtion spce x H x

Errors

Vrince becomes Covrince Mtrix Errors in x i re often correlted sptil structure in flow dynmicl or chemicl reltionships Vrince for sclr cse becomes Covrince Mtrix for vector cse COV Digonl elements re the vrinces of x i Off-digonl elements re covrinces between x i nd x j Observtion of x i ffects estimte of x j

he Error Covrince Mtrix > < > < > < > < > < > < > < > < > < > < n n n n n n n n e e e e e e e e e e e e e e e e e e e e e e e e εε ε ε P i i e i e σ > <

Bckground Errors hey re the estimtion errors of the bckground stte: ε b x b x t B verge bis covrince < < ε b > ε < ε > ε < ε > b b >

Observtion Errors hey contin errors in the observtion process instrumentl error, errors in the design of H, nd representtiveness errors, ie discretizton errors tht prevent x t from being perfect representtion of the true stte ε y H x < ε > o t o R < ε < ε > ε < ε > o o o o >

Control Vribles We my not be ble to solve the nlysis problem for ll components of the model stte eg cloud-relted vribles, or need to reduce resolution he work spce is then not the model spce but the sub-spce in which we correct x b, clled control-vrible spce x x b + δx

Innovtions nd Residuls Key to dt ssimiltion is the use of differences between observtions nd the stte vector of the system We cll y H x b the innovtion We cll y H x the nlysis residul Give importnt informtion

Anlysis Errors hey re the estimtion errors of the nlysis stte tht we wnt to minimize ε x x t Covrince mtrix A

Using the Error Covrince Mtrix Recll tht n error covrince mtrix x for the error in hs the form: C C < εε > y H x H If where is mtrix, then the error covrince for y C HCH y is given by:

BLUE Estimtor he BLUE estimtor is given by: he nlysis error covrince mtrix is: Note tht: b b + + R H B H B H K x y K x x H K H B I A + + R H H R H B R H B H B H

Sttisticl Interpoltion with Lest Squres Estimtion Clled Best Liner Unbised Estimtor BLUE Simplified versions of this lgorithm yield the most common lgorithms used tody in meteorology nd ocenogrphy

Assumptions Used in BLUE Linerized observtion opertor: H x H x b H x x b B R nd re positive definite Errors re unbised: < x x >< y H x > b t t Errors re uncorrelted: < x x y H x > b t t Liner nlysis: corrections to bckground depend linerly on bckground obs Optiml nlysis: minimum vrince estimte 0 0

Optiml Interpoltion observtion observtion opertor x x b + K y H x b nlysis linerity H H bckground forecst mtrix inverse K B H H B H + R limited re

y H x b t obs point dt void x b

END