Improved Dynamic Geometry Control Algorithms for Efficient Aerodynamic Shape Optimization
Bibliographic record
Abstract
In aerodynamic shape optimization, traditional static geometry control methods can produce suboptimal performance by introducing performance tradeoffs at various stages of optimization, enforcing arbitrary constraints on open-ended optimization, and necessitating foreknowledge of problem behavior to design an effective control scheme. These shortcomings can be mitigated through dynamic geometry control, which partly automates the geometry control design process by refining the geometry control topology throughout optimization. Such refinement can occur in a predetermined fashion (as in progressive control) or more automatically using sensitivity information to guide refinement (as in adaptive control). Both progressive control and adaptive control are implemented in the context of axial and free-form deformation geometry control, and novel contributions are made to the adaptive algorithm, including the treatment of active constraints and several novel “potential indicators” to rank candidate refinements. Application to a wide suite of aerodynamic shape optimization problems demonstrates that dynamic geometry control is effective, producing lower final drag than well-designed static schemes while reducing required iterations to convergence by 50% or more, and simultaneously reducing labor requirements on the user. These benefits are demonstrated across a wide variety of problems, representative of detailed and exploratory problems often encountered in both academia and industry.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".