Let $L$ be a parabolic second order differential operator on the domain $\overline{\Pi }=\left[0,T\right]\times ℝ.$ Given a function $\widehat{u}:ℝ\to R$ and $\widehat{x}\>0$ such that the support of $\widehat{u}$ is contained in $(-\infty ,-\widehat{x}]$, we let $\widehat{y}:\overline{\Pi }\to ℝ$ be the solution to the equation:$$L\widehat{y}=0,\widehat{y}{|}_{\left\{0\right\}\times ℝ}=\widehat{u}.$$Given positive bounds $0\<x_0\<x_1,$ we seek a function $u$ with support in $\left[x_0,x_1\right]$ such that the corresponding solution $y$ satisfies:$$y(t,0)=\widehat{y}(t,0)\forall t\in \left[0,T\right].$$We prove in this article that, under some regularity conditions on the coefficients of $L,$ continuous solutions are unique and dense in the sense that $\widehat{y}{|}_{[0,T]\times \left\{0\right\}}$ can be $C^0$-approximated, but an exact solution does not...

Let L be a parabolic second order differential operator on the domain $\overline{\Pi }=\left[0,T\right]\times ℝ.$ Given a function $\widehat{u}:ℝ\to R$ and $\widehat{x}>0$ such that the support of û is contained in $(-\infty ,-\widehat{x}]$, we let $\widehat{y}:\overline{\Pi }\to ℝ$ be the solution to the equation: $$L\widehat{y}=0,\widehat{y}{|}_{\left\{0\right\}\times ℝ}=\widehat{u}.$$ Given positive bounds $0<x_0<x_1,$ we seek a function u with support in $\left[x_0,x_1\right]$ such that the corresponding solution y satisfies: $$y(t,0)=\widehat{y}(t,0)\forall t\in \left[0,T\right].$$ We prove in this article that, under some regularity conditions on the coefficients of L, continuous solutions are unique and dense in the sense that $\widehat{y}{|}_{[0,T]\times \left\{0\right\}}$ can be C0-approximated, but an exact solution...

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