Towards a New Generation of Physics-Driven Solvers for Black-Oil and Compositional Flow Simulation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract In recent years, there has been a resurgence in developing new solver technologies for addressing highly complex and large-scale flow simulations on specialized parallel and multicore architectures in a very effective manner. Methods such as algebraic multigrid (AMG), Krylov recycling (e.g., deflation, Krylov-secant) and extensions to two-stage preconditioners (e.g., GPR) have been copping the scene in latest solver advances. Nevertheless, there is still a long way to transit to be able to reduce the gap between achieving maximum robustness and parallel efficiency of these solvers in a wide range of problems that the oil industry is currently pursuing on. A new generation of solvers seems to require capabilities to recapture part of the masked physics that is overlooked by strictly algebraic procedures in order to retrieve part of the loss efficiency and furthermore, to obtain insights that make them adaptable to different reservoir situations. In this work, we show that this physical information may be possible by aggregation of system coefficients via percolation. The process can be efficiently encapsulated into a two-stage preconditioner that relies on the solution of the identified highly connected blocks (i.e., aggregates) followed by a deflation preconditioner. The proposed approach is coined as two-stage percolation aggregation (2SPA) and emerges as a representative member of a new family of physics-driven solvers to exploit connectivity (and consequently, flow trends) on highly heterogeneous media. We compare the performance of 2SPA preconditioner against ILU and conclude that the method could be promising to tackle a wider range of reservoir scenarios.
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.
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 it