2021
DOI: 10.1007/s11004-021-09951-z
|View full text |Cite
|
Sign up to set email alerts
|

A Graph Clustering Approach to Localization for Adaptive Covariance Tuning in Data Assimilation Based on State-Observation Mapping

Abstract: An original graph clustering approach for the efficient localization of error covariances is proposed within an ensemble-variational data assimilation framework. Here, the localization term is very generic and refers to the idea of breaking up a global assimilation into subproblems. This unsupervised localization technique based on a linearized state-observation measure is general and does not rely on any prior information such as relevant spatial scales, empirical cutoff radii or homogeneity assumptions. Loca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1
1
1

Relationship

2
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 52 publications
0
4
0
Order By: Relevance
“…Note that without emulators, we would have to run these simulations in OpenMalaria, which would not have been feasible due to computational requirements. We then used the function soboljansen from the R package ‘sensitivity’ to perform the global sensitivity analysis with 150,000 bootstrap replicates and the two datasets ( Cheng et al, 2021 ). With this function, we estimated first-order and total Sobol' indices simultaneously.…”
Section: Methodsmentioning
confidence: 99%
“…Note that without emulators, we would have to run these simulations in OpenMalaria, which would not have been feasible due to computational requirements. We then used the function soboljansen from the R package ‘sensitivity’ to perform the global sensitivity analysis with 150,000 bootstrap replicates and the two datasets ( Cheng et al, 2021 ). With this function, we estimated first-order and total Sobol' indices simultaneously.…”
Section: Methodsmentioning
confidence: 99%
“…Then, we predicted the selection coefficient for each parameter combination using the emulators that could efficiently predict the selection coefficient for all these parameter combinations compared to our model. Finally, we performed the global sensitivity analysis on the datasets with 150,000 bootstrap replicates using the function soboljansen from the R-package Sensitivity 29 . This function returned the first-order indices of each factor, representing their relative influence on the selection coefficient (Fig.…”
Section: Supplementary Informationmentioning
confidence: 99%
“…In past two years, online LA has raised significant research attention. For sparse and unstructured data, domain decomposition techniques [228] can also be used to reduce the problem dimension, for example, via community detection through a connection graph [229], [230].…”
Section: B ML and Da With Rommentioning
confidence: 99%