MétaCan
Menu
Back to cohort
Record W2765671816 · doi:10.1137/140986566

On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations

2017· article· en· W2765671816 on OpenAlexaff
Stanley C. Eisenstat, Serge Gratton, David Titley-Péloquin

Bibliographic record

VenueSIAM Journal on Matrix Analysis and Applications · 2017
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsMcGill University
FundersFondation Sciences et Technologies pour l’Aéronautique et l’Espace
KeywordsMathematicsUpper and lower boundsOrder (exchange)Applied mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

We derive an upper bound on the symmetric componentwise relative backward error for symmetric linear systems of equations. Since the bound can be computed efficiently and, except for some artificial examples, seems to be of the same order of magnitude as the true symmetric componentwise backward error, we believe that it is suitable for practical use. Our results also provide new insight into the relationship between the symmetric and unsymmetric backward errors.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.035
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.035
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0010.005
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0080.003

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.035
GPT teacher head0.321
Teacher spread0.287 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations3
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueSIAM Journal on Matrix Analysis and ApplicationsSame topicMatrix Theory and AlgorithmsFrench-language works237,207