3 |
|
|
4 |
#include "CPP_OPTIONS.h" |
#include "CPP_OPTIONS.h" |
5 |
|
|
6 |
|
CBOP |
7 |
|
C !ROUTINE: DYNAMICS |
8 |
|
C !INTERFACE: |
9 |
SUBROUTINE DYNAMICS(myTime, myIter, myThid) |
SUBROUTINE DYNAMICS(myTime, myIter, myThid) |
10 |
C /==========================================================\ |
C !DESCRIPTION: \bv |
11 |
C | SUBROUTINE DYNAMICS | |
C *==========================================================* |
12 |
C | o Controlling routine for the explicit part of the model | |
C | SUBROUTINE DYNAMICS |
13 |
C | dynamics. | |
C | o Controlling routine for the explicit part of the model |
14 |
C |==========================================================| |
C | dynamics. |
15 |
C | This routine evaluates the "dynamics" terms for each | |
C *==========================================================* |
16 |
C | block of ocean in turn. Because the blocks of ocean have | |
C | This routine evaluates the "dynamics" terms for each |
17 |
C | overlap regions they are independent of one another. | |
C | block of ocean in turn. Because the blocks of ocean have |
18 |
C | If terms involving lateral integrals are needed in this | |
C | overlap regions they are independent of one another. |
19 |
C | routine care will be needed. Similarly finite-difference | |
C | If terms involving lateral integrals are needed in this |
20 |
C | operations with stencils wider than the overlap region | |
C | routine care will be needed. Similarly finite-difference |
21 |
C | require special consideration. | |
C | operations with stencils wider than the overlap region |
22 |
C | Notes | |
C | require special consideration. |
23 |
C | ===== | |
C | The algorithm... |
24 |
C | C*P* comments indicating place holders for which code is | |
C | |
25 |
C | presently being developed. | |
C | "Correction Step" |
26 |
C \==========================================================/ |
C | ================= |
27 |
|
C | Here we update the horizontal velocities with the surface |
28 |
|
C | pressure such that the resulting flow is either consistent |
29 |
|
C | with the free-surface evolution or the rigid-lid: |
30 |
|
C | U[n] = U* + dt x d/dx P |
31 |
|
C | V[n] = V* + dt x d/dy P |
32 |
|
C | |
33 |
|
C | "Calculation of Gs" |
34 |
|
C | =================== |
35 |
|
C | This is where all the accelerations and tendencies (ie. |
36 |
|
C | physics, parameterizations etc...) are calculated |
37 |
|
C | rho = rho ( theta[n], salt[n] ) |
38 |
|
C | b = b(rho, theta) |
39 |
|
C | K31 = K31 ( rho ) |
40 |
|
C | Gu[n] = Gu( u[n], v[n], wVel, b, ... ) |
41 |
|
C | Gv[n] = Gv( u[n], v[n], wVel, b, ... ) |
42 |
|
C | Gt[n] = Gt( theta[n], u[n], v[n], wVel, K31, ... ) |
43 |
|
C | Gs[n] = Gs( salt[n], u[n], v[n], wVel, K31, ... ) |
44 |
|
C | |
45 |
|
C | "Time-stepping" or "Prediction" |
46 |
|
C | ================================ |
47 |
|
C | The models variables are stepped forward with the appropriate |
48 |
|
C | time-stepping scheme (currently we use Adams-Bashforth II) |
49 |
|
C | - For momentum, the result is always *only* a "prediction" |
50 |
|
C | in that the flow may be divergent and will be "corrected" |
51 |
|
C | later with a surface pressure gradient. |
52 |
|
C | - Normally for tracers the result is the new field at time |
53 |
|
C | level [n+1} *BUT* in the case of implicit diffusion the result |
54 |
|
C | is also *only* a prediction. |
55 |
|
C | - We denote "predictors" with an asterisk (*). |
56 |
|
C | U* = U[n] + dt x ( 3/2 Gu[n] - 1/2 Gu[n-1] ) |
57 |
|
C | V* = V[n] + dt x ( 3/2 Gv[n] - 1/2 Gv[n-1] ) |
58 |
|
C | theta[n+1] = theta[n] + dt x ( 3/2 Gt[n] - 1/2 atG[n-1] ) |
59 |
|
C | salt[n+1] = salt[n] + dt x ( 3/2 Gt[n] - 1/2 atG[n-1] ) |
60 |
|
C | With implicit diffusion: |
61 |
|
C | theta* = theta[n] + dt x ( 3/2 Gt[n] - 1/2 atG[n-1] ) |
62 |
|
C | salt* = salt[n] + dt x ( 3/2 Gt[n] - 1/2 atG[n-1] ) |
63 |
|
C | (1 + dt * K * d_zz) theta[n] = theta* |
64 |
|
C | (1 + dt * K * d_zz) salt[n] = salt* |
65 |
|
C | |
66 |
|
C *==========================================================* |
67 |
|
C \ev |
68 |
|
C !USES: |
69 |
IMPLICIT NONE |
IMPLICIT NONE |
|
|
|
70 |
C == Global variables === |
C == Global variables === |
71 |
#include "SIZE.h" |
#include "SIZE.h" |
72 |
#include "EEPARAMS.h" |
#include "EEPARAMS.h" |
76 |
#ifdef ALLOW_PASSIVE_TRACER |
#ifdef ALLOW_PASSIVE_TRACER |
77 |
#include "TR1.h" |
#include "TR1.h" |
78 |
#endif |
#endif |
|
|
|
79 |
#ifdef ALLOW_AUTODIFF_TAMC |
#ifdef ALLOW_AUTODIFF_TAMC |
80 |
# include "tamc.h" |
# include "tamc.h" |
81 |
# include "tamc_keys.h" |
# include "tamc_keys.h" |
87 |
# include "GMREDI.h" |
# include "GMREDI.h" |
88 |
# endif |
# endif |
89 |
#endif /* ALLOW_AUTODIFF_TAMC */ |
#endif /* ALLOW_AUTODIFF_TAMC */ |
|
|
|
90 |
#ifdef ALLOW_TIMEAVE |
#ifdef ALLOW_TIMEAVE |
91 |
#include "TIMEAVE_STATV.h" |
#include "TIMEAVE_STATV.h" |
92 |
#endif |
#endif |
93 |
|
|
94 |
|
C !CALLING SEQUENCE: |
95 |
|
C DYNAMICS() |
96 |
|
C | |
97 |
|
C |-- CALC_GRAD_PHI_SURF |
98 |
|
C | |
99 |
|
C |-- CALC_VISCOSITY |
100 |
|
C | |
101 |
|
C |-- CALC_PHI_HYD |
102 |
|
C | |
103 |
|
C |-- MOM_FLUXFORM |
104 |
|
C | |
105 |
|
C |-- MOM_VECINV |
106 |
|
C | |
107 |
|
C |-- TIMESTEP |
108 |
|
C | |
109 |
|
C |-- OBCS_APPLY_UV |
110 |
|
C | |
111 |
|
C |-- IMPLDIFF |
112 |
|
C | |
113 |
|
C |-- OBCS_APPLY_UV |
114 |
|
C | |
115 |
|
C |-- CALL TIMEAVE_CUMUL_1T |
116 |
|
C |-- CALL TIMEAVE_CUMULATE |
117 |
|
C |-- CALL DEBUG_STATS_RL |
118 |
|
|
119 |
|
C !INPUT/OUTPUT PARAMETERS: |
120 |
C == Routine arguments == |
C == Routine arguments == |
121 |
C myTime - Current time in simulation |
C myTime - Current time in simulation |
122 |
C myIter - Current iteration number in simulation |
C myIter - Current iteration number in simulation |
125 |
INTEGER myIter |
INTEGER myIter |
126 |
INTEGER myThid |
INTEGER myThid |
127 |
|
|
128 |
|
C !LOCAL VARIABLES: |
129 |
C == Local variables |
C == Local variables |
130 |
C fVer[STUV] o fVer: Vertical flux term - note fVer |
C fVer[STUV] o fVer: Vertical flux term - note fVer |
131 |
C is "pipelined" in the vertical |
C is "pipelined" in the vertical |
216 |
C (1 + dt * K * d_zz) theta[n] = theta* |
C (1 + dt * K * d_zz) theta[n] = theta* |
217 |
C (1 + dt * K * d_zz) salt[n] = salt* |
C (1 + dt * K * d_zz) salt[n] = salt* |
218 |
C--- |
C--- |
219 |
|
CEOP |
220 |
|
|
221 |
C-- Set up work arrays with valid (i.e. not NaN) values |
C-- Set up work arrays with valid (i.e. not NaN) values |
222 |
C These inital values do not alter the numerical results. They |
C These inital values do not alter the numerical results. They |