On stability and the Lyapunov equation for n-dimensional digital systems
Bibliographic record
Abstract
The discrete-time bounded-real lemma is further developed for nonminimal digital systems. Based on this lemma, rigorous necessary and sufficient conditions for the existence of positive definite solutions to the Lyapunov equation for n-dimensional (n-D) digital systems are proposed. These new conditions are improvements and extensions of earlier conditions and can be applied to n-D digital systems with characteristic polynomials involving 1-D factor polynomials. Further, the results in this paper show that the positive definite solutions to the n-D Lyapunov equation of a n-D system with characteristic polynomial involving 1-D factors can be obtained from the solutions of a k-D (0/spl les/k/spl les/n) subsystem and m(1/spl les/m/spl les/n) 1-D subsystems. This could significantly simplify the complexity of solving the n-D Lyapunov equation for such cases.
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.001 | 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 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".