Controller reduction with error performance: continuous- and discrete-time cases
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
This paper is concerned with the problem of controller reduction for linear systems. Both continuous- and discrete-time cases are considered, with necessary and sufficient conditions obtained for the existence of desired reduced order controllers. In solving this problem, two approaches are presented. The first approach is based on the projection lemma, where the admissible controllers can be parameterized after a set of conditions are satisfied; and the second one directly incorporates the controller matrices to be determined into a set of conditions by introducing new techniques, and thus no parameterization procedure is needed. These necessary and sufficient conditions are formulated in terms of linear matrix inequalities (LMIs) plus some equality constraints. Since these conditions are not convex, the cone complementarity linearization (CCL) idea is exploited to cast them into sequential minimization problems subject to LMI constraints, which can be readily solved by standard numerical software. A numerical example shows the effectiveness of the controller reduction methods.
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