On Further Development of an Unstructured Space-Marching Technique
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
Space marching methods are widely used to calculate steady supersonic internal and external flows in view of their superior efficiency as compared to time marching approaches. A very general space-marching procedure was proposed by Nakahashi and Saitoh in 1996. The method can be used with any explicit time-marching procedure, allows for embedded subsonic regions, and is well-suited for unstructured grids, enabling a maximum of geometric flexibility. The flow field is only updated in the so-called active domain. Once the residual has fallen below a preset tolerance, the active domain is shifted. The present work is aimed at further refining of the Nakahashi and Saitoh’s method. This is achieved via the following new approaches: (a) A non-reflecting boundary condition is implemented at the exit of the active domain, thus eliminating non-physical reflections propagating upstream; (b) A general, user-independent procedure for partitioning of the computational domain into a set of active domains is proposed. These allow to minimize the size of the active domain and the residual monitor region, thus contributing to the method’s efficiency; (c) Local grid adaptation is performed in the course of space marching. These ideas are verified and tuned, at first, on two simple test problems (supersonic flows over compression and expansion corners). Finally, the results of the application of the improved method to supersonic flows in air-breathing engine inlets and ram accelerators are presented.
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