The Asymptotics of the Heat Equation for a Boundary Value Problem.
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,...
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...
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,...
This work is devoted to numerical experiments for multidimensional Spectral Inverse Problems. We check the efficiency of the algorithm based on the BC-method, which exploits relations between Boundary Control Theory and Inverse Problems. As a test, the problem for an ellipse is considered. This case is of interest due to the fact that a field of normal geodesics loses regularity on a nontrivial separation set. The main result is that the BC-algorithm works quite successfully in spite of...
In this paper, we introduce a new approach for the convergence problem of optimized Schwarz methods by studying a generalization of these methods for a semilinear elliptic equation. We study the behavior of the algorithm when the overlapping length is large.