MétaCan
Menu
Back to cohort
Record W2483669036 · doi:10.1109/acc.2016.7526481

Pattern preserving pole placement and stabilization for linear systems

2016· article· en· W2483669036 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicAdvanced Differential Equations and Dynamical Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsControllabilityDiagonalHomogeneous spaceBlock matrixBlock (permutation group theory)Matrix (chemical analysis)Diagonal matrixFull state feedbackSet (abstract data type)AutomorphismMathematicsLinear systemComputer scienceTopology (electrical circuits)Control theory (sociology)AlgorithmPure mathematicsApplied mathematicsCombinatoricsControl (management)Mathematical analysisArtificial intelligenceGeometry

Abstract

fetched live from OpenAlex

A method to characterize the symmetries inherent within physical systems via automorphism groups has already been established. In this paper, we define a specific block diagonal form to which a matrix can be decomposed if and only if it conforms with a given set of symmetries. We employ this decomposition and resulting block diagonal form to define controllability and stabilizability and give a pole placement algorithm when the feedback matrix is constrained by the inherent patterns of the system. Finally, an example is given which demonstrates our controllability notion and pole placement algorithm.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.927
Threshold uncertainty score0.162

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.058
GPT teacher head0.327
Teacher spread0.270 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it