Reduced Order Modeling of Bladed Disks with Geometric and Contact Nonlinearities
Bibliographic record
Abstract
Because of the new environmental regulations in aeronautics, engine manufacturers have to drastically reduce their environmental footprint. To achieve this, new engine architectures are being considered to improve the performance of turbojet engines and reduce their fuel consumption. First, aerodynamic losses are decreased by reducing the clearance between the blades and the surrounding casing. This can lead to contact events between the blades and the casing even in nominal operating conditions. Moreover, the engine weight can be reduced by designing lighter and slender blades. As a consequence, the blades can undergo large displacements and deformations. Because of the high costs associated to full-scale experimental setups, it is particularly important for manufacturers to have at their disposal accurate predictive numerical strategies allowing to account for these nonlinear structural considerations from the beginning of the design process. As the direct use of industrial 3D finite element models in dynamic analyses requires high computational capabilities, many recent works are devoted to the construction of nonlinear reduced order models. A methodology based on reduced order modeling techniques has been recently derived to study the contact interactions of single blades undergoing large displacements. The methodology is here extended to full bladed disks with cyclic symmetry. Each sector of the high fidelity model is projected onto a basis composed of Craig-Bampton modes and a selection of their modal derivatives. A second reduction allows to reduce the cyclic boundary degrees-of-freedom. The internal nonlinear forces due to large displacements are evaluated in the reduced basis with the stiffness evaluation procedure. Contact is numerically handled with Lagrange multipliers. The numerical strategy is here applied on an open industrial compressor model, the NASA rotor 37, in order to promote reproducibility of results. This work demonstrates that reduced order models provide a computationally efficient alternative to full order finite element models for the accurate prediction of the time response of structures with both distributed and localized nonlinearities.
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 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.006 | 0.005 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".