登录后查看更多精彩内容~
您需要 登录 才可以下载或查看,没有帐号?立即注册
x
1) 在模式的源代码下查看时,发现 i、j、k 方向的索引共有以下 4 种(见第一部分说明 code),以 k 方向为例:(1) kds -> kde ; (2) kms -> kme; (3) kts -> kde ; (4) 只有i、j 方向有:i_start -> i_end 和 j_start -> j_end
2)其中,k 方向有部分解释,如下第二部分说明 code。
请了解的大神帮忙解答,感谢!
1)第一部分说明 code :
!-- id grid id number
!-- ids start index for i in domain
!-- ide end index for i in domain
!-- jds start index for j in domain
!-- jde end index for j in domain
!-- kds start index for k in domain
!-- kde end index for k in domain
!-- ims start index for i in memory
!-- ime end index for i in memory
!-- jms start index for j in memory
!-- jme end index for j in memory
!-- kms start index for k in memory
!-- kme end index for k in memory
!-- i_start start indices for i in tile
!-- i_end end indices for i in tile
!-- j_start start indices for j in tile
!-- j_end end indices for j in tile
!-- its start index for i in tile
!-- ite end index for i in tile
!-- jts start index for j in tile
!-- jte end index for j in tile
!-- kts start index for k in tile
!-- kte end index for k in tile
!-- num_tiles number of tiles
!-- diagflag Logical to tell us when to produce diagnostics for history or restart
2)第二部分说明 code :
! In WRF, kms (smallest number) is the bottom level and kme (largest
! number) is the top level. In your scheme, if 1 is at the top level,
! then you have to reverse the order in the k direction.
!
! kme - half level (no data at this level)
! kme ----- full level
! kme-1 - half level
! kme-1 ----- full level
! .
! kms+2 - half level
! kms+2 ----- full level
! kms+1 - half level
! kms+1 ----- full level
! kms - half level
! kms ----- full level
|