The Bleeps, the Sweeps, and the Creeps: Convergence Rates for Dynamic Observer Patterns via Data Assimilation for the 2D Navier-Stokes Equations

10/20/2021
by   Trenton Franz, et al.
0

We adapt a continuous data assimilation scheme, known as the Azouani-Olson-Titi (AOT) algorithm, to the case of moving observers for the 2D incompressible Navier-Stokes equations. We propose and test computationally several movement patterns (which we refer to as "the bleeps, the sweeps and the creeps"), as well as Lagrangian motion and combinations of these patterns, in comparison with static (i.e. non-moving) observers. In several cases, order-of-magnitude improvements in terms of the time-to-convergence are observed. We end with a discussion of possible applications to real-world data collection strategies that may lead to substantial improvements in predictive capabilities.

READ FULL TEXT

page 5

page 6

page 7

research
09/27/2022

A new reduced order model of imcompressible Stokes equations

In this paper we propose a new reduced order model (ROM) to the imcompre...
research
06/27/2019

Convergence rates for the numerical approximation of the 2D stochastic Navier-Stokes equations

We study stochastic Navier-Stokes equations in two dimensions with respe...
research
03/18/2021

A restricted additive Vanka smoother for geometric multigrid

The solution of saddle-point problems, such as the Stokes equations, is ...
research
10/29/2021

Numerical and convergence analysis of the stochastic Lagrangian averaged Navier-Stokes equations

The primary emphasis of this work is the development of a finite element...
research
11/30/2022

Space-time approximation of local strong solutions to the 3D stochastic Navier-Stokes equations

We consider the 3D stochastic Navier-Stokes equation on the torus. Our m...
research
03/06/2023

The second-best way to do sparse-in-time continuous data assimilation: Improving convergence rates for the 2D and 3D Navier-Stokes equations

We study different approaches to implementing sparse-in-time observation...
research
04/20/2023

Algebraic calming for the 2D Kuramoto-Sivashinsky equations

We propose an approximate model for the 2D Kuramoto-Sivashinsky equation...

Please sign up or login with your details

Forgot password? Click here to reset