Papers
Topics
Authors
Recent
Search
2000 character limit reached

A note on continuous data assimilation for stochastic convective Brinkman-Forchheimer equations in 2D and 3D

Published 25 Jan 2026 in math.PR, math.AP, and math.NA | (2601.17650v1)

Abstract: Continuous data assimilation (CDA) methods, such as the nudging algorithm introduced by Azouani, Olson, and Titi (AOT), have proven to be highly effective in deterministic settings for asymptotically synchronizing approximate solutions with observed dynamics. In this note, we introduce and analyze an algorithm for CDA for the two- and three-dimensional stochastic convective Brinkman-Forchheimer equations (CBFEs) driven by either additive or multiplicative Gaussian noise. The model is believed to provide an accurate description when the flow velocity exceeds the regime of validity of Darcy's law and the porosity remains moderately large. We derive sufficient conditions on the nudging parameter and the spatial resolution of observations that ensure convergence of the assimilated solution to the true stochastic flow. We demonstrate convergence in the mean-square sense, and additionally establish pathwise convergence in the presence of additive noise. The CBFEs, also known as Navier-Stokes equations with damping, exhibit enhanced stability properties due to the presence of nonlinear damping term. In particular, we show that nonlinear damping not only enables the implementation of CDA in three dimensions but also yields improved convergence results in two dimensions when compared to the classical Navier-Stokes equations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.