MétaCan
Menu
Back to cohort
Record W2105283503 · doi:10.1287/ijoc.1050.0150

A Projection-Based Reduction Approach to Computing Sensitivity of Steady-State Response of Nonlinear Circuits

2006· article· en· W2105283503 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

VenueINFORMS journal on computing · 2006
Typearticle
Languageen
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsMcGill UniversityCarleton UniversityUniversity of Ottawa
Fundersnot available
KeywordsSensitivity (control systems)Reduction (mathematics)Nonlinear systemProjection (relational algebra)Subspace topologyComputationMathematicsAlgorithmDimension (graph theory)Steady state (chemistry)TRACE (psycholinguistics)Electronic circuitState spaceMathematical optimizationControl theory (sociology)Computer scienceMathematical analysis

Abstract

fetched live from OpenAlex

This paper presents a new algorithm for computing the sensitivity of steady-state responses of nonlinear circuits with respect to an arbitrary network parameter. The proposed algorithm is based on circuit-reduction techniques obtained through nonlinear-projection approaches. The main idea in the proposed sensitivity-computation algorithm is based on projecting the adjoint system of equations onto a subspace of smaller dimension. Continuation methods are then applied on the reduced system to trace the solution trajectory of the adjoint system in the reduced space. We show that once the steady-state solution has been obtained using nonlinear order reduction, the computational cost required to compute sensitivity is only a limited number of forward/backward substitutions. Numerical examples are presented to demonstrate the accuracy and efficiency of the proposed 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.001
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.275
Threshold uncertainty score0.565

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.020
GPT teacher head0.262
Teacher spread0.242 · 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