Nonlinear Unsteady Vortex-Lattice Vortex-Particle Method with Adaptive Wake Conversion for Rotorcraft Aerodynamics
Bibliographic record
Abstract
Nonlinear unsteady vortex lattice-vortex particle methods (NL-UVLM-VPM) provide medium-fidelity predictions of rotorcraft aerodynamics with explicit three-dimensional wake representations at a moderate computational cost. This study presents an NL-UVLM-VPM approach with a scale-consistent adaptive wake panel-particle conversion strategy that mitigates the inherent temporal-spatial resolution coupling of conventional wake treatments in rotorcraft aerodynamic simulations. Numerical assessment shows that this strategy preserves the near third-order temporal convergence of the underlying time-integration scheme while improving robustness under coarsened temporal resolution. For a representative hover case, computational time is reduced by 29% relative to the conventional conversion strategy at identical temporal resolution and by nearly 70% compared with a fine-resolution reference simulation over 20 rotor revolutions, while maintaining thrust and torque predictions within 1% of the reference solution. Based on these analyzes, practical recommendations for particle conversion parameters and wake resolution are provided. The methodology is further validated for increasingly complex scenarios, including hover, forward flight with blade-vortex interaction, and multirotor interaction. Predictions show good agreement with experimental data and dedicated unsteady Reynolds-averaged Navier-Stokes simulations (URANS), while computational speedups exceeding two orders of magnitude relative to URANS are achieved.
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.000 | 0.001 |
| 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.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".