An easy-to-implement and efficient data assimilation method for the identification of the initial condition: the Back and Forth Nudging (BFN) algorithm - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

An easy-to-implement and efficient data assimilation method for the identification of the initial condition: the Back and Forth Nudging (BFN) algorithm

(1, 2) , (3) , (3)
1
2
3

Abstract

This paper deals with a new data assimilation algorithm called the Back and Forth Nudging. The standard nudging technique consists in adding to the model equations a relaxation term, which is supposed to force the model to the observations. The BFN algorithm consists of repeating forward and backward resolutions of the model with relaxation (or nudging) terms, that have opposite signs in the direct and inverse resolutions, so as to make the backward evolution numerically stable. We then applied the Back and Forth Nudging algorithm to a simple non-linear model: the 1D viscous Burgers' equations. The tests were carried out through several cases relative to the precision and density of the observations. These simulations were then compared with both the variational assimilation (VAR) and quasi-inverse (QIL) algorithms. The comparisons deal with the programming, the convergence, and time computing for each of these three algorithms.
Fichier principal
Vignette du fichier
icipe_auroux.pdf (982.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00327429 , version 1 (08-10-2008)

Identifiers

  • HAL Id : inria-00327429 , version 1

Cite

Didier Auroux, Patrick Bansart, Jacques Blum. An easy-to-implement and efficient data assimilation method for the identification of the initial condition: the Back and Forth Nudging (BFN) algorithm. International Conference on Inverse Problems in Engineering, Jun 2008, Dourdan, France. ⟨inria-00327429⟩
286 View
193 Download

Share

Gmail Facebook Twitter LinkedIn More