| | 1 | = Implementation of the Analysis step for the LNETF (Local Nonlinear Ensemble Transform Filter) algorithm = |
| | 2 | |
| | 3 | {{{ |
| | 4 | #!html |
| | 5 | <div class="wiki-toc"> |
| | 6 | <h4>Implementation Guide</h4> |
| | 7 | <ol><li><a href="ImplementationGuide">Main page</a></li> |
| | 8 | <li><a href="AdaptParallelization">Adaptation of the parallelization</a></li> |
| | 9 | <li><a href="InitPdaf">Initialization of PDAF</a></li> |
| | 10 | <li><a href="ModifyModelforEnsembleIntegration">Modifications for ensemble integration</a></li> |
| | 11 | <li><a href="ImplementationofAnalysisStep">Implementation of the analysis step</a></li> |
| | 12 | <ol> |
| | 13 | <li><a href="ImplementAnalysisestkf">Implementation for ESTKF</a></li> |
| | 14 | <li><a href="ImplementAnalysislestkf">Implementation for LESTKF</a></li> |
| | 15 | <li><a href="ImplementAnalysisetkf">Implementation for ETKF</a></li> |
| | 16 | <li><a href="ImplementAnalysisletkf">Implementation for LETKF</a></li> |
| | 17 | <li><a href="ImplementAnalysisseik">Implementation for SEIK</a></li> |
| | 18 | <li><a href="ImplementAnalysislseik">Implementation for LSEIK</a></li> |
| | 19 | <li><a href="ImplementAnalysisseek">Implementation for SEEK</a></li> |
| | 20 | <li><a href="ImplementAnalysisenkf">Implementation for EnKF</a></li> |
| | 21 | <li><a href="ImplementAnalysisnetf">Implementation for NETF</a></li> |
| | 22 | <li>Implementation for LNETF</li> |
| | 23 | </ol> |
| | 24 | <li><a href="AddingMemoryandTimingInformation">Memory and timing information</a></li> |
| | 25 | </ol> |
| | 26 | </div> |
| | 27 | }}} |
| | 28 | |
| | 29 | |
| | 30 | [[PageOutline(2-3,Contents of this page)]] |
| | 31 | |
| | 32 | The LNETF algorithm was added with version 1.12 of PDAF. |
| | 33 | |
| | 34 | == Overview == |
| | 35 | |
| | 36 | For the analysis step of the LNETF algorithm, several operations related to the observations are needed. These operations are requested by PDAF by calling user-supplied routines. Intentionally, the operations are split into separate routines in order to keep the operations rather elementary as this procedure should simplify the implementation. The names of the required routines are specified in the call to the routine `PDAF_assimilate_lnetf` in the fully-parallel implementation (or `PDAF_put_state_lnetf` for the 'flexible' implementation) described below. With regard to the parallelization, all these routines (except `U_collect_state`) are executed by the filter processes (`filterpe=.true.`) only. |
| | 37 | |
| | 38 | For completeness we discuss here all user-supplied routines that are specified in the interface to `PDAF_assimilate_lnetf`. Many of the routines are localized versions of those that are needed for the global NETF method. Hence, if the user-supplied routines for the global NETF method have been already implemented, one can base on these routines to speed up the implementation. Due to this, it can also be reasonable to first fully implement a global filter version and subsequently implement the corresponding localized filter by modifying and extending the global routines. |
| | 39 | |
| | 40 | The analysis step of the LNETF is is wide parts similar to that of the LETKF, LESTKF, and LSEIK filter. |
| | 41 | The LSEIK filter and the LETKF (Local Ensemble Transform Kalman Filter) are very similar. For this reason, the interface to the user-supplied routines is almost identical. Depending on the implementation it can be possible to use identical routines for the LNETF and the LETKF with the exception of the routine U_likelihood_l. |
| | 42 | |
| | 43 | |
| | 44 | == `PDAF_put_state_lnetf` == |
| | 45 | |
| | 46 | The general aspects of the filter-specific routines `PDAF_assimilate_*` have been described on the page [ModifyModelforEnsembleIntegration Modification of the model code for the ensemble integration]. |
| | 47 | The interface for the routine `PDAF_assimilate_lnetf` contains several routine names for routines that operate on the local analysis domains (marked by `_l` at the end of the routine name). In addition, there are names for routines that consider all available observations required to perform local analyses with LNETF within some sub-domain of a domain-decomposed model (marked by `_f` at the end of the routine name). In case of a serial execution of the assimilation program, these will be all globally available observations. However, if the program is executed with parallelization, this might be a smaller set of observations. |
| | 48 | |
| | 49 | To explain the difference, it is assumed, for simplicity, that a local analysis domain consists of a single vertical column of the model grid. In addition, we assume that the domain decomposition splits the global model domain by vertical boundaries as is typical for ocean models and that the observations are spatially distributed observations of model fields that are part of the state vector. Under these assumptions, the situation is the following: When a model uses domain decomposition, the LNETF algorithm is executed such that for each model sub-domain a loop over all local analysis domains (e.g. vertical columns) that belong to the model sub-domain is performed. As each model sub-domain is treated by a different process, all loops are executed parallel to each other. |
| | 50 | |
| | 51 | For the update of each single vertical column, observations from some larger domain surrounding the vertical column are required. If the influence radius for the observations is sufficiently small there will be vertical columns for which the relevant observations reside completely inside the model sub-domain of the process. However, if a vertical column is considered that is located close to the boundary of the model sub-domain, there will be some observations that don't belong spatially to the local model sub-domain, but to a neighboring model sub-domain. Nonetheless, these observations are required on the local model sub-domain. A simple way to handle this situation is to initialize for each process all globally available observations, together with their coordinates. While this method is simple, it can also become inefficient if the assimilation program is executed using a large number of processes. As for an initial implementation it is usually not the concern to obtain the highest parallel efficiency, the description below assumes that 'full' refers to the global model domain. |
| | 52 | |
| | 53 | The interface when using the LNETF algorithm is the following: |
| | 54 | {{{ |
| | 55 | SUBROUTINE PDAF_assimilate_lnetf(U_collect_state, U_distribute_state, U_init_dim_obs_f, U_obs_op_f, & |
| | 56 | U_init_obs_f, U_init_obs_l, U_prepoststep, U_likelihood_l, & |
| | 57 | U_init_n_domains, U_init_dim_l, U_init_dim_obs_l, & |
| | 58 | U_g2l_state, U_l2g_state, U_g2l_obs, & |
| | 59 | U_next_observation, status) |
| | 60 | }}} |
| | 61 | with the following arguments: |
| | 62 | * [#U_collect_statecollect_state_pdaf.F90 U_collect_state]: The name of the user-supplied routine that initializes a state vector from the array holding the ensemble of model states from the model fields. This is basically the inverse operation to `U_distribute_state` used in [ModifyModelforEnsembleIntegration#PDAF_get_state PDAF_get_state] |
| | 63 | * [#U_distribute_statedistribute_state_pdaf.F90 U_distribute_state]: The name of a user supplied routine that initializes the model fields from the array holding the ensemble of model state vectors. |
| | 64 | * [#U_init_dim_obs_finit_dim_obs_f_pdaf.F90 U_init_dim_obs_f]: The name of the user-supplied routine that provides the size of the full observation vector |
| | 65 | * [#U_obs_op_fobs_op_f_pdaf.F90 U_obs_op_f]: The name of the user-supplied routine that acts as the full observation operator on some state vector |
| | 66 | * [#U_init_obs_finit_obs_f_pdaf.F90 U_init_obs_f]: The name of the user-supplied routine that initializes the full vector of observations |
| | 67 | * [#U_init_obs_linit_obs_l_pdaf.F90 U_init_obs_l]: The name of the user-supplied routine that initializes the vector of observations for a local analysis domain |
| | 68 | * [#U_prepoststepprepoststep_ens_pdaf.F90 U_prepoststep]: The name of the pre/poststep routine as in `PDAF_get_state` |
| | 69 | * [#U_likelihood_llikelihood_l_pdaf.F90 U_likelihood_l]: The name of the user-supplied routine that computes the likelihood of the local observations for an ensemble member provide when the routine is called. |
| | 70 | * [#U_init_n_domainsinit_n_domains_pdaf.F90 U_init_n_domains]: The name of the routine that provides the number of local analysis domains |
| | 71 | * [#U_init_dim_linit_dim_l_pdaf.F90 U_init_dim_l]: The name of the routine that provides the state dimension for a local analysis domain |
| | 72 | * [#U_init_dim_obs_linit_dim_obs_l_pdaf.F90 U_init_dim_obs_l]: The name of the routine that initializes the size of the observation vector for a local analysis domain |
| | 73 | * [#U_g2l_stateg2l_state_pdaf.F90 U_g2l_state]: The name of the routine that initializes a local state vector from the global state vector |
| | 74 | * [#U_l2g_statel2g_state_pdaf.F90 U_l2g_state]: The name of the routine that initializes the corresponding part of the global state vector from the the provided local state vector |
| | 75 | * [#U_g2l_obsg2l_obs_pdaf.F90 U_g2l_obs]: The name of the routine that initializes a local observation vector from a full observation vector |
| | 76 | * [#U_next_observationnext_observation_pdaf.F90 U_next_observation]: The name of a user supplied routine that initializes the variables `nsteps`, `timenow`, and `doexit`. The same routine is also used in `PDAF_get_state`. |
| | 77 | * `status`: The integer status flag. It is zero, if `PDAF_assimilate_lnetf` is exited without errors. |
| | 78 | |
| | 79 | Note: |
| | 80 | * The order of the routine names does not show the order in which these routines are executed. See the [#Executionorderofuser-suppliedroutines section on the order of the execution] at the bottom of this page. |
| | 81 | |
| | 82 | |
| | 83 | == `PDAF_put_state_lnetf` == |
| | 84 | |
| | 85 | When the 'flexible' implementation variant is chosen for the assimilation system, the routine `PDAF_put_state_lnetf` has to be used instead of `PDAF_assimilate_lnetf`. The general aspects of the filter specific routines `PDAF_put_state_*` have been described on the page [ModifyModelforEnsembleIntegration Modification of the model code for the ensemble integration]. The interface of the routine is identical with that of `PDAF_assimilate_lnetf` with the exception the specification of the user-supplied routines `U_distribute_state` and `U_next_observation` are missing. |
| | 86 | |
| | 87 | The interface when using the LNETF algorithm is the following: |
| | 88 | {{{ |
| | 89 | SUBROUTINE PDAF_put_state_lnetf(U_collect_state, U_init_dim_obs_f, U_obs_op_f, U_init_obs_f, & |
| | 90 | U_init_obs_l, U_prepoststep, U_likelihood_l, U_init_n_domains, & |
| | 91 | U_init_dim_l, U_init_dim_obs_l, & |
| | 92 | U_g2l_state, U_l2g_state, U_g2l_obs, & |
| | 93 | status) |
| | 94 | }}} |
| | 95 | |
| | 96 | |
| | 97 | == User-supplied routines == |
| | 98 | |
| | 99 | Here, all user-supplied routines are described that are required in the call to `PDAF_assimilate_lnetf`. For some of the generic routines, we link to the page on [ModifyModelforEnsembleIntegration modifying the model code for the ensemble integration]. |
| | 100 | |
| | 101 | To indicate user-supplied routines we use the prefix `U_`. In the template directory `templates/` as well as in the example implementation in `testsuite/src/dummymodel_1D` these routines exist without the prefix, but with the extension `_pdaf.F90`. In the section titles below we provide the name of the template file in parentheses. |
| | 102 | |
| | 103 | In the subroutine interfaces some variables appear with the suffix `_p` (short for 'process'). This suffix indicates that the variable is particular to a model sub-domain, if a domain decomposed model is used. Thus, the value(s) in the variable will be different for different model sub-domains. In addition, there will be variables with the suffix `_f` (for 'full') and with the suffix `_l` (for 'local'). |
| | 104 | |
| | 105 | === `U_collect_state` (collect_state_pdaf.F90) === |
| | 106 | |
| | 107 | This routine is independent from the filter algorithm used. |
| | 108 | See the mape on [InsertAnalysisStep#U_collect_statecollect_state_pdaf.F90 inserting the analysis step] for the description of this routine. |
| | 109 | |
| | 110 | === `U_distribute_state` (distribute_state_pdaf.F90) === |
| | 111 | |
| | 112 | This routine is independent of the filter algorithm used. |
| | 113 | See the page on [InsertAnalysisStep#U_distribute_statedistribute_state_pdaf.F90 inserting the analysis step] for the description of this routine. |
| | 114 | |
| | 115 | |
| | 116 | === `U_init_dim_obs_f` (init_dim_obs_f_pdaf.F90) === |
| | 117 | |
| | 118 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 119 | |
| | 120 | The interface for this routine is: |
| | 121 | {{{ |
| | 122 | SUBROUTINE init_dim_obs_f(step, dim_obs_f) |
| | 123 | |
| | 124 | INTEGER, INTENT(in) :: step ! Current time step |
| | 125 | INTEGER, INTENT(out) :: dim_obs_f ! Dimension of full observation vector |
| | 126 | }}} |
| | 127 | |
| | 128 | The routine is called at the beginning of each analysis step, before the loop over all local analysis domains is entered. It has to initialize the size `dim_obs_f` of the full observation vector according to the current time step. For simplicity, `dim_obs_f` can be the size for the global model domain. |
| | 129 | |
| | 130 | Some hints: |
| | 131 | * It can be useful to not only determine the size of the observation vector at this point. One can also already gather information about the location of the observations, which can be used later, e.g. to implement the observation operator. In addition, one can already prepare an array that holds the full observation vector. This can be used later by `U_init_obs_l` to initialize a local vector of observations by selecting the relevant parts of the full observation vector. The required arrays can be defined in a module like `mod_assimilation`. |
| | 132 | * The routine is similar to `init_dim_obs` used in the global filters. However, if the global filter is used with a domain-decomposed model, it only initializes the size of the observation vector for the local model sub-domain. This is different for the local filters, as the local analysis also requires observational data from neighboring model sub-domains. Nonetheless, one can base on an implemented routine `init_dim_obs` to implement `init_dim_obs_f`. |
| | 133 | |
| | 134 | === `U_obs_op_f` (obs_op_f_pdaf.F90) === |
| | 135 | |
| | 136 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 137 | |
| | 138 | The interface for this routine is: |
| | 139 | {{{ |
| | 140 | SUBROUTINE obs_op_f(step, dim_p, dim_obs_f, state_p, m_state_f) |
| | 141 | |
| | 142 | INTEGER, INTENT(in) :: step ! Current time step |
| | 143 | INTEGER, INTENT(in) :: dim_p ! PE-local dimension of state |
| | 144 | INTEGER, INTENT(in) :: dim_obs_f ! Dimension of the full observed state |
| | 145 | REAL, INTENT(in) :: state_p(dim_p) ! PE-local model state |
| | 146 | REAL, INTENT(out) :: m_state_f(dim_obs_f) ! Full observed state |
| | 147 | }}} |
| | 148 | |
| | 149 | The routine is called during the analysis step, before the loop over the local analysis domain is entered. It has to perform the operation of the observation operator acting on a state vector, which is provided as `state_p`. The observed state has to be returned in `m_state_f`. It is the observed state corresponding to the 'full' observation vector. |
| | 150 | |
| | 151 | Hint: |
| | 152 | * The routine is similar to `init_dim_obs` used for the global filters. However, with a domain-decomposed model `m_state_f` will contain parts of the state vector from neighboring model sub-domains. To make these parts accessible, some parallel communication will be necessary (The state information for a neighboring model sub-domain, will be in the memory of the process that handles that sub-domain). The example implementation in `testsuite/dummymodel_1d` uses the function `MPI_AllGatherV` for this communication. |
| | 153 | |
| | 154 | === `U_init_obs_f` (init_obs_f_pdaf.F90) === |
| | 155 | |
| | 156 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 157 | The routine is only called if the globally adaptive forgetting factor is used (`type_forget=1` in the example implementation). For the local filters there is also the alternative to use locally adaptive forgetting factors (`type_forget=2` in the example implementation) |
| | 158 | |
| | 159 | The interface for this routine is: |
| | 160 | {{{ |
| | 161 | SUBROUTINE init_obs_f(step, dim_obs_f, observation_f) |
| | 162 | |
| | 163 | INTEGER, INTENT(in) :: step ! Current time step |
| | 164 | INTEGER, INTENT(in) :: dim_obs_f ! Dimension of full observation vector |
| | 165 | REAL, INTENT(out) :: observation_f(dim_obs_f) ! Full observation vector |
| | 166 | }}} |
| | 167 | |
| | 168 | The routine is called during the analysis step before the loop over the local analysis domains is entered. It has to provide the full vector of observations in `observation_f` for the current time step. The caller is the routine that computes an adaptive forgetting factor (PDAF_set_forget). |
| | 169 | |
| | 170 | Hints: |
| | 171 | * As for the other 'full' routines: While the global counterpart of this routine (`init_obs`) has to initialize the observation vector only for the local model sub-domain, the 'full' routine has to include observations that spatially belong to neighboring model sub-domains. As an easy choice one can simply initialize a vector of all globally available observations. |
| | 172 | * If the adaptive forgetting factor is not used, this routine only has to exist. However, no functionality is required. |
| | 173 | |
| | 174 | |
| | 175 | === `U_init_obs_l` (init_obs_l_pdaf.F90) === |
| | 176 | |
| | 177 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 178 | |
| | 179 | The interface for this routine is: |
| | 180 | {{{ |
| | 181 | SUBROUTINE init_obs_l(domain_p, step, dim_obs_l, observation_l) |
| | 182 | |
| | 183 | INTEGER, INTENT(in) :: domain_p ! Current local analysis domain |
| | 184 | INTEGER, INTENT(in) :: step ! Current time step |
| | 185 | INTEGER, INTENT(in) :: dim_obs_l ! Local dimension of observation vector |
| | 186 | REAL, INTENT(out) :: observation_l(dim_obs_l) ! Local observation vector |
| | 187 | }}} |
| | 188 | |
| | 189 | The routine is called during the analysis step during the loop over the local analysis domain. |
| | 190 | It has to provide the vector of observations for the analysis in the local analysis domain with index `domain_p` in `observation_l` for the current time step. |
| | 191 | |
| | 192 | Hints: |
| | 193 | * For parallel efficiency, the LNETF algorithm is implemented in a way that first the full vectors are initialized. These are then restricted to the local analysis domain during the loop over all local analysis domains. Thus, if the full vector of observations has been initialized before `U_init_obs_l` is executed (e.g. by `U_init_dim_obs_f`), the operations performed in this routine will be to select the part of the full observation vector that is relevant for the current local analysis domain. |
| | 194 | * The routine `U_init_dim_obs_l` is executed before this routine. Thus, if that routine already prepares the information which elements of `observation_f` are needed for `observation_l`, this information can be used efficiently here. |
| | 195 | |
| | 196 | |
| | 197 | === `U_prepoststep` (prepoststep_ens_pdaf.F90) === |
| | 198 | |
| | 199 | This routine can generally be identical to that used for the global LESTKF/ESTKF methods, which has already been described on the [ModifyModelforEnsembleIntegration#U_prepoststepprepoststep_ens_pdaf.F90 page on modifying the model code for the ensemble integration]. For completeness, the description is repeated: |
| | 200 | |
| | 201 | The interface of the routine is identical for all filters. However, the particular operations that are performed in the routine can be specific for each filter algorithm. Here, we exemplify the interface on the example of the NETF. |
| | 202 | |
| | 203 | The interface for this routine is |
| | 204 | {{{ |
| | 205 | SUBROUTINE prepoststep(step, dim_p, dim_ens, dim_ens_p, dim_obs_p, & |
| | 206 | state_p, Uinv, ens_p, flag) |
| | 207 | |
| | 208 | INTEGER, INTENT(in) :: step ! Current time step |
| | 209 | ! (When the routine is called before the analysis -step is provided.) |
| | 210 | INTEGER, INTENT(in) :: dim_p ! PE-local state dimension |
| | 211 | INTEGER, INTENT(in) :: dim_ens ! Size of state ensemble |
| | 212 | INTEGER, INTENT(in) :: dim_ens_p ! PE-local size of ensemble |
| | 213 | INTEGER, INTENT(in) :: dim_obs_p ! PE-local dimension of observation vector |
| | 214 | REAL, INTENT(inout) :: state_p(dim_p) ! PE-local forecast/analysis state |
| | 215 | ! The array 'state_p' is not generally not initialized in the case of SEIK/EnKF/ETKF/NETF. |
| | 216 | ! It can be used freely in this routine. |
| | 217 | REAL, INTENT(inout) :: Uinv(dim_ens, dim_ens) ! Inverse of matrix U |
| | 218 | REAL, INTENT(inout) :: ens_p(dim_p, dim_ens) ! PE-local state ensemble |
| | 219 | INTEGER, INTENT(in) :: flag ! PDAF status flag |
| | 220 | }}} |
| | 221 | |
| | 222 | The routine `U_prepoststep` is called once at the beginning of the assimilation process. In addition, it is called during the assimilation cycles before the analysis step and after the ensemble transformation. The routine is called by all filter processes (that is `filterpe=1`). |
| | 223 | |
| | 224 | The routine provides for the user the full access to the ensemble of model states. Thus, user-controlled pre- and post-step operations can be performed. For example the forecast and the analysis states and ensemble covariance matrix can be analyzed, e.g. by computing the estimated variances. In addition, the estimates can be written to disk. |
| | 225 | |
| | 226 | Hint: |
| | 227 | * If a user considers to perform adjustments to the estimates (e.g. for balances), this routine is the right place for it. |
| | 228 | * Only for the SEEK filter the state vector (`state_p`) is initialized. For all other filters, the array is allocated, but it can be used freely during the execution of `U_prepoststep`. |
| | 229 | * The interface has a difference for NETF/ETKF and SEIK: For the NETF/ETKF, the array `Uinv` has size `dim_ens` x `dim_ens`. In contrast it has size `dim_ens-1` x `dim_ens-1` for the SEIK filter. |
| | 230 | * The interface through which `U_prepoststep` is called does not include the array of smoothed ensembles. In order to access the smoother ensemble array one has to set a pointer to it using a call to the routine `PDAF_get_smootherens` (see page on [AuxiliaryRoutines auxiliary routines]) |
| | 231 | |
| | 232 | |
| | 233 | |
| | 234 | === `U_likelihood_l` (likelihood_l_pdaf.F90) === |
| | 235 | |
| | 236 | This routine is used by the LNETF only. |
| | 237 | |
| | 238 | The interface for this routine is: |
| | 239 | {{{ |
| | 240 | SUBROUTINE U_likelihood_l(domain_p, step, dim_obs_l, obs_l, resid_l, likely_l) |
| | 241 | |
| | 242 | INTEGER, INTENT(in) :: domain_p ! Current local analysis domain |
| | 243 | INTEGER, INTENT(in) :: step ! Current time step |
| | 244 | INTEGER, INTENT(in) :: dim_obs_l ! Dimension of local observation vector |
| | 245 | REAL, INTENT(in) :: obs_l(dim_obs_l) ! Local vector of observations |
| | 246 | REAL, INTENT(inout) :: resid_l(dim_obs_l) ! Input vector holding the local residual y-Hx |
| | 247 | REAL, INTENT(out) :: likely_l(dim_obs_l) ! Output value of the likelihood |
| | 248 | }}} |
| | 249 | |
| | 250 | The routine is called during the loop over the local analysis domains. In the NETF, as in other particle filters, the likelihood of the local observations has to be computed for each ensemble member. The likelihood is computed from the observation-state residual according to the assumed observation error distribution. Commonly, the observation errors are assumed to be Gaussian distributed. In this case, the likelihood is '''exp(-0.5*(y-Hx)^T^*R^-1^*(y-Hx))'''. |
| | 251 | |
| | 252 | This routine is also the place to perform observation localization. To initialize a vector of weights, the routine `PDAF_local_weight` can be called. The procedure is used in the example implementation and also demonstrated in the template routine. |
| | 253 | |
| | 254 | Hints: |
| | 255 | * The routine is a local variant of the routine `U_likelihood`. Thus if that routine has been implemented before, it can be adapted here for the local filter. |
| | 256 | * The routine is very similar to the routine [wiki:U_prodRinvA_l]. The main addition is the computation of the likelihood after computing '''R^-1^*(y-Hx)''', which corresponds to '''R^-1^*A_p''' in [wiki:U_prodRinvA_l]. |
| | 257 | * The information about the inverse observation error covariance matrix has to be provided by the user. Possibilities are to read this information from a file, or to use a Fortran module that holds this information, which one could already prepare in init_pdaf. |
| | 258 | * The routine does not require that the product is implemented as a real matrix-vector product. Rather, the product can be implemented in its most efficient form. For example, if the observation error covariance matrix is diagonal, only the multiplication of the inverse diagonal with the vector `resid` has to be implemented. |
| | 259 | * The observation vector `obs_l` is provided through the interface for cases where the observation error variance is relative to the actual value of the observations. |
| | 260 | |
| | 261 | |
| | 262 | === `U_init_n_domains` (init_n_domains_pdaf.F90) === |
| | 263 | |
| | 264 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 265 | |
| | 266 | The interface for this routine is: |
| | 267 | {{{ |
| | 268 | SUBROUTINE init_n_domains(step, n_domains_p) |
| | 269 | |
| | 270 | INTEGER, INTENT(in) :: step ! Current time step |
| | 271 | INTEGER, INTENT(out) :: n_domains_p ! Number of analysis domains for local model sub-domain |
| | 272 | }}} |
| | 273 | |
| | 274 | The routine is called during the analysis step before the loop over the local analysis domains is entered. |
| | 275 | It has to provide the number of local analysis domains. In case of a domain-decomposed model the number of local analysis domain for the model sub-domain of the calling process has to be initialized. |
| | 276 | |
| | 277 | Hints: |
| | 278 | * As a simple case, if the localization is only performed horizontally, the local analysis domains can be single vertical columns of the model grid. In this case, `n_domains_p` is simply the number of vertical columns in the local model sub-domain. |
| | 279 | |
| | 280 | |
| | 281 | === `U_init_dim_l` (init_dim_l_pdaf.F90) === |
| | 282 | |
| | 283 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 284 | |
| | 285 | The interface for this routine is: |
| | 286 | {{{ |
| | 287 | SUBROUTINE init_dim_l(step, domain_p, dim_l) |
| | 288 | |
| | 289 | INTEGER, INTENT(in) :: step ! Current time step |
| | 290 | INTEGER, INTENT(in) :: domain_p ! Current local analysis domain |
| | 291 | INTEGER, INTENT(out) :: dim_l ! Local state dimension |
| | 292 | }}} |
| | 293 | |
| | 294 | The routine is called during the loop over the local analysis domains in the analysis step. |
| | 295 | It has to provide in `dim_l` the dimension of the state vector for the local analysis domain with index `domain_p`. |
| | 296 | |
| | 297 | Hints: |
| | 298 | * If a local analysis domain is a single vertical column of the model grid, the size of the state in the local analysis domain will be just the number of vertical grid points at this location. |
| | 299 | |
| | 300 | |
| | 301 | === `U_init_dim_obs_l` (init_dim_obs_l_pdaf.F90) === |
| | 302 | |
| | 303 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 304 | |
| | 305 | The interface for this routine is: |
| | 306 | {{{ |
| | 307 | SUBROUTINE init_dim_obs_l(domain_p, step, dim_obs_f, dim_obs_l) |
| | 308 | |
| | 309 | INTEGER, INTENT(in) :: domain_p ! Current local analysis domain |
| | 310 | INTEGER, INTENT(in) :: step ! Current time step |
| | 311 | INTEGER, INTENT(in) :: dim_obs_f ! Full dimension of observation vector |
| | 312 | INTEGER, INTENT(out) :: dim_obs_l ! Local dimension of observation vector |
| | 313 | }}} |
| | 314 | |
| | 315 | The routine is called during the loop over the local analysis domains in the analysis step. |
| | 316 | It has to initialize in `dim_obs_l` the size of the observation vector used for the local analysis domain with index `domain_p`. |
| | 317 | |
| | 318 | Some hints: |
| | 319 | * Usually, the observations to be considered for a local analysis are those which reside within some distance from the local analysis domain. Thus, if the local analysis domain is a single vertical column of the model grid and if the model grid is a regular ij-grid, then one could use some range of i/j indices to select the observations and determine the local number of them. More generally, one can compute the physical distance of an observation from the local analysis domain and decide on this basis, if the observation has to be considered. |
| | 320 | * In the loop over the local analysis domains, the routine is always called before `U_init_obs_l` is executed. Thus, as `U_init_dim_obs_local` has to check which observations should be used for the local analysis domain, one can already initialize an integer array that stores the index of observations to be considered. This index should be the position of the observation in the array `observation_f`. With this, the initialization of the local observation vector in `U_init_obs_l` can be sped up. |
| | 321 | * For PDAF, we could not join the routines `U_init_dim_obs_l` and `U_init_obs_l`, because the array for the local observations is allocated internally to PDAF after its size has been determined in `U_init_dim_obs_l`. |
| | 322 | |
| | 323 | |
| | 324 | === `U_g2l_state` (g2l_state_pdaf.F90) === |
| | 325 | |
| | 326 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 327 | |
| | 328 | The interface for this routine is: |
| | 329 | {{{ |
| | 330 | SUBROUTINE global2local_state(step, domain_p, dim_p, state_p, dim_l, state_l) |
| | 331 | |
| | 332 | INTEGER, INTENT(in) :: step ! Current time step |
| | 333 | INTEGER, INTENT(in) :: domain_p ! Current local analysis domain |
| | 334 | INTEGER, INTENT(in) :: dim_p ! State dimension for model sub-domain |
| | 335 | INTEGER, INTENT(in) :: dim_l ! Local state dimension |
| | 336 | REAL, INTENT(in) :: state_p(dim_p) ! State vector for model sub-domain |
| | 337 | REAL, INTENT(out) :: state_l(dim_l) ! State vector on local analysis domain |
| | 338 | }}} |
| | 339 | |
| | 340 | The routine is called during the loop over the local analysis domains in the analysis step. It has to provide the local state vector `state_l` that corresponds to the local analysis domain with index `domain_p`. Provided to the routine is the state vector `state_p`. With a domain decomposed model, this is the state for the local model sub-domain. |
| | 341 | |
| | 342 | Hints: |
| | 343 | * In the simple case that a local analysis domain is a single vertical column of the model grid, the operation in this routine would be to take out of `state_p` the data for the vertical column indexed by `domain_p`. |
| | 344 | |
| | 345 | |
| | 346 | === `U_l2g_state` (l2g_state_pdaf.F90) === |
| | 347 | |
| | 348 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 349 | |
| | 350 | The interface for this routine is: |
| | 351 | {{{ |
| | 352 | SUBROUTINE l2g_state(step, domain_p, dim_l, state_l, dim_p, state_p) |
| | 353 | |
| | 354 | INTEGER, INTENT(in) :: step ! Current time step |
| | 355 | INTEGER, INTENT(in) :: domain_p ! Current local analysis domain |
| | 356 | INTEGER, INTENT(in) :: dim_p ! State dimension for model sub-domain |
| | 357 | INTEGER, INTENT(in) :: dim_l ! Local state dimension |
| | 358 | REAL, INTENT(in) :: state_p(dim_p) ! State vector for model sub-domain |
| | 359 | REAL, INTENT(out) :: state_l(dim_l) ! State vector on local analysis domain |
| | 360 | }}} |
| | 361 | |
| | 362 | The routine is called during the loop over the local analysis domains in the analysis step. It has to initialize the part of the global state vector `state_p` that corresponds to the local analysis domain with index `domain_p`. Provided to the routine is the state vector `state_l` for the local analysis domain. |
| | 363 | |
| | 364 | Hints: |
| | 365 | * In the simple case that a local analysis domain is a single vertical column of the model grid, the operation in this routine would be to write into `state_p` the data for the vertical column indexed by `domain_p`. |
| | 366 | |
| | 367 | |
| | 368 | === `U_g2l_obs` (g2l_obs_pdaf.F90) === |
| | 369 | |
| | 370 | This routine is used by all filter algorithms with domain-localization (LESTKF, LETKF, LSEIK, LNETF) and is independent of the particular algorithm. |
| | 371 | |
| | 372 | The interface for this routine is: |
| | 373 | {{{ |
| | 374 | SUBROUTINE g2l_obs(domain_p, step, dim_obs_f, dim_obs_l, mstate_f, mstate_l) |
| | 375 | |
| | 376 | INTEGER, INTENT(in) :: domain_p ! Current local analysis domain |
| | 377 | INTEGER, INTENT(in) :: step ! Current time step |
| | 378 | INTEGER, INTENT(in) :: dim_obs_f ! Dimension of full observation vector for model sub-domain |
| | 379 | INTEGER, INTENT(in) :: dim_obs_l ! Dimension of observation vector for local analysis domain |
| | 380 | REAL, INTENT(in) :: mstate_f(dim_obs_f) ! Full observation vector for model sub-domain |
| | 381 | REAL, INTENT(out) :: mstate_l(dim_obs_l) ! Observation vector for local analysis domain |
| | 382 | }}} |
| | 383 | |
| | 384 | The routine is called during the loop over the local analysis domains in the analysis step. It has to provide a local observation vector `mstate_l` for the observation domain that corresponds to the local analysis domain with index `domain_p`. Provided to the routine is the full observation vector `mstate_f` from which the local part has to be extracted. |
| | 385 | |
| | 386 | Hints: |
| | 387 | * The vector `mstate_f` that is provided to the routine is one of the observed state vectors that are produced by `U_obs_op_full`. |
| | 388 | * Some operations performed here are analogous to those required to initialize a local vector of observations in `U_init_obs_l`. If that routine reads first a full vector of observations (e.g. in `U_init_dim_obs_f`), this vector has to be restricted to the relevant observations for the current local analysis domain. For this operation, one can for example initialize an index array when `U_init_dim_obs_l` is executed. (Which happens before `U_global2local_obs`) |
| | 389 | |
| | 390 | |
| | 391 | === `U_next_observation` (next_observation_pdaf.F90) === |
| | 392 | |
| | 393 | This routine is independent of the filter algorithm used. |
| | 394 | See the page on [InsertAnalysisStep#U_next_observationnext_observation_pdaf.F90 inserting the analysis step] for the description of this routine. |
| | 395 | |
| | 396 | == Execution order of user-supplied routines == |
| | 397 | |
| | 398 | The user-supplied routines are executed in the order listed below. The order can be important as some routines can perform preparatory work for routines executed later on during the analysis. For example, `U_init_dim_obs_l` can prepare an index array that provides the information how to localize a 'full' vector of observations. Some hints one the efficient implementation strategy are given with the descriptions of the routine interfaces above. |
| | 399 | |
| | 400 | Before the analysis step is called the following is executed: |
| | 401 | 1. [#U_collect_statecollect_state_pdaf.F90 U_collect_state] (called once for each ensemble member) |
| | 402 | |
| | 403 | When the ensemble integration of the forecast is completed, the analysis step is executed. Before the loop over all local analysis domains, the following routines are executed: |
| | 404 | 1. [#U_prepoststepprepoststep_ens_pdaf.F90 U_prepoststep] (Call to act on the forecast ensemble, called with negative value of the time step) |
| | 405 | 1. [#U_init_n_domainsinit_n_domains_pdaf.F90 U_init_n_domains] |
| | 406 | 1. [#U_init_dim_obs_finit_dim_obs_f_pdaf.F90 U_init_dim_obs_f] |
| | 407 | 1. [#U_obs_op_fobs_op_f_pdaf.F90 U_obs_op_f] (Called `dim_ens` times; once for each ensemble member) |
| | 408 | |
| | 409 | In the loop over all local analysis domains, it is executed for each local analysis domain: |
| | 410 | 1. [#U_init_dim_linit_dim_l_pdaf.F90 U_init_dim_l] |
| | 411 | 1. [#U_init_dim_obs_linit_dim_obs_l_pdaf.F90 U_init_dim_obs_l] |
| | 412 | 1. [#U_g2l_stateg2l_state_pdaf.F90 U_g2l_state] (Called `dim_ens+1` times: Once for each ensemble member and once for the mean state estimate) |
| | 413 | 1. [#U_init_obs_linit_obs_l_pdaf.F90 U_init_obs_l] |
| | 414 | 1. [#U_g2l_obsg2l_obs_pdaf.F90 U_g2l_obs] (`dim_ens` calls: one call to localize the observed part of each ensemble member) |
| | 415 | 1. [#U_lkelihood_lprodrinva_l_pdaf.F90 U_likelihood_l] (`dim_ens` calls: one call to localize the observed part of each ensemble member) |
| | 416 | 1. [#U_l2g_statel2g_state_pdaf.F90 U_l2g_state] (Called `dim_ens+1` times: Once for each ensemble member and once for the mean state estimate) |
| | 417 | |
| | 418 | After the loop over all local analysis domains, it is executed: |
| | 419 | 1. [#U_prepoststepprepoststep_ens_pdaf.F90 U_prepoststep] (Call to act on the analysis ensemble, called with (positive) value of the time step) |
| | 420 | |
| | 421 | In case of the routine `PDAF_assimilate_lnetf`, the following routines are executed after the analysis step: |
| | 422 | 1. [#U_distribute_statedistribute_state_pdaf.F90 U_distribute_state] |
| | 423 | 1. [#U_next_observationnext_observation_pdaf.F90 U_next_observation] |
| | 424 | |
| | 425 | |
