A Tracing Algorithm for Flow Diagnostics on Fully Unstructured Grids With Multipoint Flux Approximation
Bibliographic record
Abstract
Summary Flow diagnostics is a common way to rank and cluster ensembles of reservoir models depending on their approximate dynamic behavior before beginning full-physics reservoir simulation. Traditionally, they have been performed on corner-point grids inherent to geocellular models. The rapid-reservoir-modeling (RRM) concept aims at fast and intuitive prototyping of geologically realistic reservoir models. In RRM, complex reservoir heterogeneities are modeled as discrete volumes bounded by surfaces that are sketched in real time. The resulting reservoir models are discretized by use of fully unstructured tetrahedral meshes where the grid conforms to the reservoir geometry, hence preserving the original geological structures that have been modeled. This paper presents a computationally efficient work flow for flow diagnostics on fully unstructured grids. The control-volume finite-element method (CVFEM) is used to solve the elliptic pressure equation. The flux field is a multipoint flux approximation (MPFA). A new tracing algorithm is developed on a reduced monotone acyclic graph for the hyperbolic transport equations of time of flight (TOF) and tracer distributions. An optimal reordering technique is used to deal with each control volume locally such that the hyperbolic equations can be computed in an efficient node-by-node manner. This reordering algorithm scales linearly with the number of unknowns. The results of these computations allow us to estimate swept-reservoir volumes, injector/producer pairs, well-allocation factors, flow capacity, storage capacity, and dynamic Lorenz coefficients, which all help approximate the dynamic reservoir behavior. The total central-processing-unit (CPU) time, including grid generation and flow diagnostics, is typically a few seconds for meshes with O (100,000) unknowns. Such fast calculations provide, for the first time, real-time feedback in the dynamic reservoir behavior while models are prototyped.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".