MétaCan
Menu
Back to cohort
Record W3097910092 · doi:10.5539/jmr.v12n6p50

An Improved Secant Algorithm of Variable Order to Solve Nonlinear Equations Based on the Disassociation of Numerical Approximations and Iterative Progression

2020· article· en· W3097910092 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 · 2020
Typearticle
Languageen
FieldMathematics
TopicIterative Methods for Nonlinear Equations
Canadian institutionsnot available
FundersCHIST-ERAAgencia Estatal de InvestigaciónEuropean Regional Development FundMinisterio de Ciencia e Innovación
KeywordsMathematicsSecant methodDiscretizationConvergence (economics)Nonlinear systemLocal convergenceNewton's methodIterative methodInfinitesimalVariable (mathematics)Applied mathematicsNumerical analysisRate of convergenceAlgorithmMathematical analysisComputer science

Abstract

fetched live from OpenAlex

We propose an iterative method to evaluate the roots of nonlinear equations. This Secant-based technique approximates the derivatives of the function numerically through a constant discretization step h disassociated from the iterative progression. The algorithm is developed, implemented, and tested. Its order of convergence is found to be h-dependent. The results obtained corroborate the theoretical deductions and evidence its excellent behavior. For infinitesimal h-values, the algorithm accelerates the convergence of the Secant method to order 2 (the one of the Newton-Raphson method) with no need for analytic expression of derivatives (the advantage of the Secant 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.006
metaresearch head score (Gemma)0.020
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
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.933
Threshold uncertainty score0.988

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0060.020
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.0000.000
Research integrity0.0000.001
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.199
GPT teacher head0.481
Teacher spread0.283 · 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