Simultaneous Estimation of Relative Permeability and Capillary Pressure for PUNQ-S3 Model With a Damped Iterative-Ensemble-Kalman-Filter Technique
Bibliographic record
Abstract
Summary A damped iterative-ensemble-Kalman-filter (IEnKF) algorithm has been proposed to estimate relative permeability and capillary pressure curves simultaneously for the PUNQ-S3 model, while its performance has been compared with that of the CMOST module, iterative-ensemble-smoother (IES) algorithm, and traditional ensemble-Kalman-filter (EnKF) technique. The power-law model is used to represent the relative permeability and capillary pressure curves, while three-phase relative permeability for oil phase is determined by use of the modified Stone II model. By assimilating the observed production data, the relative permeability and capillary pressure curves are inversely, automatically, and successively updated, achieving an excellent agreement with the reference cases. Not only are the associated uncertainties reduced significantly during the updating process, but also each of the updated reservoir models predicts the production profile that is in good agreement with the reference cases. Although the damped IEnKF technique shows the highest accuracy on estimation results, history-matching results, and prediction performance for the PUNQ-S3 model, its computational expense is still high compared with the other three techniques. In addition, the variations in the ensemble of the updated reservoir models and production profiles of the damped IEnKF provide a robust and consistent framework for uncertainty analysis.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".