Displaying similar documents to “The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations”

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

Didier Auroux, Maëlle Nodet (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

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

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

Didier Auroux, Maëlle Nodet (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

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

The classic differential evolution algorithm and its convergence properties

Roman Knobloch, Jaroslav Mlýnek, Radek Srb (2017)

Applications of Mathematics

Similarity:

Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification...