| 607 |
[i.e. every hour $ i=0,...,5$ corresponding to |
[i.e. every hour $ i=0,...,5$ corresponding to |
| 608 |
$ k_{i}^{lev1} = 66, 67, \ldots, 71 $]. |
$ k_{i}^{lev1} = 66, 67, \ldots, 71 $]. |
| 609 |
Thus, the final state $ v_n = v_{k_{n}^{lev1}} $ is reached |
Thus, the final state $ v_n = v_{k_{n}^{lev1}} $ is reached |
| 610 |
and the model state of all proceeding timesteps along the last |
and the model state of all proceeding timesteps along the last |
| 611 |
sub-subsections are available, enabling integration backwards |
sub-subsections are available, enabling integration backwards |
| 612 |
in time along the last sub-subsection. |
in time along the last sub-subsection. |
| 613 |
Thus, the adjoint can be computed along this last |
Thus, the adjoint can be computed along this last |
| 1782 |
with the value of the cost function itself $ {\cal J}(u_{[k]}) $ |
with the value of the cost function itself $ {\cal J}(u_{[k]}) $ |
| 1783 |
at iteration step $ k $ serve |
at iteration step $ k $ serve |
| 1784 |
as input to a minimization routine (e.g. quasi-Newton method, |
as input to a minimization routine (e.g. quasi-Newton method, |
| 1785 |
conjugate gradient, ... \cite{gil_lem:89}) |
conjugate gradient, ... \cite{gil-lem:89}) |
| 1786 |
to compute an update in the |
to compute an update in the |
| 1787 |
control variable for iteration step $k+1$ |
control variable for iteration step $k+1$ |
| 1788 |
\[ |
\[ |
Parent Directory
| 
Revision Log
| 
Revision Graph
| 
Patch