INRIA Grenoble France

1. CARIMA/ SOGREAH implementation in LOIRE Cyril Mazauric INRIAGrenoble France

2. Presentation plan 1 Loire implementation 1 Loire implementation 2 Code architecture 3 Data assimilation 4 Conclusion

3. Loire implementation • Meeting in Bratislava : work has been done

4. Presentation plan 1 Loire implementation 2 Code architecture 2 Code architecture 3 Data assimilation 4 Conclusion

5. 10000 lines 100 subroutines CARIMA/SOGREAH CODE

6. Little river Bifurcation EASY EXAMPLE

7. CARIMA/SOGREAH CODE USED

8. Presentation plan 1 Loire implementation 2 Code architecture 3 Data assimilation 3 Data assimilation 4 Conclusion

9. Data assimilation method • For each subroutine : • Clean the code • Erase goto command • Erase return command • Write the tangent code • Use Odysse • Verify the Odyssee code

10. Compute P(U, ) • Compute • Compute the gradient : • Do I=1,10 • Compute • Compute • Value Tangent test P the programme, d direction of descent and U a point

11. Converge to 1 Tangent test

12. Data assimilation method • For each subroutine : • Clean the code • Write the tangent code • Use Odysse • Verify the Odyssee code • Write the co tangent code

13. Compute Tangent P(U,V, , ) • Compute Adjoint P(U,V, ADJ(U),Adj(V)) • Compute < ,Adj(U)> • Compute < ,Adj(V)> • < ,Adj(U)>=< ,Adj(V)> Adjoint test P the programme, U a point

14. Equality Adjoint test

15. Remaining code WORK ACCOMPLISHED

16. Presentation plan 1 Loire implementation 2 Code architecture 3 Data assimilation 4 Conclusion 4 Conclusion

17. Conclusion • Work carried out since last review • The code is clean • The major part of the CARIMA/SOGREAH adjoint code is accomplish • Work to be carried out in the next six months • finish the CARIMA/SOGREAH adjoint code (for the easy example) • Make some tests (manning …) • Begin the SMS adjoint code