A Systematic Online Update Method for Reduced-Order-Model-Based Digital Twin
Bibliographic record
Abstract
Abstract A digital twin (DT) is a model that mirrors a physical system and is continuously updated with real-time data from the physical system. Recent implementations of reduced-order-model-based DT (DT-ROM) have been applied in aerodynamics and structural health monitoring, where partial differential equations (PDEs) are utilized to update reduced bases and coefficients. However, these methods are not directly applicable when the PDEs of the system are unknown. This paper addresses the online update challenge for DT-ROM in scenarios lacking known PDEs of the system. To tackle the challenge, a systematic online update and application method is proposed. During the online update, the projection residual of online data on the reduced bases determines the necessity of updating reduced bases, while the prediction residual of online data obtained by the current DT-ROM is used to decide whether to update the coefficient model. By sequentially evaluating both criteria, the method selectively incorporates essential online data for the online DT model update. During the online application, a criterion defined based on online data is adopted to determine whether the offline DT-ROM or the online one is applied to output final predictions. The capability of the proposed method is tested through three numerical and three engineering problems. Results indicate that the proposed online update method consistently reduces both projection and prediction residuals, thereby progressively enhancing the performance of the online DT-ROM on test data. Meanwhile, the online application method provides a prediction performance better than using offline DT-ROM only. Both demonstrate that the proposed work could be applied to online DT update where the PDEs of the system are unknown.
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.002 |
| 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.004 | 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".