Computes gradient (dudx, dudy, dudphi = dudz) at 3D staggered positions Gradient is computed according to symmetric formulation of Guenter's scheme Staggered point is at northeast-forward position w.r.t. its considered grid point on full grid Second and fourth order are implemented
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| type(comm_handler_t), | intent(in) | :: | comm_handler |
Communicator |
||
| class(equilibrium_t), | intent(inout) | :: | equi |
Equilibrium |
||
| type(mesh_cart_t), | intent(inout) | :: | mesh |
Mesh within poloidal plane |
||
| type(parallel_map_t), | intent(in) | :: | map |
Parallel map |
||
| type(variable_t) | :: | u |
Variable, must be defined on canonical grid |
|||
| real(kind=GP), | intent(out), | dimension(mesh%get_n_points(), 3) | :: | gradu |
Values of gradient |
|
| integer, | intent(in), | optional | :: | order |
Order of scheme default: 2 |