grid_transform_c_e grid_transform_compute grid_transform_delete grid_transform_get_val grid_transform_grid_vol7d_init grid_transform_init grid_transform_levtype_levtype_init grid_transform_v7d_grid_compute grid_transform_vol7d_grid_init grid_transform_vol7d_vol7d_init interval_info_new transform_delete transform_get_val transform_init

grid_transform_v7d_grid_compute() subroutine grid_transform_v7d_grid_compute ( type(grid_transform), intent(in) this, real, dimension(:,:), intent(in) field_in, real, dimension(:,:,:), intent(out) field_out, type(vol7d_var), intent(in), optional var, real, dimension(:,:,:), intent(in), optional, target coord_3d_in ) private Compute the output data array from input data array according to the defined transformation. The grid_transform object this must have been properly initialised, so that it contains all the information needed for computing the transformation. This is the sparse points-to-grid and sparse points-to-sparse points version. Parametri [in] this grid_tranform object [in] field_in input array [out] field_out output array [in] var physical variable to be interpolated, if provided, some ad-hoc algorithms may be used where possible [in] coord_3d_in input vertical coordinate for vertical interpolation, if not provided by other means Definizione alla linea 4390 del file grid_transform_class.F90. z5 = (z4-z1)*p2+z1 z6 = (z3-z2)*p2+z2 zp = (z6-z5)*(p1)+z5 END FUNCTION hbilin ! Shapiro filter of order 2 FUNCTION shapiro (z,zp) RESULT(zs) !! z_smoothed(i,j) = z(i,j) * (1-S) + S * sum(z_vicini)/N !! = z(i,j) - S/N (N*z(i,j) - sum(z_vicini)) REAL,INTENT(in) :: z(:) ! Z values on the four surrounding points REAL,INTENT(in) :: zp ! Z values on the central point REAL :: zs ! Z smoothed value on the central point INTEGER:: N IF(c_e(zp))THEN n = count(c_e(z)) zs = zp - 0.5* ( n*zp - sum(z, c_e(z)) )/n ELSE zs = rmiss END IF END FUNCTION shapiro ! Locate index of requested point SUBROUTINE basic_find_index(this, near, nx, ny, xmin, xmax, ymin, ymax, & lon, lat, extrap, index_x, index_y) TYPE(griddim_def),INTENT(in) :: this ! griddim object (from grid) LOGICAL,INTENT(in) :: near ! near or bilin interpolation (determine wich point is requested) INTEGER,INTENT(in) :: nx,ny ! dimension (to grid) DOUBLE PRECISION,INTENT(in) :: xmin, xmax, ymin, ymax ! extreme coordinate (to grid) DOUBLE PRECISION,INTENT(in) :: lon(:,:),lat(:,:) ! target coordinate LOGICAL,INTENT(in) :: extrap ! extrapolate INTEGER,INTENT(out) :: index_x(:,:),index_y(:,:) ! index of point requested INTEGER :: lnx, lny DOUBLE PRECISION :: x(SIZE(lon,1),SIZE(lon,2)),y(SIZE(lon,1),SIZE(lon,2)) IF (near) THEN CALL proj(this,lon,lat,x,y) index_x = nint((x-xmin)/((xmax-xmin)/dble(nx-1)))+1 index_y = nint((y-ymin)/((ymax-ymin)/dble(ny-1)))+1 lnx = nx lny = ny ELSE CALL proj(this,lon,lat,x,y) index_x = floor((x-xmin)/((xmax-xmin)/dble(nx-1)))+1 index_y = floor((y-ymin)/((ymax-ymin)/dble(ny-1)))+1 lnx = nx-1 lny = ny-1 ENDIF IF (extrap) THEN ! trim indices outside grid for extrapolation index_x = max(index_x, 1) index_y = max(index_y, 1) index_x = min(index_x, lnx) index_y = min(index_y, lny) ELSE ! nullify indices outside grid WHERE(index_x < 1 .OR. index_x > lnx .OR. index_y < 1 .OR. index_y > lny) index_x = imiss index_y = imiss END WHERE ENDIF END SUBROUTINE basic_find_index END MODULE grid_transform_class