Two-level dynamic load-balanced p-adaptive discontinuous Galerkin methods for compressible CFD simulations
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
We present a novel approach utilizing two-level dynamic load balancing for p -adaptive discontinuous Galerkin (DG) methods in compressible Computational Fluid Dynamics (CFD) simulations. The high-order explicit first stage, specifically the singly diagonal implicit Runge–Kutta (ESDIRK) method, is employed for time integration, where the pseudo-transient continuation is integrated with the restarted generalized minimal residual (GMRES) method to handle the solution of nonlinear equations at each stage of ESDIRK, excluding the initial stage. Relying on smoothness indicators, we carry out the refinement/coarsening process for p -adaptation with dynamic load balancing. This approach involves a coarse level (distributed memory) decomposition based on MPI paradigm and a fine level (shared memory) decomposition based on OpenMP paradigm, enhancing parallel efficiency. Dynamic load balancing is achieved by computing weights based on degrees of freedom, ensuring balanced computational loads across processors. The parallel computing framework adopts either a graph-based type (ParMETIS and Zoltan) or space-filling curves type (GeMPa) for coarse level partitioning, and a graph-based type (METIS and Zoltan) for fine level partitioning. The effectiveness of the method is demonstrated through numerical examples, highlighting its potential to significantly improve the scalability and efficiency of compressible flow simulations. The numerical simulations were conducted using the CODA flow solver , a state-of-the-art tool developed collaboratively by the French National Aerospace Center (ONERA), the German Aerospace Center (DLR), and Airbus.
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