Iterative Updating of Reservoir Models Constrained to Dynamic Data
Notice bibliographique
Résumé
Abstract Geostatistical algorithms are being widely used to integrate different data such as seismic amplitude, well logs and core measurements into reservoir models. However, approaches to integrate dynamic/production data efficiently into these models are largely lacking. Production data differs from other types of static data (such as porosity, permeability, amplitude, etc.) primarily because they are non-linearly related to the connectivity characteristics of the reservoir. In this paper, we develop a gradual deformation methodology to integrate two-phase production data in order to give rise to a suite of reservoir models that are conditioned to static data, as well as dynamic data. We utilize the Sequential Indicator Simulation algorithm within a non-stationary Markov Chain to iteratively update the realizations till a history match is obtained. The methodology is tested on a synthetic 2D and 3D reservoir. Introduction Reservoir flow simulation is used to forecast oil and gas production profiles corresponding to different development scenarios. The reservoir models on which the flow simulations are performed are themselves uncertain due to the sparse information that is available to construct them. There is minimum uncertainty at the well locations and maximum uncertainty at locations away from the well. Hence, the production profile for a particular development scheme cannot be predicted exactly. Geostatistical simulation algorithms such as Sequential Gaussian Simulation (SGS) and Sequential Indicator Simuation (SIS) are being widely used nowadays to develop multiple equip-probable reservoir models. Each of these models is conditioned to the available static data, such as seismic, well logs, cores, etc., and the set of reservoir models quantify the uncertainty stemming from the lack of complete information about the reservoir. Historic production data contains valuable information pertaining to the connectivity characteristics of the reservoir. However, constraining reservoir models to measurements of pressure, oil, gas and water rates at different times is considerably more complicated due to the non-linearity between the dynamic response outputs and the model parameters. The procedure to adjust a reservoir model such that the production history is reflected correctly is known as history matching. It is a very time consuming process and may require several months of work by the reservoir engineer. In order to alleviate this problem, various attempts have been made to automate the process of history matching. History matching is an ill-posed problem and the parameter set that result in minimizing the deviation from data is non-unique. Mathematically, the history-matching problem can be posed in an optimization context, i.e., the minimization of a complex least squares objective function in a parameter space populated by multiple local minima. Two broad approaches for solving the problem are:Trial and error methods: Trial and error methods run repeated flow simulations on multiple reservoir models and retain only those models that reflect the historic production characteristics within some acceptable tolerances. Trial and error methods are computationally inefficient.Gradient-based methods: Gradient-based methods(1,2) capitalize on the nature of the physical relationship between the observed flow response and the model parameters in order to expedite convergence of the optimization process.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,004 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,001 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».