Efficient Stability and Robustness Analysis of Uncertain Nonlinear Systems using a New Response-based Method
Bibliographic record
Abstract
A stable dynamic system implies safety, reliability, and satisfactory performance. However, the determination of stability is very difficult when the system is nonlinear and when the ever present uncertainties in the components must be considered. Herein a response-based approach that uses both system and time information obtained through singular value decomposition is presented to determine the stability space of nonlinear, uncertain dynamic systems: any approximating linearization of the nonlinearities has been obviated. The approach extends previous work for linear systems that invoked only the variability of the left singular vectors to predict stability. In the new approach, the variability of the right singular vectors is augmented to that of the left singular vectors and it is shown that a simulation time span, as short as two or three periods, is sufficient to predict stability over the entire life-time dynamics rendering the method very efficient. The stability space is a subset of the design space and its robustness is proportional to the tolerances assigned to the random design variables. Errors due to sampling size, time increments, and number of singular vectors used are controllable. The method can be implemented with readily available software. A study of a practical engineering system with different tolerances and different time spans shows the efficacy of the proposed approach.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| 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".