MétaCan
Menu
Back to cohort

Approximate Solution of Large Linear Algebraic Systems Using Differential Equations

2021· article· en· W3195932601 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
FieldMathematics
TopicNumerical methods for differential equations
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsComputationAlgebraic equationDifferential algebraic equationSystem of linear equationsDifferential equationLinear systemApplied mathematicsResidualAlgebraic numberMathematicsComputer scienceInterval (graph theory)Process (computing)Mathematical analysisAlgorithmOrdinary differential equationNonlinear systemPhysics

Abstract

fetched live from OpenAlex

Vector differential equations are constructed and then integrated numerically over an interval extended from a convenient starting value of the unknown to a value which gives the solution of the system of equations. The solution procedure allows to easily control and monitor the magnitude of the residual vector of the algebraic system at each step of the integration process. The method is flexible, permitting various intervening parameters to be changed wherever necessary in order to increase its efficiency. A smaller amount of computation is needed to obtain an approximate solution of very large linear systems as compared to existing methods. An electrostatic field model is suggested which could be useful for investigating techniques to further improve the efficiency of the proposed method.

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

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.0010.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.137
GPT teacher head0.394
Teacher spread0.257 · 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