Effects of physical parameter range on dimensionless variable sensitivity in water flooding reservoirs

The similarity criterion for water flooding reservoir flows is concerned with in the present paper. When finding out all the dimensionless variables governing this kind of flow, their physical meanings are subsequently elucidated. Then, a numerical approach of sensitivity analysis is adopted to quantify their corresponding dominance degree among the similarity parameters. In this way, we may finally identify major scaling law in different parameter range and demonstrate the respective effects of viscosity, permeability and injection rate.

Effects of physical parameter range on dimensionless variable sensitivity in water flooding reservoirs

The similarity criterion for water flooding reservoir flows is concerned with in the present paper. When finding out all the dimensionless variables governing this kind of flow, their physical meanings are subsequently elucidated. Then, a numerical approach of sensitivity analysis is adopted to quantify their corresponding dominance degree among the similarity parameters. In this way, we may finally identify major scaling law in different parameter range and demonstrate the respective effects of viscosity, permeability and injection rate.

Sequential Monte Carlo computation of the score and observed information matrix in state-space models with application to parameter estimation

Sequential Monte Carlo (SMC) methods are popular computational tools for Bayesian inference in non-linear non-Gaussian state-space models. For this class of models, we propose SMC algorithms to compute the score vector and observed information matrix recursively in time. We propose two different SMC implementations, one with computational complexity $\mathcal{O}(N)$ and the other with complexity $\mathcal{O}(N^{2})$ where $N$ is the number of importance sampling draws. Although cheaper, the performance of the $\mathcal{O}(N)$ method degrades quickly in time as it inherently relies on the SMC approximation of a sequence of probability distributions whose dimension is increasing linearly with time. In particular, even under strong \textit{mixing} assumptions, the variance of the estimates computed with the $\mathcal{O}(N)$ method increases at least quadratically in time. The $\mathcal{O}(N^{2})$ is a non-standard SMC implementation that does not suffer from this rapid degrade. We then show how both methods can be used to perform batch and recursive parameter estimation.