Next: Inviscid Burgers
Up: Transport equations
Previous: Viscous Burgers
Contents
We now consider the inviscid case for a linear transport equation. The BFN equations are:
|
(3.32) |
where
can be constant or not. The following result holds true [29]:
Theorem 3.5
We consider the non viscous one-step BFN (3.32), with observations
satisfying (3.32-F) with
. We denote
|
(3.33) |
We denote by
|
(3.34) |
the characteristic curve of equation (3.32-F) with
, with foot
in time
, i.e. such that
|
(3.35) |
We assume that the final time
is such that the characteristics are well defined and do not intersect over
. Then:
- If
,
then we have, for all
,
|
(3.36) |
- If
with
, then we have
|
(3.37) |
- If
, then we have, for all
,
|
(3.38) |
From this result, we deduce that the BFN algorithm applied to inviscid linear transport equation does converge if all the domain is observed (first two cases of theorem 3.5). Moreover, if the support of
does not cover all the domain (third case of theorem 3.5, e.g. when the system is not fully observed), the algorithm converges as soon as all the characteristics intersect the support of
. This constraint is satisfied as soon as the system is observable (see remarks below proposition 3.2).
Next: Inviscid Burgers
Up: Transport equations
Previous: Viscous Burgers
Contents
Back to home page