Advanced Model-Order Reduction Techniques for Large Scale Dynamical Systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Model Order Reduction (MOR) has proven to be a powerful and necessary tool for various applications such as circuit simulation. In the context of MOR, there are some unaddressed issues that prevent its efficient application, such as "reduction of multiport networks" and "optimal order estimation" for both linear and nonlinear circuits. This thesis presents the solutions for these obstacles to ensure successful model reduction of large-scale linear and nonlinear systems. This thesis proposes a novel algorithm for creating efficient reduced-order macromodels from multiport linear systems (e.g. massively coupled interconnect structures). The new algorithm addresses the difficulties associated with the reduction of networks with large numbers of input/output terminals, that often result in large and dense reduced-order models. The application of the proposed reduction algorithm leads to reduced-order models that are sparse and block-diagonal in nature. It does not assume any correlation between the responses at ports; and thereby overcomes the accuracy degradation that is normally associated with the existing (Singular Value Decomposition based) terminal reduction techniques.
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.
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.000 | 0.000 |
| 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 it