A History Matching Procedure for Non-Gaussian Facies Based on ES-MDA

Author(s):  
Duc H. Le ◽  
Rami Younis ◽  
Albert C. Reynolds
2016 ◽  
Vol 138 ◽  
pp. 189-200 ◽  
Author(s):  
Kai Zhang ◽  
Ranran Lu ◽  
Liming Zhang ◽  
Xiaoming Zhang ◽  
Jun Yao ◽  
...  

Geofluids ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-21 ◽  
Author(s):  
Sungil Kim ◽  
Baehyun Min ◽  
Kyungbook Lee ◽  
Hoonyoung Jeong

This study couples an iterative sparse coding in a transformed space with an ensemble smoother with multiple data assimilation (ES-MDA) for providing a set of geologically plausible models that preserve the non-Gaussian distribution of lithofacies in a channelized reservoir. Discrete cosine transform (DCT) of sand-shale facies is followed by the repetition of K-singular value decomposition (K-SVD) in order to construct sparse geologic dictionaries that archive geologic features of the channelized reservoir such as pattern and continuity. Integration of ES-MDA, DCT, and K-SVD is conducted in a complementary way as the initially static dictionaries are updated with dynamic data in each assimilation of ES-MDA. This update of dictionaries allows the coupled algorithm to yield an ensemble well conditioned to static and dynamic data at affordable computational costs. Applications of the proposed algorithm to history matching of two channelized gas reservoirs show that the hybridization of DCT and iterative K-SVD enhances the matching performance of gas rate, water rate, bottomhole pressure, and channel properties with geological plausibility.


2012 ◽  
Vol 518-523 ◽  
pp. 4376-4379
Author(s):  
Bao Yi Jiang ◽  
Zhi Ping Li

With the increase in computational capability, numerical reservoir simulation has become an essential tool for reservoir engineering. To minimize the objective function involved in the history matching procedure, we need to apply the optimization algorithms. This paper is based on the optimization algorithms used in automatic history matching.


2017 ◽  
Vol 139 (6) ◽  
Author(s):  
Hyungsik Jung ◽  
Honggeun Jo ◽  
Kyungbook Lee ◽  
Jonggeun Choe

Ensemble Kalman filter (EnKF) uses recursive updates for data assimilation and provides dependable uncertainty quantification. However, it requires high computing cost. On the contrary, ensemble smoother (ES) assimilates all available data simultaneously. It is simple and fast, but prone to showing two key limitations: overshooting and filter divergence. Since channel fields have non-Gaussian distributions, it is challenging to characterize them with conventional ensemble based history matching methods. In many cases, a large number of models should be employed to characterize channel fields, even if it is quite inefficient. This paper presents two novel schemes for characterizing various channel reservoirs. One is a new ensemble ranking method named initial ensemble selection scheme (IESS), which selects ensemble members based on relative errors of well oil production rates (WOPR). The other is covariance localization in ES, which uses drainage area as a localization function. The proposed method integrates these two schemes. IESS sorts initial models for ES and these selected are also utilized to calculate a localization function of ES for fast and reliable channel characterization. For comparison, four different channel fields are analyzed. A standard EnKF even using 400 models shows too large uncertainties and updated permeability fields lose channel continuity. However, the proposed method, ES with covariance localization assisted by IESS, characterizes channel fields reliably by utilizing good 50 models selected. It provides suitable uncertainty ranges with correct channel trends. In addition, the simulation time of the proposed method is only about 19% of the time required for the standard EnKF.


1972 ◽  
Vol 12 (06) ◽  
pp. 508-514 ◽  
Author(s):  
L. Kent Thomas ◽  
L.J. Hellums ◽  
G.M. Reheis

Abstract This paper presents a nonlinear optimization technique that automatically varies reservoir parameters to obtain a history match of held parameters to obtain a history match of held performance. The method is based on the classical performance. The method is based on the classical Gauss-Newton least-squares procedure. The range of each parameter is restricted by a box-type constraint and special provisions are included to handle highly nonlinear cases. Any combination of reservoir parameters may be used as the optimization variables and any set or sets of held data may be included in the match. Several history matches are presented, including examples from previous papers for comparison. In each of these examples, the technique presented here resulted in equivalent history matches in as few or fewer simulation runs. Introduction The history matching phase of reservoir simulations usually requires a trial-and-error procedure of adjusting various reservoir parameters procedure of adjusting various reservoir parameters and then calculating field performance. This procedure is continued until an acceptable match procedure is continued until an acceptable match between field and calculated performance has been obtained and can become quite tedious and time consuming, even with a small number of reservoir parameters, because of the interaction between the parameters, because of the interaction between the parameters and calculated performance. parameters and calculated performance. Recently various automatic or semiautomatic history-matching techniques have been introduced. Jacquard and Jain presented a technique based on a version of the method of steepest descent. They did not consider their method to be fully operational, however, due to the lack of experience with convergence. Jahns presented a method based on the Gauss-Newton equation with a stepwise solution for speeding convergence; but his procedure still required a large number of reservoir simulations to proceed to a solution. Coats et al. presented a proceed to a solution. Coats et al. presented a workable automatic history-matching procedure based on least-squares and linear programming. The method presented by Slater and Durrer is based on a gradient method and linear programming. In their paper they mention the difficulty of choosing a step paper they mention the difficulty of choosing a step size for their gradient method, especially for problems involving low values of porosity and problems involving low values of porosity and permeability. They also point out the need for a permeability. They also point out the need for a fairly small range on their reservoir description parameters for highly nonlinear problems. Thus, parameters for highly nonlinear problems. Thus, work in this area to date has resulted either in techniques based on a linear parameter-error dependence or in nonlinear techniques which require a considerable number of simulation runs. The method presented here is a nonlinear algorithm that will match both linear and nonlinear systems in a reasonable number of simulations. HISTORY MATCHING In a reservoir simulation, various performance data for the field, such as well pressures, gas-oil ratios, and water-oil ratios, are used as the basis for the match. During the matching of these performance data certain reservoir and fluid performance data certain reservoir and fluid parameters are assumed to be known while other parameters are assumed to be known while other less reliable data, forming the set (x1, x2...xn), are varied to achieve a match. The objective of the history-matching procedure presented in this paper is to minimize, in a presented in this paper is to minimize, in a least-squares sense, the error between the set of observed and calculated performance data, Fk(x1, x2... xn). SPEJ P. 508


2019 ◽  
Vol 141 (7) ◽  
Author(s):  
Sungil Kim ◽  
Hyungsik Jung ◽  
Jonggeun Choe

Reservoir characterization is a process to make dependable reservoir models using available reservoir information. There are promising ensemble-based methods such as ensemble Kalman filter (EnKF), ensemble smoother (ES), and ensemble smoother with multiple data assimilation (ES-MDA). ES-MDA is an iterative version of ES with inflated covariance matrix of measurement errors. It provides efficient and consistent global updates compared to EnKF and ES. Ensemble-based method might not work properly for channel reservoirs because its parameters are highly non-Gaussian. Thus, various parameterization methods are suggested in previous studies to handle nonlinear and non-Gaussian parameters. Discrete cosine transform (DCT) can figure out essential channel information, whereas level set method (LSM) has advantages on detailed channel border analysis in grid scale transforming parameters into Gaussianity. However, DCT and LSM have weaknesses when they are applied separately on channel reservoirs. Therefore, we propose a properly designed combination algorithm using DCT and LSM in ES-MDA. When DCT and LSM agree with each other on facies update results, a grid has relevant facies naturally. If not, facies is assigned depending on the average facies probability map from DCT and LSM. By doing so, they work in supplementary way preventing from wrong or biased decision on facies. Consequently, the proposed method presents not only stable channel properties such as connectivity and continuity but also similar pattern with the true. It also gives trustworthy future predictions of gas and water productions due to well-matched facies distribution according to the reference.


SPE Journal ◽  
2014 ◽  
Vol 19 (04) ◽  
pp. 648-661 ◽  
Author(s):  
Duc H. Le ◽  
Albert C. Reynolds

Summary Given a suite of potential surveillance operations, we define surveillance optimization as the problem of choosing the operation that gives the minimum expected value of P90 minus P10 (i.e., P90 – P10) of a specified reservoir variable J (e.g., cumulative oil production) that will be obtained by conditioning J to the observed data. Two questions can be posed: (1) Which surveillance operation is expected to provide the greatest uncertainty reduction in J? and (2) What is the expected value of the reduction in uncertainty that would be achieved if we were to undertake each surveillance operation to collect the associated data and then history match the data obtained? In this work, we extend and apply a conceptual idea that we recently proposed for surveillance optimization to 2D and 3D waterflooding problems. Our method is based on information theory in which the mutual information between J and the random observed data vector Dobs is estimated by use of an ensemble of prior reservoir models. This mutual information reflects the strength of the relationship between J and the potential observed data and provides a qualitative answer to Question 1. Question 2 is answered by calculating the conditional entropy of J to generate an approximation of the expected value of the reduction in (P90 – P10) of J. The reliability of our method depends on obtaining a good estimate of the mutual information. We consider several ways to estimate the mutual information and suggest how a good estimate can be chosen. We validate the results of our proposed method with an exhaustive history-matching procedure. The methodology provides an approximate way to decide the data that should be collected to maximize the uncertainty reduction in a specified reservoir variable and to estimate the reduction in uncertainty that could be obtained. We expect this paper will stimulate significant research on the application of information theory and lead to practical methods and workflows for surveillance optimization.


Sign in / Sign up

Export Citation Format

Share Document