MétaCan
Menu
Back to cohort
Record W4388288343 · doi:10.5206/mt.v3i3.17002

Solving multivariate polynomial systems using eigenvalues in Maple

2023· article· en· W4388288343 on OpenAlex
Robert M. Corless

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.

fundA Canadian funder is recorded on the work.
venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueMaple Transactions · 2023
Typearticle
Languageen
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaMinisterio de Ciencia e Innovación
KeywordsUnivariateMaplePolynomial matrixEigenvalues and eigenvectorsPolynomialMultivariate statisticsMathematicsMatrix polynomialCompanion matrixAlgebra over a fieldMatrix (chemical analysis)Applied mathematicsPure mathematicsMathematical analysisStatistics

Abstract

fetched live from OpenAlex

Some time in the early 2000's, I extended the routine CompanionMatrix in the LinearAlgebra package to compute what are called linearizations of what are called matrix polynomials. These are just univariate polynomials with matrix coefficients; isomorphically, these are matrices with univariate polynomial entries. Linearizations can be used to solve multivariate systems of equations by a number of techniques, which are `"well-known" in the sense that they are in books and papers. However well-known they are, they deserve to be better-known, and this expository paper gives some examples of some of the methods that can be used. Think of this as an extended help page for the code (which, if I am honest, is long overdue for an upgrade).

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.808
Threshold uncertainty score0.584

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.001
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.039
GPT teacher head0.274
Teacher spread0.235 · 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