Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Perturbed-observation ensemble Kalman filter

Definition

Fix an ensemble size N≥2, forecast map Ψ, observation map G, datum y∈Rp, and observation covariance Γ≻0. The input is a state ensemble x1,…,xN∈Rd, forecast-error draws ξi that are independent across members and of the input ensemble, each with the caller-specified additive model-error law, and observation perturbations ηi∼Np(0,Γ) under Multivariate normal law, including singular covariance. The observation perturbations are independent across members and independent of the forecast ensemble and forecast-error draws.

  1. Forecast each member: x^i=Ψ(xi)+ξi.

  2. Form predicted observations zi=G(x^i), means xˉ=N−1∑ix^i, zˉ=N−1∑izi, and empirical covariance blocks Cxz=N−1∑i(x^i−xˉ)(zi−zˉ)T,Czz=N−1∑i(zi−zˉ)(zi−zˉ)T. The divisor-N convention is part of this algorithm.

  3. Form SN=Czz+Γ. Since Czz is positive semidefinite and Γ is positive definite, SN is positive definite. Factor it by Cholesky and solve SNKNT=CxzT by triangular solves.

  4. Update every member using its perturbed datum: xa,i=x^i+KN(y+ηi−zi).

Return the updated ensemble and its empirical mean and covariance. When G(x)=Hx, Cxz=CxHT and Czz=HCxHT, giving the usual sample-covariance Kalman gain. This item specifies the perturbed-observation variant; deterministic square-root updates are different finite-ensemble procedures. Finite ensembles in nonlinear models are approximations and carry no general posterior-exactness claim.

Depends on

Used by

Dependency tree · two levels

26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources