The search session has expired. Please query the service again.

The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations

Didier Auroux; Maëlle Nodet

ESAIM: Control, Optimisation and Calculus of Variations (2012)

  • Volume: 18, Issue: 2, page 318-342
  • ISSN: 1292-8119

Abstract

top
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.

How to cite

top

Auroux, Didier, and Nodet, Maëlle. "The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations." ESAIM: Control, Optimisation and Calculus of Variations 18.2 (2012): 318-342. <http://eudml.org/doc/277813>.

@article{Auroux2012,
abstract = {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. },
author = {Auroux, Didier, Nodet, Maëlle},
journal = {ESAIM: Control, Optimisation and Calculus of Variations},
keywords = {Data assimilation; inverse problems; linear transport equations; Burgers’ equation; data assimilation; linear transport equation; Burgers equation; back and forth nudging algorithm; convergence},
language = {eng},
month = {7},
number = {2},
pages = {318-342},
publisher = {EDP Sciences},
title = {The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations},
url = {http://eudml.org/doc/277813},
volume = {18},
year = {2012},
}

TY - JOUR
AU - Auroux, Didier
AU - Nodet, Maëlle
TI - The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations
JO - ESAIM: Control, Optimisation and Calculus of Variations
DA - 2012/7//
PB - EDP Sciences
VL - 18
IS - 2
SP - 318
EP - 342
AB - 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.
LA - eng
KW - Data assimilation; inverse problems; linear transport equations; Burgers’ equation; data assimilation; linear transport equation; Burgers equation; back and forth nudging algorithm; convergence
UR - http://eudml.org/doc/277813
ER -

References

top
  1. D. Auroux and J. Blum, Back and forth nudging algorithm for data assimilation problems. C. R. Acad. Sci. Paris Sér. I340 (2005) 873–878.  
  2. D. Auroux and J. Blum, A nudging-based data assimilation method for oceanographic problems : the back and forth nudging (BFN) algorithm. Nonlin. Proc. Geophys.15 (2008) 305–319.  
  3. D. Auroux and S. Bonnabel, Symmetry-based observers for some water-tank problems. IEEE Trans. Automat. Contr. (2010) DOI : .  URI10.1109/TAC.2010.2067291
  4. H. Brezis, Analyse fonctionnelle : théorie et applications. Dunod, Paris (1999).  
  5. R. Courant and D. Hilbert, Methods of Mathematical PhysicsII. Wiley-Interscience (1962).  
  6. L.C. Evans, Partial Differential Equations. American Mathematical Society, Providence (1998).  
  7. G. Evensen and P.J. van Leeuwen, An ensemble Kalman smoother for nonlinear dynamics. Mon. Weather Rev.128 (1999) 1852–1867.  
  8. B.-Z. Guo and W. Guo, The strong stabilization of a one-dimensional wave equation by non-collocated dynamic boundary feedback control. Automatica45 (2009) 790–797.  
  9. B.-Z. Guo and Z.-C. Shao, Stabilization of an abstract second order system with application to wave equations under non-collocated control and observations. Syst. Control Lett.58 (2009) 334–341.  
  10. J. Hoke and R.A. Anthes, The initialization of numerical models by a dynamic initialization technique. Mon. Weather Rev.104 (1976) 1551–1556.  
  11. R.E. Kalman, A new approach to linear filtering and prediction problems. Trans. ASME – J. Basic Eng.82 (1960) 35–45.  
  12. E. Kalnay, Atmospheric modeling, data assimilation and predictability. Cambridge University Press (2003).  
  13. M. Krstic, L. Magnis and R. Vazquez, Nonlinear control of the viscous burgers equation : Trajectory generation, tracking, and observer design. J. Dyn. Sys. Meas. Control131 (2009) 1–8.  
  14. F.-X. Le Dimet, and O. Talagrand, Variational algorithms for analysis and assimilation of meteorological observations : theoretical aspects. Tellus38A (1986) 97–110.  
  15. D. Luenberger, Observers for multivariable systems. IEEE Trans. Automat. Contr.11 (1966) 190–197.  
  16. Ph. Moireau, D. Chapelle and P. Le Tallec, Filtering for distributed mechanical systems using position measurements : perspectives in medical imaging. Inver. Probl.25 (2009) 035010.  
  17. K. Ramdani, M. Tucsnak and G. Weiss, Recovering the initial state of an infinite-dimensional system using observers. Automatica46 (2010) 1616–1625.  
  18. D.L. Russell, Controllability and stabilizability theory for linear partial differential equations : recent progress and open questions. SIAM Rev.20 (1978) 639–739.  
  19. A. Smyshlyaev and M. Krstic, Backstepping observers for a class of parabolic PDEs. Syst. Control Lett.54 (2005) 613–625.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.