MétaCan
Menu
Back to cohort
Record W2076398485 · doi:10.1145/1394042.1394103

Efficient order basis computation (abstract only)

2008· article· en· W2076398485 on OpenAlexaff
Wei Zhou

Bibliographic record

VenueACM communications in computer algebra · 2008
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsBasis (linear algebra)ComputationMathematicsPolynomial basisMatrix (chemical analysis)Reduction (mathematics)Order (exchange)Interpolation (computer graphics)Basis functionComputer scienceApplied mathematicsAlgorithmMathematical analysisGeometryArtificial intelligence

Abstract

fetched live from OpenAlex

Order basis (also known as 3/4-basis, minimal approximant basis), originally developed by Beckermann and Labahn in 1994 for rational approximation and interpolation problems, has recently been applied to many other important problems in polynomial matrix computation. These include column reduction, matrix inverse, determinant, and null space basis computation. Storjohann, in 2006, provided an efficient way to compute a part of order basis that is within a given degree bound. We extend Storjohann's result by providing a way to compute a complete order basis with a similar computational cos.

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.

How this classification was reachedexpand

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.874
Threshold uncertainty score0.985

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0050.003
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.038
GPT teacher head0.294
Teacher spread0.256 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueACM communications in computer algebraSame topicMatrix Theory and AlgorithmsFrench-language works237,207