A Strategy for Multi-Point Shape Optimization of Turbine Stages in Three-Dimensional Flow
Bibliographic record
Abstract
This paper presents an effective and practical shape optimization strategy for turbine stages so as to minimize the adverse effects of three-dimensional flow features on the turbine performance. The optimization method combines a genetic algorithm (GA), with a Response Surface Approximation (RSA) of the Artificial Neural Network (ANN) type. During the optimization process, the individual objectives and constraints are approximated using ANN that is trained and tested using a few three-dimensional CFD flow simulations; the latter are obtained using the commercial package Fluent. The optimization objective is a weighted sum of individual objectives such as isentropic efficiency, streamwise vorticity and is penalized with a number of constraints. To minimize three-dimensional effects, the stator and rotor stacking curves are taken as the design variable. They are parametrically represented using a quadratic rational Bezier curve (QRBC) whose parameters are related to the blade lean, sweep and bow, which are used as the design variables. The described strategy was applied to single and multipoint optimization of the E/TU-3 turbine stage. This optimization strategy proved to be successful, flexible and practical, and resulted in an improvement of around 1% in stage efficiency over the turbine operating range with as low as 5 design variables. This improvement is attributed to the reduction in secondary flows, in stator hub choking, and in the transonic region and the associated flow separation.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".