2017
DOI: 10.1002/qj.2997
|View full text |Cite
|
Sign up to set email alerts
|

Parallelization in the time dimension of four‐dimensional variational data assimilation

Abstract: The current evolution of computer architectures towards increasing parallelism requires a corresponding evolution towards more parallel data assimilation algorithms. In this article, we consider parallelization of weak-constraint four-dimensional variational data assimilation (4D-Var) in the time dimension. We categorize algorithms according to whether or not they admit such parallelization and introduce a new, highly parallel weakconstraint 4D-Var algorithm based on a saddle-point representation of the underl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
81
2

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 45 publications
(84 citation statements)
references
References 40 publications
1
81
2
Order By: Relevance
“…Armed with these concepts and notation, we may now consider the original saddle technique as discussed in Fisher and Gürol () (and also used in (Freitag and Green, )). It is outlined as Algorithm 3.1, where we define r(δλ,δμ,δx)=boldDbold0boldLbold0boldRboldHLTHTbold0δbold-italicλδbold-italicμδboldxboldbbolddbold0. …”
Section: The Original Saddle Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…Armed with these concepts and notation, we may now consider the original saddle technique as discussed in Fisher and Gürol () (and also used in (Freitag and Green, )). It is outlined as Algorithm 3.1, where we define r(δλ,δμ,δx)=boldDbold0boldLbold0boldRboldHLTHTbold0δbold-italicλδbold-italicμδboldxboldbbolddbold0. …”
Section: The Original Saddle Methodsmentioning
confidence: 99%
“…A third version (the “saddle” formulation) is obtained by transforming the terms in Equation in a set of equality constraints and writing the Karush–Kuhn–Tucker conditions for the resulting constrained problem, leading to the large “saddle” linear system ()arrayDarray0arrayLarray0arrayRarrayHarrayboldLnormalTarrayboldHnormalTarray0()arrayδλarrayδμarrayδx=()arraybarraydarray0, where the control vector [ δ λ T , δ μ T , δ x T ] T is a (2 s + m )‐dimensional vector. For the sake of brevity, we do not cover the details of this latter derivation here (but see (Fisher and Gürol, ) and (Fisher et al. , )).…”
Section: Problem Formulations and Preconditioningmentioning
confidence: 99%
See 3 more Smart Citations