MétaCan
Menu
Back to cohort
Record W2962778453 · doi:10.3934/dcds.2015.35.4765

Rigorous numerics for nonlinear operators with tridiagonal dominant linear parts

2016· article· en· W2962778453 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
TopicNumerical Methods and Algorithms
Canadian institutionsUniversité Laval
FundersAgence Nationale de la Recherche
KeywordsTridiagonal matrixOperator (biology)MathematicsNonlinear systemLinear operatorsDiagonalComputationInverseApplied mathematicsLinear mapContraction (grammar)Pure mathematicsMathematical analysisAlgebra over a fieldPhysicsAlgorithmEigenvalues and eigenvectorsQuantum mechanicsGeometry

Abstract

fetched live from OpenAlex

We present a method designed for computing solutions of infinite dimensional nonlinear operators f(x) = 0 with a tridiagonal dominant linear part. We recast the operator equation into an equivalent Newton-like equation x = T(x) = x - Af(x), where A is an approximate inverse of the derivative Df(¯x) at an approximate solution ¯x. We present rigorous computer-assisted calculations showing that T is a contraction near ¯x, thus yielding the existence of a solution. Since Df(¯x) does not have an asymptotically diagonal dominant structure, the computation of A is not straightforward. This paper provides ideas for computing A, and proposes a new rigorous method for proving existence of solutions of nonlinear operators with tridiagonal dominant linear part.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.969
Threshold uncertainty score0.322

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

Citations7
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicNumerical Methods and AlgorithmsFrench-language works237,207