INRIA Grenoble France

ANFAS

INRIAGrenoble France

Cyril Mazauric

CARIMA/ SOGREAH implementation in LOIRE

ANFAS

Orleans 26 – 28 September

1 Loire implementation

2 Code architecture

3 Data assimilation

4 Conclusion

Presentation plan


ANFAS


GI01

GI02GI03

GI04

GI05

GI06

GI07

GI08

GI09

GI10

DA01DA02

SU01

SU02

SU03

SU04

SU05

OU01

OU02

OU03OU04

OU05

OU06

OU07

OU08

OU09

OU10

OU11

OU12

OU13

OU14

OU15

OU16

OU17

OU18OU19

OU20

OU21

CF01

CF02

Liaison par TYPE_LIAIS

LDEV (33)LDVF (16)LSTK (75)

Casiers

Polygone

Polygone

Loire

Bief

Liaison

Pk

Point de calcul

5 km

ANFAS - VAL d'OUZOUER - LOIREDéfinition des casiers du modèle 1D• Meeting in Bratislava :

work has been done

Loire implementation

ANFAS



2 Code architecture

3 Data assimilation

4 Conclusion

Presentation plan

2 Code architecture

ANFAS


ERR5ERR14ERR16

PRECAL

RAZV

EDIT

RAZV RELIA

BIVMAT TCOEFF

CALMAT

RETOOR

EDIT

SORERR

SORCON

CALTRO

CALLIA

BIVMAT TCOEFF

CALMAT DESTOKERR19ERR16RAZV

TRANSL

ATGESTRAZNERR6RAZV

BIVMAT TCOEFF

CALMAT ALLIA RELIA

ALLER

CALCUL

GESMEM1

ERR9CHFLOT

CHFIXERR2INITI

FREQ1

ERR9CHFLOT

ERR2

TEMPS1

CHFIXERR2

CHFLOT

OPTION

RAZCERR5

TSTCARRAZN

CHFLOTRAZVERR2

CON002

DESTOK GOGET

PROCST

INIT1 RAZCCHFIX

ATGESTCHFLOT

ERR1ERR2

RAZ_CART

WOPTIO

ERR2ERR15

FICHIE

TEMPSFREQNCPREDONCODEDI

GESMEM GESMEM1

ERR4ERR5

MODELE

TLISTCHFIX

RANGEGIMME

CON003ERR2ERR5ERR1RAZN

CON001ERR12

CHFLOTERR9

FTCON FTERR

PREDO1

ERR5ALPHAB

CHFIXERR2

TROUVE

CODED1

MAINC2 C2SOGRC2BLDA

SGLONG

GETNO1

RUNC2

ED INST

GOGET ERR4

FTC ON

ERR13

FTERR

TSTC AR

TROUVE

EDINST

GOGET RETOUR

RELIA

EDINST

GOGET RETOUR

RELIA

COE164 COE153 COE152

RAZV

INITBR

CALTRO

AGP164 C OE158 C OE156 C OE250 AGP153

ED INST

GOGET

RAZV

ED IT

SORERR

SORC ON GOGET SORC ON C OE163C OE159ITE150

C OE150

GOGET SORC ON MIS152 C INES

RAZV

ED IT

SORERR

ERR20

AGP152

ED INST

GOGET ATGEST

C OE162 C OE161 C OE154

ED INST

GOGET

CARIMA/SOGREAH CODE

10000 lines100 subroutines

ANFAS


EASY EXAMPLE

Little river

Bifurcation

ANFAS


ERR5ERR14ERR16

PRECAL

RAZV

EDIT

RAZV RELIA

BIVMAT TCOEFF

CALMAT

RETOOR

EDIT

SORERR

SORCON

CALTRO

CALLIA

BIVMAT TCOEFF


TRANSL

ATGESTRAZNERR6RAZV

BIVMAT TCOEFF

CALMAT ALLIA RELIA

ALLER

CALCUL

GESMEM1

ERR9CHFLOT

CHFIXERR2INITI

FREQ1

ERR9CHFLOT

ERR2

TEMPS1

CHFIXERR2

CHFLOT

OPTION

RAZCERR5

TSTCARRAZN

CHFLOTRAZVERR2

CON002

DESTOK GOGET

PROCST

INIT1 RAZCCHFIX

ATGESTCHFLOT

ERR1ERR2

RAZ_CART

WOPTIO

ERR2ERR15

FICHIE


GESMEM GESMEM1

ERR4ERR5

MODELE

TLISTCHFIX

RANGEGIMME


CON001ERR12

CHFLOTERR9

FTCON FTERR

PREDO1

ERR5ALPHAB

CHFIXERR2

TROUVE

CODED1

MAINC2 C2SOGRC2BLDA

SGLONG

GETNO1

RUNC2

ED INST

GOGET ERR4

FTC ON

ERR13

FTERR

TSTC AR

TROUVE

EDINST

GOGET RETOUR

RELIA

EDINST

GOGET RETOUR

RELIA


RAZV

INITBR

CALTRO


ED INST

GOGET

RAZV

ED IT

SORERR


C OE150


RAZV

ED IT

SORERR

ERR20

AGP152

ED INST

GOGET ATGEST

C OE162 C OE161 C OE154

ED INST

GOGET

CARIMA/SOGREAH CODE USED

ANFAS



2 Code architecture

3 Data assimilation

4 Conclusion

Presentation plan

3 Data assimilation

ANFAS


Data assimilation method

• For each subroutine :

Clean the code

Write the tangent code

Erase goto command Erase return command

Use Odysse Verify the Odyssee code

ANFAS


Tangent test

• Compute P(U, )• Compute • Compute the gradient :• Do I=1,10

0V)J(VJ 00

0J 0J

Compute Compute Value

I1/10)VδV,P(U

)J(VJ

δV),J(JJ

Lim(I)0

0

P the programme, d direction of descent and U a point

ANFAS


Tangent test

Converge to 1

ANFAS


Data assimilation method

• For each subroutine :

Clean the code

Write the tangent code

Write the co tangent code

Use Odysse Verify the Odyssee code

ANFAS


Adjoint test

P the programme, U a point

• Compute Tangent P(U,V, , )• Compute Adjoint P(U,V, ADJ(U),Adj(V))• Compute < ,Adj(U)>• Compute < ,Adj(V)> • < ,Adj(U)>=< ,Adj(V)>

U V

UV

VU

ANFAS


Adjoint test

Equality

ANFAS


ERR5ERR14ERR16

PRECAL

RAZV

EDIT

RAZV RELIA

BIVMAT TCOEFF

CALMAT

RETOOR

EDIT

SORERR

SORCON

CALTRO

CALLIA

BIVMAT TCOEFF


TRANSL

ATGESTRAZNERR6RAZV

BIVMAT TCOEFF

CALMAT ALLIA RELIA

ALLER

CALCUL

GESMEM1

ERR9CHFLOT

CHFIXERR2INITI

FREQ1

ERR9CHFLOT

ERR2

TEMPS1

CHFIXERR2

CHFLOT

OPTION

RAZCERR5

TSTCARRAZN

CHFLOTRAZVERR2

CON002

DESTOK GOGET

PROCST

INIT1 RAZCCHFIX

ATGESTCHFLOT

ERR1ERR2

RAZ_CART

WOPTIO

ERR2ERR15

FICHIE


GESMEM GESMEM1

ERR4ERR5

MODELE

TLISTCHFIX

RANGEGIMME


CON001ERR12

CHFLOTERR9

FTCON FTERR

PREDO1

ERR5ALPHAB

CHFIXERR2

TROUVE

CODED1

MAINC2 C2SOGRC2BLDA

SGLONG

GETNO1

RUNC2

ED INST

GOGET ERR4

FTC ON

ERR13

FTERR

TSTC AR

TROUVE

EDINST

GOGET RETOUR

RELIA

EDINST

GOGET RETOUR

RELIA


RAZV

INITBR

CALTRO


ED INST

GOGET

RAZV

ED IT

SORERR


C OE150


RAZV

ED IT

SORERR

ERR20

AGP152

ED INST

GOGET ATGEST

C OE162 C OE161 C OE154

ED INST

GOGET

WORK ACCOMPLISHED

Remaining code

ANFAS



2 Code architecture

3 Data assimilation

4 Conclusion

Presentation plan

4 Conclusion

ANFAS


• Work carried out since last review

Conclusion

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

INRIA Grenoble France

Documents

Transcript of INRIA Grenoble France