Comparison of Data Assimilation Techniques for a Coupled Model of Surface and Subsurface Flow
Bibliographic record
Abstract
Data assimilation in the geophysical sciences refers to methodologies to optimally merge model predictions and observations. The ensemble Kalman filter (EnKF) is a statistical sequential data assimilation technique explicitly developed for nonlinear filtering problems. It is based on a Monte Carlo approach that approximates the conditional probability densities of the variables of interest by a finite number of randomly generated model trajectories. In Newtonian relaxation or nudging (NN), which can be viewed as a special case of the classic Kalman filter, model variables are driven toward observations by adding to the model equations a forcing term, or relaxation component, that is proportional to the difference between simulation and observation. The forcing term contains four‐dimensional weighting functions that can, ideally, incorporate prior knowledge about the characteristic scales of spatial and temporal variability of the state variable(s) being assimilated. In this study, we examined the EnKF and NN algorithms as implemented for a complex hydrologic model that simulates catchment dynamics, coupling a three‐dimensional finite element Richards' equation solver for variably saturated porous media and a finite difference diffusion wave approximation for surface water flow. We report on the retrieval performance of the two assimilation schemes for a small catchment in Belgium. The results of the comparison show that nudging, while more straightforward and less expensive computationally, is not as effective as the ensemble Kalman filter in retrieving the true system state. We discuss some of the strengths and weaknesses, both physical and numerical, of the NN and EnKF schemes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".