2019
DOI: 10.1029/2019ea000735
|View full text |Cite
|
Sign up to set email alerts
|

A Big Data‐Driven Nonlinear Least Squares Four‐Dimensional Variational Data Assimilation Method: Theoretical Formulation and Conceptual Evaluation

Abstract: A new nonlinear least squares four‐dimensional variational data assimilation method (NLS‐4DVar) is proposed incorporating the use of “big data.” This distinctive four‐dimensional ensemble‐variational data assimilation method (4DEnVar) is made up of two ensembles, a preprepared historical big data ensemble and a small “online” ensemble. The historical ensemble portrays both the ensemble‐constructed background error covariance and tangent models more accurately, as compared with the standard NLS‐4DVar method, wi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
23
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 13 publications
(25 citation statements)
references
References 31 publications
2
23
0
Order By: Relevance
“…The cost function (equations –) in terms of the new control β can be further transformed into the following format: J()β=12QboldβTQ()β based on the approximation of Lk()boldxHkMk()boldx, where Hk and Mk are the tangent linear models of H k and Mt0tk, respectively, after further calculations (see Tian & Zhang, , for details), where Q()β=()N1boldβR+,01/2[]Py0boldβyobs,0'R+,S1/2[]PySboldβyobs,S', …”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…The cost function (equations –) in terms of the new control β can be further transformed into the following format: J()β=12QboldβTQ()β based on the approximation of Lk()boldxHkMk()boldx, where Hk and Mk are the tangent linear models of H k and Mt0tk, respectively, after further calculations (see Tian & Zhang, , for details), where Q()β=()N1boldβR+,01/2[]Py0boldβyobs,0'R+,S1/2[]PySboldβyobs,S', …”
Section: Methodsmentioning
confidence: 99%
“…Thus, the Gauss‐Newton iteration scheme for the nonlinear least squares problem (equations and ) is defined by (Dennis & Schnabel, ) lefttrueboldβl=boldβl1[]()N1IN×N+k=0SPykTRk1()boldPyk1×N1boldβl1+false∑k=0S()boldPyknormalTboldRk1Lk'boldPxboldβl1boldyobs,k' for l = 1,⋯, l max , where l max is the maximum iteration number and I N × N denotes the N × N identity matrix (see Tian et al, , for further details). Tian and Zhang () localize equation as follows: lefttrueboldβρl=boldβρl1+false∑k=0S()ρy<e>Py,k*normalTLk'x',l1+false∑k=0S()ρy<e>Pyk#normalTboldRk1boldyobs,k'...…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations