An Adaptive Time Filter Algorithm for the 2D/3D Unsteady Triple‐Porosity Stokes Model Arising in Super‐Hydrophobic Proppant Modification in Hydraulic Fracturing Systems
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 this paper, we propose an adaptive time filter algorithm for the 2D/3D unsteady triple‐porosity Stokes model arising in super‐hydrophobic proppant modification in hydraulic fracturing systems. The time filter algorithm with variable time steps is given, which can improve the time accuracy from the first order to the second order without increasing any computational complexity. Moreover, this adaptive decoupled algorithm can reduce calculational costs and provide effective error control for its solution, compared to traditional numerical algorithms. Especially, the stability and second‐order convergence of the time filter algorithm with variable time steps are proven under a relaxed time step restriction of the form . Numerical results confirm the results of our theoretical analysis and the complex flow characteristics of the model through 2D/3D numerical examples.
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.001 | 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