MétaCan
Menu
Back to cohort
Record W2046238971 · doi:10.1142/s0218127408021439

CONTINUATION OF CONNECTING ORBITS IN 3D-ODEs (I): POINT-TO-CYCLE CONNECTIONS

2008· article· en· W2046238971 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

VenueInternational Journal of Bifurcation and Chaos · 2008
Typearticle
Languageen
FieldMathematics
TopicAdvanced Differential Equations and Dynamical Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsOdeEigenfunctionMathematicsProjection (relational algebra)Monodromy matrixBoundary value problemMathematical analysisMonodromyOrdinary differential equationComputationContinuationApplied mathematicsComputer scienceEigenvalues and eigenvectorsDifferential equationPure mathematicsAlgorithm

Abstract

fetched live from OpenAlex

We propose new methods for the numerical continuation of point-to-cycle connecting orbits in three-dimensional autonomous ODE's using projection boundary conditions. In our approach, the projection boundary conditions near the cycle are formulated using an eigenfunction of the associated adjoint variational equation, avoiding costly and numerically unstable computations of the monodromy matrix. The equations for the eigenfunction are included in the defining boundary-value problem, allowing a straightforward implementation in AUTO, in which only the standard features of the software are employed. Homotopy methods to find connecting orbits are discussed in general and illustrated with several examples, including the Lorenz equations. Complete AUTO demos, which can be easily adapted to any autonomous three-dimensional ODE system, are freely available.

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.001
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.167
Threshold uncertainty score0.273

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
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.037
GPT teacher head0.331
Teacher spread0.295 · 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