An Eulerian moving front algorithm with weak‐form tip asymptotics for modeling hydraulically driven fractures
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 The coupled equations for a propagating hydraulic fracture (HF) exhibit a multi‐scale structure for which resolution on all length scales becomes computationally prohibitive. Asymptotic analysis is able to identify the dominant physical process active at the computational length scale. This paper describes a novel algorithm that uses weak‐form tip asymptotics on a rectangular Eulerian mesh to solve the problem of a propagating HF. The location of the fracture front is determined within each tip element by matching the volume associated with the known asymptotic solution to the flux of fluid into the given element. Even if the fracture front is curved, the algorithm is able to capture the solution on a relatively coarse rectangular mesh by implementing a weak form of the tip asymptotic solution, based on averaging the volume over a tip element to determine the fracture widths at tip element centers. The fracture is divided into a ‘channel’ region made up of elements that are filled with fluid and a ‘tip’ region comprising partially filled elements. An iterative procedure is used to determine the fracture widths and fluid pressures in the channel region and the fracture font locations in the tip regions. The algorithm is tested by analyzing an HF propagating in a viscosity‐dominated regime within an impermeable homogeneous elastic material for which a similarity solution is available. The numerical results show close agreement with the exact solution even though a relatively coarse mesh is used. Copyright © 2008 John Wiley & Sons, Ltd.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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