which describe motions in any orthogonal curvilinear coordinate system. Here, is the Bernoulli function and is the vorticity vector. We can take advantage of the elegance of these equations when discretizing them and use the discrete definitions of the grad, curl and divergence operators to satisfy constraints. We can also consider the analogy to forming derived equations, such as the vorticity equation, and examine how the discretization can be adjusted to give suitable vorticity advection among other things.
The underlying algorithm is the same as for the flux form
equations. All that has changed is the contents of the ``G's''. For
the time-being, only the hydrostatic terms have been coded but we will
indicate the points where non-hydrostatic contributions will enter:
Subsections
Next: 2.15.1 Relative vorticity Up: 2. Discretization and Algorithm Previous: 2.14.8 Mom Diagnostics Contents mitgcm-support@mitgcm.org |
|
|
|
|