Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

4D-Var: fitting a model trajectory to a window of observations

esmax · ocean · 3 · Strong-constraint 4D-Var: intuition, the cost as a negative log posterior, the adjoint, and classic, incremental and reduced-basis algorithms

Abstract

Four-dimensional variational assimilation (4D-Var) asks one question: which initial state, run forward through the model, best explains every observation in a time window without straying far from what we believed before? This page is the background for the learned data assimilation page, and it covers the intuition, the mathematics, how the gradient is computed, three classic algorithms, and how all of it maps onto an ocean problem.

Keywords:4D-Varstrong constraintadjointincremental 4D-Varreduced basisdiffraxcheckpointingvardax

Open the full page

Where it sits. Background for box 2 when the model is trusted: the cost, its gradient, and how to minimise it. The full page is a self-contained document with operator boxes (inputs, outputs, shapes and units), figures and code sketches, which opens on its own and links back here.

TL;DR: One cost, one gradient, three ways to minimise

On the page

  1. Intuition

  2. Where it comes from

  3. The mathematics

  4. Computing the gradient

  5. Algorithm 1 · Classic 4D-Var

  6. Algorithm 2 · Incremental 4D-Var

  7. Algorithm 3 · Reduced-basis 4D-Var

  8. The three side by side

  9. Application: the Gulf Stream window

  10. Notes on vardax, from reading the code