2019
DOI: 10.1016/j.jocs.2017.04.005
|View full text |Cite
|
Sign up to set email alerts
|

A parallel implementation of the ensemble Kalman filter based on modified Cholesky decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 34 publications
(18 citation statements)
references
References 13 publications
0
18
0
Order By: Relevance
“…In practice, localization methods can be utilized in order to mitigate the impact of sampling errors during the assimilation steps [8]. For instance, in the EnKF implementation based on a modified Cholesky decomposition (EnKF-MC) [9,10], the covariance matrix estimator proposed by Bickel and Levina in [11] and the conditional independence of model components regarding their spatial distances are exploited in order to estimate a sparse precision matrix of the background distribution, to reduce the computational cost of the analysis step, and to mitigate the impact of spurious correlations during the assimilation of observations. Given the relation between A and B −1 in (7b) and by using the Bickel and Levina estimator, we think that a sparse precision matrix of the analysis distribution can be estimated without the needing of actually computing (7b), and therefore, the assimilation of observations can be efficiently performed.…”
Section: Introductionmentioning
confidence: 99%
“…In practice, localization methods can be utilized in order to mitigate the impact of sampling errors during the assimilation steps [8]. For instance, in the EnKF implementation based on a modified Cholesky decomposition (EnKF-MC) [9,10], the covariance matrix estimator proposed by Bickel and Levina in [11] and the conditional independence of model components regarding their spatial distances are exploited in order to estimate a sparse precision matrix of the background distribution, to reduce the computational cost of the analysis step, and to mitigate the impact of spurious correlations during the assimilation of observations. Given the relation between A and B −1 in (7b) and by using the Bickel and Levina estimator, we think that a sparse precision matrix of the analysis distribution can be estimated without the needing of actually computing (7b), and therefore, the assimilation of observations can be efficiently performed.…”
Section: Introductionmentioning
confidence: 99%
“…In practice, localization methods are often used to artificially increase the degrees of freedom of P b and to mitigate the impact of sampling errors [12][13][14][15]. An efficient EnKF implementation which accounts for implicit localization during the assimilation step is the EnKF method based on a modified Cholesky decomposition (EnKF-MC) [16]. In this filter, the vanilla covariance (7d) is replaced by the Bickel and Levina estimator [17]:…”
Section: Ensemble Kalman Filters Based On Modified Cholesky Decomposimentioning
confidence: 99%
“…In the EnKF implementation based on a modified Cholesky decomposition (EnKF-MC) [10,11], the covariance matrix estimator proposed by Bickel and Levina in [12] and the conditional independence of model components regarding their spatial distances are exploited in order to obtain sparse Cholesky factors of the precision background error covariance matrix. This is done in order to reduce the computational cost of the analysis step, and to mitigate the impact of spurious correlations during the assimilation of observations.…”
Section: Efficient Formulation and Implementation Of Data Assimilatiomentioning
confidence: 99%