MétaCan
Menu
Back to cohort

Alternate Minimizations for an Approximate Solution of General Systems of Linear Algebraic Equations

2021· article· en· W3194795622 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsMinificationLinear systemSimple (philosophy)Algebraic equationSystem of linear equationsComputationApplied mathematicsMathematicsAlgebraic numberPoint (geometry)Linear equationComputer scienceMathematical analysisMathematical optimizationAlgorithmNonlinear systemGeometry

Abstract

fetched live from OpenAlex

A special kind of a functional associated with a general linear system of equations, which allows not only to minimize the value of the functional but also the distance to the solution point, is used for an efficient computation of an approximate solution of the system. A formula is derived for the minimization of the distance to the solution point. The two types of minimization are applied alternately to approach the solution. This simple method gives satisfactory results even for poorly conditioned systems.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.962
Threshold uncertainty score0.228

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.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.036
GPT teacher head0.284
Teacher spread0.248 · 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

Quick stats

Citations2
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicMatrix Theory and AlgorithmsFrench-language works237,207