Higher Accuracy Modular Data Assimilation for the Navier-Stokes Equations

Troy Yang

REVIEW 3 major objections 3 minor 16 references

Higher Accuracy Modular Data Assimilation for the Navier-Stokes Equations

T0 review · 3 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read BDF2 modular nudging for Navier-Stokes is provably second-order accurate and costs about half as much as standard coupled nudging.

desk verdict A useful BDF2 extension of modular nudging with a correct explicit analysis step for projections; the error analysis needs cleanup but the numerical evidence is solid enough to warrant review. read the letter →

arxiv 2606.19508 v2 pith:MKAWC2MD submitted 2026-06-17 math.NA cs.NA

Troy Yang This is my paper · ORCID

classification math.NAcs.NA MSC 65M0676D05

keywords dataassimilationnudgingNavier-StokesequationsBDF2timediscretizationmodulartwo-steperroranalysisstabilitycomputationalcomplexity

topics Navier-Stokes Regularity

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper aims to show that modular (two-step) nudging—a data assimilation method that separates the Navier-Stokes forecast from the observation-correction analysis step—can be made second-order accurate in time by using BDF2 time discretization, while keeping the analysis step explicit and cheap. The central mathematical claim is that under the stated observation-resolution, time-step, and nudging-strength conditions, the error satisfies $||e^N|| = O(\Delta t^2)$ and does not grow over time. The numerical experiments support the claim that this modular scheme matches the accuracy of standard, fully coupled nudging in 2D flows while cutting CPU time by roughly half. A sympathetic reader would care because data assimilation for high-Reynolds flows is expensive, and a split that preserves accuracy at lower cost could make nudging practical for larger simulations. The cost savings come from the idempotent-projection identity $I_H = I_H^2$, which makes the analysis step an explicit projection rather than a coupled linear solve.

What carries the argument

The load-bearing object is the two-step modular update: a BDF2 forecast step for the Navier-Stokes equations produces an intermediate velocity $\tilde v^{n+2}$, and an analysis step nudges it toward observations. Under the idempotence condition $I_H=I_H^2$ (true for $L^2$ projection onto the observation space), the analysis step collapses to the explicit formula $v^{n+2}=\tilde v^{n+2}+\frac{2\Delta t \chi}{3+2\Delta t \chi}I_H(u(t^{n+2})-\tilde v^{n+2})$, which has the stability of an implicit update at the cost of an explicit one. The proofs convert the analysis-step identities (polarization identities and Lemma 2.1's algebraic identity) into energy-dissipation terms, so the error estimates are built from the same mechanis

What would settle it

In Experiment 2, rerun with observation spacing $H$ refined below the threshold $\nu - \frac{8}{7} \frac{U}{l} C^2 H^2 > 0$; if the sharp error jump at $t \approx 1$ persists, the $H$-condition is not the controlling mechanism. Alternatively, in Experiment 1, compute the error at $\Delta t = 1/64$ and $1/128$ on the same fine mesh; if the convergence rate drops below about 1.9, the claimed $O(\Delta t^2)$ rate is not realized in practice.

Watch

Extended reading notes

Core claim

The paper's central discovery is that modular nudging is not limited to the backward Euler time discretization used in earlier work. With BDF2 in the forecast step and the analysis step written as $v^{n+2} = \tilde v^{n+2} + \frac{2\Delta t \chi}{3+2\Delta t \chi} I_H(u(t^{n+2}) - \tilde v^{n+2})$, the scheme is stable (Theorem 4.2), and under either of two sets of conditions—one with no time-step restriction but a Reynolds-number bound, and one with a small-time-step plus observation-resolution condition—the velocity error is $O(\Delta t^2)$ and remains bounded over time (Corollaries 5.4.2 and 5.5.1). The explicit analysis step holds when $I_H$ is an $L^2$ projection with $I_H=I_H^2$; if not, the formula carries a consistency-error

Load-bearing premise

The observations must be dense enough relative to the flow's speed and viscosity: if the spacing $H$ is too large, the proven second-order error bound simply does not apply, and the author conjectures that is exactly what causes the error jump after $t \approx 1$ in Experiment 2.

Editorial extensions

If this is right

If the central claim holds, modular BDF2 nudging is a drop-in replacement for standard nudging that preserves second-order time accuracy, allowing larger time steps at the same target error.
The roughly 50% CPU-time reduction in the reported 2D tests means the same forecasting budget can be spent on finer meshes or longer time horizons.
The uniform-in-time error bounds mean the assimilation error does not accumulate with forecast length, so the method is suited to long-time prediction and climate-type integrations.
The explicit analysis step means adding nudging to an existing Navier-Stokes solver requires only an interpolation/projection operator, not a coupled system solve, simplifying implementation.
The theoretical conditions give practical guidance on choosing observation spacing H, time step Δt, and nudging strength χ to stay in the convergent regime.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A natural extension the paper leaves implicit is adaptive selection of H and χ: if the Experiment 2 conjecture is right, refining the observation spacing only around t≈1 would suppress the error spike without a global cost increase.
The explicit correction formula suggests a multirate version where analysis steps are applied every few forecast steps; because the analysis step is stable and cheap, less frequent assimilation could be tested without re-deriving the coupled algorithm.
The Appendix A commutativity obstruction suggests that an alternate analysis step with viscous or turbulent correction terms would become analyzable if one used a projection operator commuting with the resolvent; that is a concrete open problem rather than a proven limitation.
The experiments are 2D; in 3D the H-condition becomes more restrictive (H² appears in the denominator), so the practical accuracy advantage would need demonstration on 3D benchmark flows.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: this is a decent incremental paper. It takes the modular nudging idea from Cibik-Fang-Layton (backward Euler) and adds a BDF2 variant, with stability and error estimates and numerical tests. The central operational result—the explicit analysis step when I_H is an idempotent L2 projection—is correct. The experiments support the main practical claim: BDF2 modular nudging gives about the same accuracy as standard nudging at roughly half the CPU time. That is a genuine, if modest, contribution.

Where the paper is solid: the stability argument is standard but careful; the numerical experiments are straightforward and the CPU savings are consistent; the author is honest about limitations, including explicitly conjecturing that the H-condition is not satisfied in one experiment.

Where it is soft. First, the proof of Proposition 3.1 uses identity (3.7), which is wrong as written—the sign inside the inverse is opposite to what appears in (3.6). The explicit formula (3.8) for the idempotent case is still correct and can be verified by direct substitution, and the general formula (3.3) may actually be correct as an implicit identity, but the derivation given is not. That needs fixing. Second, Corollaries 5.4.2 and 5.5.1 state ||e^N|| = O(Δt^2) while the theorems' right-hand sides include initial error terms that are not O(Δt^2) unless separately assumed. This is a standard overstatement; it should be phrased as 'up to initial errors.' Third, Experiments 2 and 3 run at Re=1000, which sits outside the H-condition required by Theorem 5.5, and H is not reported. The author is upfront about this, but it does mean the theory does not cover the most demanding tests. The experiments are still meaningful as numerical evidence, but the reader should not take the error bounds as applying there.

The citation pattern looks fine; the paper leans on [2] and [13] appropriately and does not invent anything. I saw no machine-checked proofs or released code, but the numerical setup is described well enough to reproduce.

Bottom line: the paper deserves a serious referee. It is not a breakthrough, but it is a legitimate extension with a correct core result and useful experiments. I would ask for corrections to Proposition 3.1, a more careful statement of the convergence-rate corollaries, and a discussion of the H-condition in the high-Re experiments, then accept.

Referee Report

3 major / 3 minor

Summary. The paper develops a BDF2-based modular (forecast–analysis) nudging method for the Navier–Stokes equations. The analysis step is written in explicit form under the assumption that the interpolant/observation operator I_H is an L2 projection (I_H=I_H^2). Stability estimates (finite-time and time-averaged) and two error estimates are proved, both giving O(Δt^2) convergence with errors that do not grow in time. Three numerical experiments are reported: a convergence test with an analytic solution, a flow between offset cylinders at Re=1000, and a pipe-cavity flow at Re=1000. The experiments are claimed to show second-order temporal accuracy, comparable accuracy to standard fully coupled nudging, and roughly a factor-of-two reduction in CPU time.

Significance. If the proofs and experiments are correct, the paper makes a useful contribution: it extends the recently introduced modular nudging framework from backward Euler to BDF2, gives a simple explicit analysis step, and provides numerical evidence of accuracy and cost savings. The proof strategy is largely standard (energy estimates with BDF2 identities), and the paper is transparent about limitations, including a conjecture that the H-condition is violated in one experiment. However, the current manuscript contains a false operator identity in the derivation of the explicit analysis step, an unstated regularity assumption in the error estimates, and a mismatch between the theoretical conditions and the high-Re experiments. These issues need to be fixed before the central claims can be accepted.

major comments (3)

[§3, Eq. (3.7)] The inversion identity (3.7) is algebraically false. With a=2Δtχ/3 and P=I_H, the displayed formula asserts (I−aP)^{-1}P = (1/(1+a))P + (a/(1+a))(P−P^2); for an idempotent projection this reduces to (1/(1+a))P, whereas the correct value is (1/(1−a))P. Moreover, (3.6) contains (3I+2ΔtχP)^{-1} = (1/3)(I+aP)^{-1}, not (I−aP)^{-1}. The derivation of (3.3) therefore does not follow. The final formula (3.3) is in fact true and can be verified by direct substitution into (3.1); the proof should be rewritten to avoid the false identity.
[§5, Eqs. (5.24) and (5.34)] The estimate |(e·∇u,e)| ≤ ||e|| ||∇u||∞ ||e|| ≤ (U/l)||e||^2 is used to absorb the nonlinear term. But §2 defines U=ess sup ||u|| and l=U/(ess sup ||∇u||), with ||·|| the L2 norm; hence U/l = ess sup ||∇u||, which does not control ||∇u||∞. No assumption in Theorems 5.4/5.5 bounds ∇u in L∞. This is load-bearing: without this bound the nonlinear term cannot be converted into the positive coefficient shown, and the O(Δt^2) error estimates are not established. Please add an explicit regularity assumption (e.g., ∇u∈L∞(Ω×(0,T)) with ||∇u||∞ ≤ U/l) and align the definitions of U and l.
[§6.2–6.3] Experiments 2 and 3 are run at Re=1000 (ν=10^{-3}, U=L=1), but the observation scale H is not reported. The author states in §6.2: 'We conjecture that the sharp growth in relative error at t≈1 is due to H-condition not being satisfied.' That is the condition ν − (8/7)(U/l)C^2H^2>0 required by Theorem 5.5. Thus the numerical evidence for the central accuracy claim is, by the author's own conjecture, in a regime where the proved error estimates do not apply. Please report H (and the constant C in (2.1)) and check the condition; if it is violated, present the high-Re results as outside the theory and discuss the implications.

minor comments (3)

[§5, Theorem 5.4, Eq. (5.19)/(5.30)] Coefficient inconsistency: the Young inequality (5.25) has ν/8; after multiplication by 4Δt this contributes (ν/2)Δt, so the total viscous coefficient is 7/2ν, not 31/8ν. Please correct the theorem and proof.
[§5, Corollaries 5.4.2 and 5.5.1] The conclusion ||e^N||=O(Δt^2) follows only if the initial error terms ||e^1||, ||2e^1−e^0||, ||I_H e^0||, etc. are O(Δt^2) (or zero). State this hypothesis explicitly in the corollaries.
[Throughout] Minor typos: 'approxmiate' (§1), 'satisifies' (§5), duplicate 'after after' (§6.3). Also, the figures are referenced but not reproduced in the manuscript text; please ensure they are included in the final version.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found; the BDF2 modular-nudging derivation is self-contained.

full rationale

The paper's central derivation chain is not circular. The explicit analysis-step formula (3.2) is obtained by algebraically solving the analysis equation (1.5) under the stated projector condition I_H = I_H^2, and the stability and error estimates in Theorems 4.2, 5.4, and 5.5 are proved from the discretized Navier-Stokes equations and the analysis-step identity; they do not assume the conclusion. The external lemmas (Lemma 2.1, Lemma 2.2) are cited from Rong and Fiordilino [13], whose authors do not overlap with the present paper, and the modular-nudging framework is credited to Cibik, Fang, and Layton [2], also external. No parameter is fitted to reproduce a target result: the nudging parameter χ, observation scale H, viscosity ν, and time step Δt are all inputs, and the numerical experiments compare modular nudging with standard nudging on benchmark flows without tuning to force agreement. The issue that Experiments 2 and 3 may violate the H-condition is a correctness limitation explicitly acknowledged by the author, not a circular step. Therefore no prediction reduces by construction to an input, and no load-bearing self-citation or renamed known result is present.

Assumptions & free parameters 2 free parameters · 6 assumptions · 0 invented entities

The central claims rest on the projection/idempotence assumption, the approximation property of I_H, the regularity and smallness conditions, and the (erroneous) inversion identity. No new entities are postulated.

free parameters (2)

χ (nudging gain) = 1 and 10^4 in experiments; arbitrary positive constant in theory
The analysis treats χ as any positive constant (subject to an interval condition in Theorem 5.5). In experiments it is set to 1 and 10^4 by hand; it is a method parameter, not fitted to data.
H (observation mesh width) = not reported in experiments; appears in theory via condition (2.1) and Theorem 5.5
The observation resolution H enters the approximation property (2.1) and the smallness condition Re < (7/8) lL/(C²H²). The paper does not state H for the numerical tests, so the H-condition is not verified.

assumptions (6)

domain assumption I_H is an L2 orthogonal projection onto a finite element space X_H, so I_H² = I_H and I_H is self-adjoint
Used throughout Sections 3–6: the explicit analysis step (3.8), the stability proof (4.15), and the error identities (5.1)–(5.2) all require idempotence and self-adjointness of I_H.
domain assumption Approximation property (2.1): ||(I−I_H)w|| ≤ C H ||∇w||
Invoked in the proof of Theorem 5.5, Eq (5.34), to bound the unresolvable part of the error. If the observation space is too coarse, the H-condition fails and the error estimate collapses.
standard math Lemma 2.1 identity (2.4) and Lemma 2.2 BDF2 consistency bound (2.5), taken from Rong and Fiordilino [13]
These algebraic identities are used in the stability (Section 4) and error (Section 5) proofs without proof. They are external cited lemmas.
domain assumption True solution regularity: u_{ttt} ∈ L²(0,T; H^{-1}) and U/l = ‖∇u‖_∞ finite
The error estimates (5.19), (5.33) are stated in terms of ∫||u_{ttt}||²_{-1} dt; the nonlinear-term bounds use U/l. Without this regularity the second-order consistency estimate (2.5) is not available.
domain assumption Smallness conditions: Re < (31/32) l/(C_P² L) (Thm 5.4) and Re < (7/8) lL/(C²H²), Δt ≤ (3/8) l/U, χ in [χ1,χ2] (Thm 5.5)
These conditions make the LHS coefficients of ||∇\tilde e^{n+2}||² and ||I_H e^{n+2}||² nonnegative. The experiments at Re=1000 do not check whether they hold; the author conjectures the H-condition is violated (§6.2).
ad hoc to paper Operator inversion identity (3.7): (I − a I_H)^{-1} I_H = (1/(1+a)) I_H + (a/(1+a))(I_H − I_H²)
Used to prove Proposition 3.1. The identity is algebraically false for a general operator I_H: multiplying the RHS by (I − a I_H) leaves extra I_H² and I_H³ terms. Since (3.3) is derived from it, the general explicit formula is not a valid solution of the analysis step when I_H ≠ I_H². The special case I_H = I_H², which gives (3.8), is correct and is what the experiments implement.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Higher Accuracy Modular Data Assimilation for the Navier-Stokes Equations." pith.science (2026). https://pith.science/paper/MKAWC2MD

@misc{pith2026260619508,
  author       = {Pith},
  title        = {Pith review of: Higher Accuracy Modular Data Assimilation for the Navier-Stokes Equations},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MKAWC2MD}},
  note         = {Machine review of arXiv:2606.19508}
}

abstract

This paper develops an accurate and effective combination of second order backward differentiation time discretization (BDF2) with modular, 2-step nudging-based data assimilation \begin{align} \text{Forecast step: } \quad &\frac{3\widetilde{v}^{n+2}-4v^{n+1}+v^n}{2\Delta t}+\widetilde{v}^{n+2} \cdot \nabla \widetilde{v}^{n+2} - \nu \Delta \widetilde{v}^{n+2} + \nabla q^{n+2}=f(x) \notag \\ &\nabla \cdot \widetilde{v}^{n+2} = 0 \notag \\ \text{Analysis step: } \quad &\frac{3v^{n+2}-3\widetilde{v}^{n+2}}{2\Delta t}-\chi I_H(u(t^{n+2})-v^{n+2})=0. \notag \end{align} If $I_H=I_H^2$, the analysis step can be made explicit, taking the form \begin{align} v^{n+2}=\widetilde{v}^{n+2}+\frac{2\Delta t\chi}{3+2\Delta t\chi}I_H(u^{n+2}-\widetilde{v}^{n+2}). \notag \end{align} This implies the analysis step has the stability property of an implicit step and lower complexity than an explicit analysis step. Stability and error estimates for the BDF2 scheme are presented along with their proofs. Numerical experiments are conducted to assess the performance of BDF2 modular assimilation algorithm. The results of the experiments support the conclusion that modular data assimilation has comparable accuracy to standard, fully coupled data assimilation while greatly reducing computational complexity and cost.

Figures

Figures reproduced from arXiv: 2606.19508 by the authors.

**Figure 1.** For χ = 1, modular nudging performs similar to standard nudging but better than without nudging. For χ = 1, the relative errors for modular, standard, and without nudging decrease to around O(10−2.5 ) from t = 0 to t = 1. After t = 1, the errors sharply increase and saturate at around O(10−0.5 ). We observe comparable longtime performance for modular and standard nudging, with both performing better than without nud… view at source ↗

**Figure 2.** For χ = 104 , modular nudging performs better than standard nudging in short time but similar in long time, both performing better than without nudging. For χ = 104 , the relative error for modular, standard, and without nudging decrease to O(10−3 ) from t = 0 to t = 1, with modular nudging performing the best. After t = 1, errors for modular and standard nudging increase and saturate at around O(10−1 ). Without nud… view at source ↗

**Figure 3.** Pipe cavity domain. Figures are plotted starting the second step to exclude the initial error being undefined on log scale. The numerical results are as follows. 20 [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗

Figures from the paper (4 more)

**Figure 4.** Figure 4: For χ = 1, modular nudging shares similar performance as standard nudging, both performing much better than without nudging. For χ = 1, the relative errors for the modular and standard nudging grow to O(10−0.6 ) at t = 2 and decrease afterwards. The errors for both met…

**Figure 5.** Figure 5: For χ = 104 , modular nudging performs better than standard nudging and much better than without nudging. For χ = 104 , the relative errors for the modular and standard nudging quickly decrease after after initial calculations. The errors for both methods saturate arou…

**Figure 6.** Figure 6: For χ = 1, modular nudging performs similar to standard nudging with both performing better than without nudging. For χ = 1, the relative errors for the modular and standard nudging hover around O(10−0.8 ) and saturate at O(10−1 ). The relative error for without nudgi…

**Figure 7.** Figure 7: For χ = 104 , modular nudging performs better than standard nudging and much better than without nudging. For χ = 104 , the relative errors for the modular and standard nudging decrease steadily and saturate at around O(10−1.5 ). The relative error for without nudging …

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

16 extracted references

[2]

Modular data assimilation for flow predic- tion,

A. Cibik, R. Fang, and W. Layton, “Modular data assimilation for flow predic- tion,”Numerical Methods for Partial Differential Equations, vol. 40, no. 1, 2026, DOI: https://doi.org/10.1002/num.70066

doi:10.1002/num.70066 2026
[13]

Numerical analysis of a BDF2 modular grad–div stabiliza- tion method for the Navier–Stokes equations,

Y. Rong and J. A. Fiordilino, “Numerical analysis of a BDF2 modular grad–div stabiliza- tion method for the Navier–Stokes equations,”J Sci Comput, vol. 82, no. 66, 2020, DOI: https://doi.org/10.1007/s10915-020-01165-5

doi:10.1007/s10915-020-01165-5 2020
[1]

Kalnay,Atmospheric modeling, data assimilation and predictability

E. Kalnay,Atmospheric modeling, data assimilation and predictability. Cambridge Uni- versity Press, 2003

2003
[3]

Observing the state of a linear system,

D. G. Luenberger, “Observing the state of a linear system,”IEEE Transactions on Military Electronics, vol. 8, no. 2, 1964, 74-80

1964
[4]

Continuousdataassimilationusinggeneralinterpolant observables,

A.Azouani, E.Olson, andE.S.Titi, “Continuousdataassimilationusinggeneralinterpolant observables,”Journal of Nonlinear Science, vol. 24, 2014, 277-304

2014
[5]

Continuous data assimilation for the three-dimensional Navier- Stokes equations,

A. Biswas and R. Price, “Continuous data assimilation for the three-dimensional Navier- Stokes equations,”SIAM Journal on Mathematical Analysis, vol. 53, no. 6, 2021, 6697-6723

2021
[6]

Continuous data assimilation for the 3D Ladyzhenskaya model: analysis and computations,

Y. Cao, A. Giorgini, M. Jolly, and A. Pakzad, “Continuous data assimilation for the 3D Ladyzhenskaya model: analysis and computations,”Nonlinear Analysis: Real World Appli- cations, vol. 68, 2022, 103659

2022
[7]

Global in time stability and accuracy of IMEX-FEM data assimilation schemes for Navier-Stokes equations,

A. Larios, L. G. Rebholz, and C. Zerfas, “Global in time stability and accuracy of IMEX-FEM data assimilation schemes for Navier-Stokes equations,”Computer Methods in Applied Mechanics and Engineering, vol. 345, 2019, 1077-1093

2019

Show all 16 references

[8]

The initialization of numerical models by a dynamic- initialization technique,

J. E. Hoke and R. A. Anthes, “The initialization of numerical models by a dynamic- initialization technique,”Monthly Weather Review 104 (12), 1976, 1551-1556

1976
[9]

Nudging methods: A critical overview,

S. Lakshmivarahan and J. M. Lewis, “Nudging methods: A critical overview,”Data Assim- ilation for Atmospheric, Oceanic and Hydrologic Applications, vol. II, 2013, 27-57

2013
[10]

Practical and theoretical aspects of adjoint parameter estimation and identi- fiability in meteorology and oceanography,

I. M. Navon, “Practical and theoretical aspects of adjoint parameter estimation and identi- fiability in meteorology and oceanography,”Dynamics of Atmospheres and Oceans 27 (1-4), 1998, 55-79

1998
[11]

Optimal determination of nudging coefficients using the adjoint equations,

D. R. Stauffer and J.-W. Bao, “Optimal determination of nudging coefficients using the adjoint equations,”Tellus A 45 (5), 1993, 358-369

1993
[12]

An optimal nudging data assimilation scheme using parameter estimation,

X. Zou, I. Navon, and F. LeDimet, “An optimal nudging data assimilation scheme using parameter estimation,”Quarterly Journal of the Royal Meteorological Society 118 (508), 1992, 1163-1186

1992
[14]

Adapative parameter selection in nudging based data assimilation,

A. Cibik, R. Fang, W. Layton, and F. Siddiqua, “Adapative parameter selection in nudging based data assimilation,”Computer Methods in Applied Mechanics and Engineering, 2025, 433:117526

2025
[15]

Adaptive defect-correction methods for viscous incompressible flow problems,

V. J. Ervin, W. J. Layton, and J. M. Maubach, “Adaptive defect-correction methods for viscous incompressible flow problems,”SIAM J. Numer. Anal., 2000

2000
[16]

John,Finite element methods for incompressible flow problems

V. John,Finite element methods for incompressible flow problems. Springer, 2016. 27

2016

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.

[1] [2]

Modular data assimilation for flow predic- tion,

A. Cibik, R. Fang, and W. Layton, “Modular data assimilation for flow predic- tion,”Numerical Methods for Partial Differential Equations, vol. 40, no. 1, 2026, DOI: https://doi.org/10.1002/num.70066

doi:10.1002/num.70066 2026

[2] [13]

Numerical analysis of a BDF2 modular grad–div stabiliza- tion method for the Navier–Stokes equations,

Y. Rong and J. A. Fiordilino, “Numerical analysis of a BDF2 modular grad–div stabiliza- tion method for the Navier–Stokes equations,”J Sci Comput, vol. 82, no. 66, 2020, DOI: https://doi.org/10.1007/s10915-020-01165-5

doi:10.1007/s10915-020-01165-5 2020

[3] [1]

Kalnay,Atmospheric modeling, data assimilation and predictability

E. Kalnay,Atmospheric modeling, data assimilation and predictability. Cambridge Uni- versity Press, 2003

2003

[4] [3]

Observing the state of a linear system,

D. G. Luenberger, “Observing the state of a linear system,”IEEE Transactions on Military Electronics, vol. 8, no. 2, 1964, 74-80

1964

[5] [4]

Continuousdataassimilationusinggeneralinterpolant observables,

A.Azouani, E.Olson, andE.S.Titi, “Continuousdataassimilationusinggeneralinterpolant observables,”Journal of Nonlinear Science, vol. 24, 2014, 277-304

2014

[6] [5]

Continuous data assimilation for the three-dimensional Navier- Stokes equations,

A. Biswas and R. Price, “Continuous data assimilation for the three-dimensional Navier- Stokes equations,”SIAM Journal on Mathematical Analysis, vol. 53, no. 6, 2021, 6697-6723

2021

[7] [6]

Continuous data assimilation for the 3D Ladyzhenskaya model: analysis and computations,

Y. Cao, A. Giorgini, M. Jolly, and A. Pakzad, “Continuous data assimilation for the 3D Ladyzhenskaya model: analysis and computations,”Nonlinear Analysis: Real World Appli- cations, vol. 68, 2022, 103659

2022

[8] [7]

Global in time stability and accuracy of IMEX-FEM data assimilation schemes for Navier-Stokes equations,

A. Larios, L. G. Rebholz, and C. Zerfas, “Global in time stability and accuracy of IMEX-FEM data assimilation schemes for Navier-Stokes equations,”Computer Methods in Applied Mechanics and Engineering, vol. 345, 2019, 1077-1093

2019