{'fraction_non_alphanumeric': 0.03105841346901939, 'fraction_numerical': 0.012199296673202005, 'mean_word_length': 4.686427181029906, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 3, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Improved Data Assimilation Scheme for High Dimensional Nonlinear Systems

Nonlinear/non-Gaussian filtering has broad applications in many areas of life sciences where either the dynamic is nonlinear and/or the probability density function of uncertain state is non-Gaussian. In such problems, the accuracy of the estimated quantities depends highly upon how accurately their posterior pdf can be approximated. In low dimensional state spaces, methods based on Sequential Importance Sampling (SIS) can suitably approximate the posterior pdf. For higher dimensional problems, however, these techniques are usually inappropriate since the required number of particles to achieve satisfactory estimates grows exponentially with the dimension of state space. On the other hand, ensemble Kalman filter (EnKF) and its variants are more suitable for large-scale problems due to transformation of particles in the Bayesian update step. It has been shown that the latter class of methods may lead to suboptimal solutions for strongly nonlinear problems due to the Gaussian assumption in the update step. In this paper, we introduce a new technique based on the Gaussian sum expansion which captures the non-Gaussian features more accurately while the required computational effort remains within reason for high dimensional problems. We demonstrate the performance of the method for non-Gaussian processes through several examples including the strongly nonlinear Lorenz models. Results show a remarkable improvement in the mean square error compared to EnKF, and a desirable convergence behavior as the number of particles increases.

exploration, etc. [18,23,13,29,5]. It involves incorporating sparse observational data (usually corrupted by noise) into computer models to obtain reliable estimates of unknown state and parameters of a dynamical system.
Many data assimilation techniques have been suggested to date that usually fall into one of the two main categories: variational and sequential. Variational methods deal with batch of data at specific time interval and aim to find the best possible estimate by minimizing a penalty function which usually includes the model, initial and boundary condition, and observational errors defined under certain statistical hypothesis [3]. Examples of this kind include 4D-var [30] and representer method [4]. On the other hand, in sequential data assimilation, which is also the approach adopted in this paper, the model variables are updated every time observations become available and may thus be computationally less expensive than the former [12]. Examples of such techniques include Kalman filter and its variants [17,11,5].
In recent years, there has been a significant interest in developing sequential filtering strategies that could more accurately predict the state of a nonlinear process when the number of unknown variables is considerable. van Leeuwen [31] gives an excellent review of recently developed nonlinear filtering schemes. These methods are mostly based on a Monte Carlo approximation of probability distribution function (pdf)'s of concern.
There exists Sequential Importance Sampling (SIS) based filters that represent a pdf as the weighted sum of delta functions centered at finite number of particles. In the simplest form, the weights are updated upon receiving observations while the particles remain intact [9]. Such approach usually requires the user of SIS to carefully choose a proposal density function from which the particles are drawn since it is desirable to have particles in areas with high likelihood.
There are also ensemble Kalman filter (EnKF) based algorithms that approximate a pdf using i.i.d. samples (i.e., equal weights). Upon receiving observations, the weights remain equal while the samples (particles) are moved. EnKF was proposed by Evensen [10,6] and has been successfully applied to many large-scale nonlinear estimation problems so far [11,15,13,24]. Much of the success of EnKF over SIS filter for large-scale problems is attributed to the fact that it nudges the particles to areas of higher likelihood [31]. Moreover, it is attractive in that it is conceptually simple, easy to implement and does not require computing the adjoint operator as needed in variational setting. Despite all its success in the nonlinear estimation arena, its tendency to generate unimodal pdf's may result in suboptimal results when the posterior pdf is far from Gaussian distribution [23,31]. This is mainly attributed to the fact that in the Bayesian update step, EnKF approximates the prior density function with a Gaussian pdf [11].
As computers become more powerful, resolution and complexity of numerical models tend to increase resulting in strongly nonlinear systems and hence there is a need to develop new strategies that could more accurately capture the non-Gaussian statis-tics [31,32]. It is this fact that led to the development of compound filters that try to combine the EnKF with SIS in order to obtain a more accurate representation of posterior pdf. Examples of such attempts can be found in [23,32]. The idea behind these methods is to use the posterior pdf obtained from the EnKF as the proposal density for the SIS filter. Though these methods are attractive in that they approximate the posterior pdf more accurately than the EnKF does, in the opinion of the author, the two stage filtering introduces new tuning parameters (c.f. [23]) and imposes extra computational cost as a result of explicit density kernel estimation which makes it hard to justify for large dimensions. The above mentioned difficulties are what motivated this study to reexamine the fundamentals of ensemble filtering and to possibly address some of these issues.
In what follows we introduce a new methodology, the ensemble Gaussian sum filter (EnGSF) which tends to approximate the non-Gaussian statistics more accurately. This paper is organized as follows: In section 1 we introduce the general filtering problem. The theory and details of the ensemble Gaussian sum filter (EnGSF) is presented in section 2. Section 3 contains several numerical examples that shows the performance the methodology for nonlinear estimation problems. Finally, conclusion and future work are presented in section 4.

Problem Statement
Filtering in control and estimation theory refers to a process comprised of two stages, one of forecast and the other of data assimilation by which one can anticipate the dynamics of natural and physical systems. To further clarify, let us assume that the following Morkov model represents the dynamics of the system under study where f (·) : R m → R m is the so-called model operator, x k ∈ R m is the state of the system at time k and ∈ R m is the noise component representing the modeling uncertainty. Such equation is usually derived from discretization of a set of partial differential equations. Moreover, suppose that observational data are available at distinct instances in time and are related to the uncertain state variables through the following equation: Here, y k ∈ R n is the vector of observations at time k, H n×m is the measurement operator and r ∈ R n is the measurement noise vector. The uncertain state variable x k can be fully described by a pdf. The assimilation step of filtering then involves exploiting the observational data to improve the knowledge on the pdf of the process while the forecast step refers to evolving the state variables using model equation 1. In terms of pdf's, the forecast step involves finding prior pdf at time k using information up to time k − 1, p(x k |y 1:k−1 ), through Chapman-Kolmogorov equation [2] p(x k |y 1: The assimilation step involves obtaining the posterior pdf which contains information up to time k, p(x k |y 1:k ), using Baye's theorm The resulting pdf's in equations (3) and (4) can not in general be determined analytically unless for linear dynamics under certain assumptions [17,16]. For linear dynamics in which only Gaussian pdf's are involved, an optimal filter exists which is known as Kalman filter (KF) [17] in the relevant literature. For nonlinear/non-Gaussian cases, however, there is practically no optimal filter. This has led to the development of numerous sub-optimal filters that seek an estimate either by linearizing the nonlinear model (e.g. extended Kalman filter (EKF)) or approximating the pdf of the process by a collection of particles (e.g. EnKF, SIS filter) [31,11,2].

Ensemble Gaussian Sum Filter
A non-Gaussian pdf can be approximated as the sum of finite number of Gaussian kernels known as Gaussian sum expansion [1,28]. To the best of author's knowledge, the early attempt to use such expansion for nonlinear filtering problems is the work of Sorenson in early 70's [28]. It is desirable since the sum of Gaussian kernels is always a valid density function regardless of the number of terms used in the expansion and converges uniformly to any desired density function [28].
In this section, we first present the fundamentals of Gaussian sum expansion and subsequently introduce an improved filtering methodology for large-scale nonlinear/non-Gaussian dynamics. We call the new method, the ensemble Gaussian sum filter (En-GSF) since it is built upon the ideas of ensemble data assimilation and principles of Gaussian sum filter.

Gaussian sum expansion
Since the Gaussian kernel is considered amongst the delta family of positive functions, any arbitrary pdf g can be approximated by g Σ as [28], g Σ converges uniformly to g as Σ → 0. Therefore, a discrete approximation to g(x) may be obtained as follows: where we refer to α i 's as the weights of Gaussian kernels throughout this paper. It is notable as the variance Σ decreases, the Gaussian kernels become closer to Dirac delta functions and the approximation in the limit of zero variance become identical to the one used in the SIS filter.

Bayesian update
In this section, the Baye's update equation, eq. (4), is approximated using the Gaussian sum expansion as the basis of our approximation. In the following derivation, we assume that the measurement noise in eq. (2) is distributed according to N (0, R). We also drop the time subscript k and denote the prior pdf by p(x) to avoid complication in notation. Suppose that prior pdf is given by: One can then show that the posterior pdf is given by [28]: where Throughout this paper, we use superscripts "f" and "a" to represent forecast (prior to the receipt of data) and analysis (after assimilation of data) respectively.
According to the above formulas, a choice of (α . Therefore, an appropriate choice of prior parameters is crucial for obtaining an accurate estimate of the posterior pdf. The weights and particle supports, (α f i , x f i ), can be assigned upon initialization of the filter whereas the covariance matrices Σ i 's will be calculated at each assimilation step from the statistics of the ensemble of particles. Therefore, it is convenient to start filter with i.i.d samples of the prior. It is noted that sampling from the prior when the number of variables is large is not a trivial task. However, for Gaussian pdf's with special covariance structure, there are methods based on Fast Fourier Transform (FFT) [8,34] or polynomial expansion of the square root of covariance matrix [7] by which one can generate initial realizations in a reasonable period of time. The fundamental assumption here is that the initial setup of the filter will be forgotten after forward integration of a dynamical system in a certain period of time.
Moreover, it is both practical and convenient to choose the same covariance matrix for all particles. Such assumption significantly reduces the cost of data assimilation.
In what follows, we give the theory for choosing an appropriate covariance matrix.

A good choice of Σ f
Choosing an appropriate covariance matrix for individual Gaussian kernels is a crucial step since it ultimately determines the direction and amount of movement for each individual particle. This is usually discussed under the rubric of bandwidth selection in density estimation literature [27].
Σ f can be found by minimizing the Mean Integrated Squared Error (MISE) between the true prior pdf, p(x), and the one estimated using Gaussian sum, g Σ (x) [26,27]: where E{·} indicates the theoretical expectation. Here we eliminated superscript "f " for the sake of clarity. According to the above equations, the problem of determining the optimal choice of Σ is a trade-off between bias in the approximation of a pdf and variance of the probability weights. In addition, the optimization procedure requires the complete knowledge of the prior probability which is usually not available. This makes the optimal choice to some extent subjective though it is possible to find approximate solutions for it. It is shown in [27] that assuming a Gaussian pdf as the underlying density at this stage is an appropriate assumption in many cases. Based on this assumption an approximate covariance matrix is obtained as [27]: where N is the number of particles, m is the dimension of state vector, P is the theoretical prior covariance and c is a constanct defined by: Note that c varies between 0.85 and 1.12 with an assymptotic value of 1.0 for large m. Therefore it can be safely replaced by 1.0, leading to: The above equations indicate that Σ depends upon two factors: (a) the number of particles and (b) the dimension of state space. Given a fixed number of particles, as the dimension of state space increases, larger covariance matrices needed for individual particles to efficiently approximate prior pdf. Note that equation (15) is sometimes referred to as the Silverman's rule of thumb and is only optimal for Gaussian pdfs. It tends to oversmoothen the non-Gaussian densities and hence it is usually beneficial to use a smaller covariance matrix in practice as suggested also in [27]. In this paper, we adopt a slightly modified equation for the covariance of individual samples which is given by: where we have changed the power of N such that the covariance is always smaller than that obtained by equation (15). It is worth noting that the expression for Σ f given by equation (16) is consistent with the bandwidth suggested by Scott [26] based on the theory of histograms and tend to generate more satisfactory estimates in lower dimensions according to authors' experience. For higher dimensional problems, the effect of this change is minimal as Σ f → P . At this point, inspired by the ensemble data assimilation strategies, we replace the true (theoretical) covariance P by the weighted ensemble (empirical) covariance arriving at the following equation for Σ f : where the weighted ensemble covariance matrix is defined by: wherex = i α i x i is the weighted empirical mean. Eq. (17) is the expression used in all the numerical examples performed in this paper.

Forecast Step
To predict the state of a system in the absence of data, one needs to calculate the Chapman-Kolmogrov integral equation, where Q i is the covariance of each sample after integration. In EKF type algoithms, this covariance is calculated using derivatives of the nonlinear function f (x) at the current estimate. This is the approach adopted in [28] for example. In this paper, however, we replace Q i with Σ f given by equation (17) derived from the statistics of the forecast ensemble. Based on the the above formula, calculating the integral only involves forward integration of the model equation (1) for individual particles.

Degeneracy and Resampling
Since the methodology discussed in this paper assumes that the weights associated with particles may be different, it is expected that over time these weights become inconsistently non-uniform and after certain time a few particles carry most of the probability mass. This phenomenon which is named degeneracy in filtering literature is a common attribute of almost all particle filtering techniques [31]. For the SIS particle filter, it is shown that the variance of the weights can only increase over time [9] and hence degeneracy is unavoidable. Degeneracy is undesirable since one makes extra effort updating particles that are of minimal weight in addition to the issues that may arise in approximating the covariance when needed. Moreover, for the times when there is no data (i.e., prediction steps) a large noise in the forward integration of the stochastic dynamical model for particles of high weight may take those to locations far from the true state resulting in an undesirable forecasts whereas this phenomenon is usually not present in case with equally probable particles.
To reduce the effect of degeneracy, one usually resamples the posterior pdf when the number of particles with considerable weight decreases. Resampling generally involves ignoring particles with small weights and focusing on the particles that carry larger weights. The reader if referred to [9] for a detailed discussion on different resampling strategies. An appropriate measure of degeneracy is the effective number of particles, N ef f introduced in [19] and is defined by, where α * is the so-called true weight. This expression cannot be evaluated exactly, however, it can be estimated using the following formula [9,2]: In SIS filter, one usually resamples if N ef f becomes less than a given treshold, N treshold . In our approach, we prefer to resample every time data are assimilated since EnGSF relies on the covariance matrix obtained from the particles. A typical resampling algorithm is given below: • Initialize CDF: c 0 = 0 • Start at the bottom of CDF: i = 0 Note that the weighting step of EnGSF is quite similar to that of SIS, however, particles are moved to the best possible positions after weighting unlike the SIS filter in which particles are fixed in their positions. Transformation of particles after weighting is what prevents filter divergence even in high-dimensional cases with small number of particles.
From another perspective, EnGSF may be looked as a collection of EnKFs acting together and are weighted according to their importance. The importance is measured by how close a specific particle (i.e., the mean of a Gaussian kernel) is to the measurement with respect to a suitable distance measure.
It is a known fact that resampling may reduce the diversity of particles and hence modeling uncertainty is an essential tool in such settings to introduce more diversity. Note that in the EnGSF, each analysis particle carries a Gaussian kernel which may be used to introduce more diversity. In particular, when only one particle carry all the probability mass (i.e., α a s = 1.0 for x a s ), we can perform a Gaussian re-sampling step by the following transformation: where and columns of the so-called measurement and state perturbation matrices are given by: Y (:,j) = y + r j , r j ∼ N (0, R) The above equations are the same introduced in [6]. It can be shown that samples obtained using eq. (21) will asymptotically (i.e., in the limit of very large ensemble) have the desired mean and covariance given by eqs. (10) and (11) respectively. Thus Gaussian resampling involves adding adequate perturbations to the analysis particles to achieve the desired spread. Though not explored in this work, it may be beneficial to use the resampling ideas from the recently advised Merging Particle Filter [25].

The complete algorithm for EnGSF
The complete algorithm for the EnGSF is summarized below: • END FOR • FOR i = 1 : N -Calculate weights α a i according to eq. (9) -Calculate analysis particles x a i according to eq. (10) • END FOR

Numerical Illustration
In this section, we provide four numerical examples to test the performance of our method in forecasting state of nonlinear dynamics. The first two examples are one dimensional and have previously appeared in [23]. The third and forth examples are the celebrated three and forty dimensional Lorenz models [20,21] which have been studied extensively in the data assimilation literature.

Example 1: One-dimensional Bayesian update
In this example, we study one step of a non-Gaussian Bayesian update. We consider prior and likelihood pdf's of the following forms Here η is a normalization constant so that ∞ −∞ p(x) dx = 1. Such set up may happen in nonlinear dynamics when the system is in transition between stable points as will be demonstrated in the next example. We draw i.i.d samples from the prior and estimate the posterior pdf using different methods for various number of particles. The true pdf's are plotted in Fig. (1). Fig. (2) shows the posterior pdf approximated using three different data assimilation methods, namely EnKF, ensemble square root filter (EnSRF) and EnGSF.  Clearly, increasing the number of particles has little effect on the posterior pdf obtained using EnKF and EnSRF while that of EnGSF converges to the true posterior. This may be attributed to the fact that EnKF and its variants are optimal w.r.t only the first two statistical moments. Another interesting observation one can make from these plots is the difference between EnKF and EnSRF while both methods are from the same family. It is clear that EnSRF is capable of detecting some bimodal behavior whereas EnKF tend to smooth out bimodality. This discrepancy may be attributed to the fact that in EnKF, observations are treated as random variables and perturbed in order to maintain a reasonable variance. This results show another bad side effect of perturbing observations in addition to those pointed out in [33].
The movement of particles are also plotted in the same figure. The bottom and top particles are those of prior and posterior respectively. The size of particles is proportional to their weights. It is clear that the transformation of particles is of significant importance in capturing the accurate posterior pdf. Owing to the fact that in EnKF particles are assumed equally weighted, ideally one needs a transformation that takes the i.i.d samples of prior and outputs i.i.d samples of posterior if one wants to achieve the correct pdf. Clearly the transformation performed in the EnKF does not do so for a general pdf.
A measure of the difference between two pdf may be obtained using Kullback-Leibler (KL) divergence. we use this measure in order to study the convergence behavior of different data assimilation methods in this paper. The KL divergence for continuous probability density functions p and q is defined as: Here, p is chosen to be the true pdf while q is the approximate pdf obtained using one of the data assimilation techniques. A discrete approximation of eq. (28) may be obtained by:D Fig. (3) shows the KL divergence curve for the three methods discussed in this paper. Clearly, the convergence of EnKF and EnSRF is insensitive to the number of particles, N , used in the process of data assimilation. EnGSF, however, shows a monotonic convergence as N increases.

Example 2: One-dimensional nonlinear stochastic differential equation
In this example, we apply the same methods discussed in the previous example and the Sequential Importance Resampling (SIR) filter to predict the state of a nonlinear stochastic differential equation (SDE) using noisy and sparse observational data. Note  that SIR filter is the same as SIS filter in which one performs resampling after each data assimilation step. We consider the following Itó stochastic differential equation (SDE):

EnGSF EnKF EnSRF
Here, ξ(t) is a Gaussian white noise representing the modeling uncertainty and κ determines the magnitude of the noise. The deterministic part of the above SDE f (u) = 4u(t)−4u(t) 3 corresponds to the potential function of the form f (u) = 2u 2 −u 4 for which there are three equilibrium points, two stable at u = ±1 and one unstable at u = 0.
For κ greater than a certain threshold, the state of the above SDE can change from one stable fixed point to the other. Keeping the amount of noise small, however, makes such transitions rare. The pdf of state while system is in transition between stable fixed points is usually non-Gaussian. Therefore, a possible test to assess the performance of a nonlinear filter is to observe its behavior in tracking such transition [23]. Fig. (4) shows an exemplar of the true state and observations generated using κ = 0.7, u(0) = 0.8 and variance of the noise R = 0.1. Fig. (5) shows the estimated mean for different schemes with N = 100. As is clear, EnKF and EnSRF are slow in making the transition as also reported in [23]. Also, the difference between the two is minimal as expected in case with larger number of particles. It must be noted that EnSRF may result in a slightly better estimates due to using a modified gain matrix in the update step which eliminates the need of perturbing observations. However, in the experience of the authors its limitation for incorporating measurements serially limits the use of vectorized computer architecture and may result in excessive overhead when the number of data is large. Moreover, the  transformation of the gain matrix may not be accurate when covariance localization is applied ans some care must be taken as pointed out in [33].
It is a known fact that SIR filter does not track the transition effectively when the number of particles is small which is consistent with the results obtained here. EnGSF, however, tracks the transition more accurately. This is attributed to the fact that the posterior pdf approximated by EnGSF tend to be more accurate than those of other schemes in areas of non-Gaussian behavior. As a result of this, the time averaged root mean squared error (RMSE) of the estimate obtained by EnGSF is almost half the one of EnKF (0.33 vs. 0.64). Though we have reported the mean here, it must be noted that the mean may not be an appropriate measure to compare different algorithms in case of non-Gaussian/nonlinear problems as also pointed out in [2]. Fig. (6) shows the posterior pdf at the time of transition, (i.e., t = 4). The optimal posterior density function is obtained using SIR filter with 10, 000 particles. While EnKF, EnSRF and SIR produce a biased and unimodal estimate of the posterior, EnGSF results in a more accurate estimate of the posterior pdf which captures the non-Gaussian features effectively.

Example 3: Three dimensional Lorenz63 model
The Lorenz63 model [20] is a set of three coupled nonlinear ordinary differential equations defined by: where x(t), y(t), z(t) are time dependent unknown variables. The commonly chosen parameters are γ = 10, ρ = 28 and β = 8/3. To integrate the above equations, we use a forth order Runge-Kutta scheme with a time step of ∆t = 0.01. The Lorenz63 model has been the subject of many data assimilation studies due to its nonlinear and chaotic nature (c.f., [14,25,33]). Here, we study the behavior of EnGSF and EnKF in tracking the state of the lorenz63 model. A reference solution is generated by integrating the model in the time interval t ∈ [0, 100] with the initial condition (x 0 ; y 0 ; z 0 ) = (1.508870; −1.531271; 25.46091) and a diagonal model error covariance with variances equal to 2.0, 12.13 and 12.31 corresponding to the error growth over one time unit for x, y and z respectively. These are the same values used in reference [14]. The stochastic term is applied as dq = σ √ ∆t dξ where σ 2 is the variance and dξ is drawn from unit normal. Observations are collected for all variables by adding Gaussian noise with standard deviation of 2.5 to the reference solution and the distance between consecutive observations are assumed ∆t obs = 0.5. At this level of sparsity and noise, it is expected that non-Gaussian features become important. For the data assimilation, we used the same modeling error covariance by which the reference solution is obtained. The initial realizations are generated from a multivariate normal distribution having mean equal to (x 0 ; y 0 ; z 0 ) and covariance equal to 4I 3 . The number of particles is set to N = 200 Optimal EnGSF (c) (d) Figure 6: Posterior pdf at t = 4 obtained from different data assimilation techniques with N = 100 particles: (a) EnKF (b) EnSRF (c) SIR and (d) EnGSF. The optimal posterior pdf is obtained using SIR filter with N = 10, 000 particles the reference solution and the estimates obtained using EnKF and EnGSF. Similar plot is shown in Fig. (3.3) for the y variable. Clearly, large errors take place in the transition areas (such as t = 25) as also pointed out in [14]. However, we observe that EnGSF results in lower errors compraed to that of EnKF in such areas. For this experiment, we observed a time-averaged RMSE of 3.42 for EnGSF and 3.74 for EnKF. It is notable that this number for SIR filter with 2000 particles was 3.39.

Example 4: Forty dimensional Lorenz95 model
Lorenz95 model [21] is a system of coupled nonlinear ordinary differential equations defined by: with periodic boundary conditions defined by This model resembles dynamics of the atmosphere and has been shown to behave chaotically for F greater than 4.0 and m = 40 [22]. Though the dimension of state space for this model is still far from those of the real world, It is considered as a challenging problem from the perspective of data assimilation because of its highly chaotic nature [32].
Here we set m = 40, F = 8.0 and the initial condition is chosen to be (x j = F, j = 20) and x 20 = 1.001F . A forth order Runge-Kutta scheme with a time step of ∆t = 0.01 is used to integrate the model. It is shown in [22] that a time step of 0.05 unit in the model corresponds to 6-h in real life. Observations are collected for all variables every 5 time step (6-h) for a period of 5000 time step after a spinup period of 2000 time steps. Note that this choice of observational time corresponds to a regime where the effect of non-Gaussian statistics are significant [32,25]. The observational noise is considered Gaussian according to N (0, 2I 40 ). The initial prior pdf is considered Gaussian with uncorrelated variables each having mean and variance equal to 2.0. The model noise is applied as dq = σ √ ∆t dξ where the variance σ 2 is set to 25.0 and dξ is drawn from unit normal.

Conclusion
We have presented a new methodology, the EnGSF, for nonlinear tracking and estimation problem. The EnGSF, as shown through several numerical examples, has the ability to represent non-Gaussian statistics more accurately than currently operational data assimilation schemes such as EnKF. This may be beneficial for dynamics with highly non-linear behavior.
Moreover, as computers become more powerful, one would expect that the number of forward runs one can perform in a certain time interval increases and so data assimilation can be carried out with more particles. This brings about the need for data assimilation schemes that could effectively utilize higher order statistical moments than only the first two. The convergence results of the EnGSF presented in this paper show that the method scales well with the number of particles as opposed to EnKF and its variants that are optimal with respect to only the first two moments.
Another advantage of the EnGSF is its affordable computational cost compared to other nonlinear estimation techniques. For instance, in compound methods that use the posterior pdf obtained by EnKF as the proposal density for SIS filter (cf. [23,32]), the computational cost while calculating the weights may become cumbersome for large-scale problems, though these methods are certainly attractive in that a more accurate representation of pdf is obtained as a result of two stage filtering. Note that the computational cost of EnGSF is proportional to that of EnKF.
The EnGSF has clear connections to SIS filter and hence one expects that new resampling ideas such as those introduced in [25] enhance the performance of the method though not explored in this paper. On the other hand, the methodology can be looked as a weighted collection of EnKF's acting together. Therefore, all the implementation aspects of the EnKF, such as localization, are also applicable for the EnGSF.