2002
DOI: 10.1175/1520-0493(2002)130<1913:edawpo>2.0.co;2
|View full text |Cite
|
Sign up to set email alerts
|

Ensemble Data Assimilation without Perturbed Observations

Abstract: The ensemble Kalman filter (EnKF) is a data assimilation scheme based on the traditional Kalman filter update equation. An ensemble of forecasts are used to estimate the background-error covariances needed to compute the Kalman gain. It is known that if the same observations and the same gain are used to update each member of the ensemble, the ensemble will systematically underestimate analysis-error covariances. This will cause a degradation of subsequent analyses and may lead to filter divergence. For large … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

16
1,356
0
5

Year Published

2007
2007
2016
2016

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 1,292 publications
(1,377 citation statements)
references
References 23 publications
(37 reference statements)
16
1,356
0
5
Order By: Relevance
“…However, this results in an analysis ensemble whose sample covariance is smaller than the analysis covariance P a given by (11), unless the observations are artificially perturbed so that each ensemble member is updated using different random realization of the perturbed observations [5,20]. Ensemble square-root filters [1,45,4,43,36,37] instead use more involved but deterministic algorithms to generate an analysis ensemble with the desired sample mean and covariance. As such, their analyses coincide exactly with the Kalman filter equations in the linear scenario of the previous section.…”
Section: Notation We Start With An Ensemble {X A(i)mentioning
confidence: 99%
See 2 more Smart Citations
“…However, this results in an analysis ensemble whose sample covariance is smaller than the analysis covariance P a given by (11), unless the observations are artificially perturbed so that each ensemble member is updated using different random realization of the perturbed observations [5,20]. Ensemble square-root filters [1,45,4,43,36,37] instead use more involved but deterministic algorithms to generate an analysis ensemble with the desired sample mean and covariance. As such, their analyses coincide exactly with the Kalman filter equations in the linear scenario of the previous section.…”
Section: Notation We Start With An Ensemble {X A(i)mentioning
confidence: 99%
“…Localization is generally done either explicitly, considering only the observations from a region surrounding the location of the analysis [29,20,30,1,36,37], or implicitly, by multiplying the entries in P b by a distance-dependent function that decays to zero beyond a certain distance, so that observations do not affect the model state beyond that distance [21,17,45]. We will follow the explicit approach here, doing a separate analysis for each spatial grid point of the model.…”
Section: Localizationmentioning
confidence: 99%
See 1 more Smart Citation
“…This partly accounts for the nonlinear nature of the model (Anderson 2012). Stochastic EnKFs (Burgers et al 1998;Houtekamer and Mitchell 1998) introduce additional sampling errors (Whitaker and Hamill 2002). In contrast, deterministic EnKFs (Tippett et al 2003) transform the prior ensemble such that its first two moments exactly match the theoretical KF values.…”
Section: A Linear Filtering and The Etkfmentioning
confidence: 99%
“…The overlapping observation regions of different local domains ensure that the covariances in the ensemble covariance matrix are taken into account. Mathematically, the observation impact is reduced with distance by multiplying R 21 by an appropriate correlation function through the use of a Schur product (Whitaker and Hamill 2002;Kirchgessner et al 2014). This term appears in Eqs.…”
Section: Localization and Inflationmentioning
confidence: 99%