An immersed boundary method for solving compressible flow with arbitrarily irregular and moving geometry
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
Summary In this paper, a novel immersed boundary method is developed, validated, and applied. Through devising a second‐order three‐step flow reconstruction scheme, the proposed method is able to enforce the Dirichlet, Neumann, Robin, and Cauchy boundary conditions in a straightforward and consistent manner. Equipped with a fluid‐solid coupling framework that integrates high‐order temporal and spatial discretization schemes, numerical experiments concerning flow involving stationary and moving objects, convex and concave geometries, no‐slip and slip wall boundary conditions, as well as subsonic and supersonic motions are conducted to validate the method. Using analytical solutions, experimental observations, published numerical results, and Galilean transformations, it is demonstrated that the proposed method can provide efficient, accurate, and robust boundary treatment for solving flow with arbitrarily irregular and moving geometries on Cartesian grids. On the basis of the proposed method, the development of a solver that unifies one‐, two‐, and three‐dimensional computations and the generation of complex geometric objects via simply positioning components are described. In addition, a surface‐normalized absolute flux is proposed for interface sharpness measurement, and an analytically solvable modified vortex preservation problem is developed for a convergence study concerning smooth flow with irregular geometries.
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.001 |
| 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