The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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,...
Currently displaying 1 –
4 of
4