Shift-Independent Model Reduction of Large-Scale Second-Order Mechanical Structures
Bibliographic record
Abstract
Nonmodal model order reduction (MOR) techniques present accurate and efficient ways to approximate input–output behavior of large-scale mechanical structures. In this regard, Krylov-based model reduction techniques for second-order mechanical structures are typically known to require a priori knowledge of the original system parameters, such as expansion points (or eigenfrequencies). The calculation of the eigenfrequencies of the original finite-element (FE) model can be significantly time-consuming for large-scale structures. Existing iterative rational Krylov algorithm (IRKA) addresses this issue by iteratively updating the expansion points for first-order formulations until convergence criteria are achieved. Motivated by preserving the model properties of second-order systems, this paper extends the IRKA method to second-order formulations, typically encountered in mechanical structures. The proposed second-order IRKA method is implemented on a large-scale system as an example and compared with the standard Krylov and Craig-Bampton reduction techniques. The results show that the second-order IRKA method provides tangibly reduced error for a multi-input-multi-output (MIMO) mechanical structure compared to the Craig-Bampton. In addition, unlike the standard Krylov methods, the second-order IRKA does not require the information on expansion points, which eliminates the need to perform a modal analysis on the original structure. This can be especially advantageous for large-scale systems where calculations of the eigenfrequencies of the original structure can be computationally expensive. For such large-scale systems, the proposed MOR technique can lead to significant reductions of the computational time.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| 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.002 | 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".