Volume 18, Number 2, April-June 2012
|Page(s)||318 - 342|
|Published online||19 January 2011|
The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations
Laboratoire Dieudonné, Université de Nice Sophia
Nice Cedex 2,
2 INRIA, Grenoble, France
3 Université de Grenoble, Laboratoire Jean Kuntzmann, UMR 5224, Grenoble, France
Revised: 20 September 2010
In this paper, we consider the back and forth nudging algorithm that has been introduced for data assimilation purposes. It consists of iteratively and alternately solving forward and backward in time the model equation, with a feedback term to the observations. We consider the case of 1-dimensional transport equations, either viscous or inviscid, linear or not (Burgers’ equation). Our aim is to prove some theoretical results on the convergence, and convergence properties, of this algorithm. We show that for non viscous equations (both linear transport and Burgers), the convergence of the algorithm holds under observability conditions. Convergence can also be proven for viscous linear transport equations under some strong hypothesis, but not for viscous Burgers’ equation. Moreover, the convergence rate is always exponential in time. We also notice that the forward and backward system of equations is well posed when no nudging term is considered.
Mathematics Subject Classification: 35Q35 / 35R30 / 65M32
Key words: Data assimilation / inverse problems / linear transport equations / Burgers’ equation
© EDP Sciences, SMAI, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.