MétaCan
Menu
Back to cohort
Record W3118236707 · doi:10.5539/jmr.v13n1p1

A Feasible Approach to Determine the Optimal Relaxation Parameters in Each Iteration for the SOR Method

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

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

VenueJournal of Mathematics Research · 2021
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsRelaxation (psychology)Iterative methodMathematical optimizationInterval (graph theory)Applied mathematicsFunction (biology)Matrix (chemical analysis)Projection (relational algebra)Value (mathematics)AlgorithmCombinatoricsStatistics

Abstract

fetched live from OpenAlex

The paper presents a dynamic and feasible approach to the successive over-relaxation (SOR) method for solving large scale linear system through iteration. Based on the maximal orthogonal projection technique, the optimal relaxation parameter is obtained by minimizing a derived merit function in terms of right-hand side vector, the coefficient matrix and the previous step values of unknown variables. At each iterative step, we can quickly determine the optimal relaxation value in a preferred interval. When the theoretical optimal value is hard to be achieved, the new method provides an alternative choice of the relaxation parameter at each iteration. Numerical examples confirm that the dynamic optimal successive over-relaxation (DOSOR) method outperforms the classical SOR 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.013
metaresearch head score (Gemma)0.002
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: Methods
Teacher disagreement score0.832
Threshold uncertainty score0.456

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0130.002
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.0010.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.180
GPT teacher head0.420
Teacher spread0.240 · 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