MétaCan
Menu
Back to cohort
Record W4285208720 · doi:10.23952/jnva.6.2022.3.03

Local convergence of the Newton’s method in two step nilpotent Lie groups

2022· article· en· W4285208720 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 Nonlinear and Variational Analysis · 2022
Typearticle
Languageen
FieldMathematics
TopicIterative Methods for Nonlinear Equations
Canadian institutionsnot available
Fundersnot available
KeywordsNilpotentConvergence (economics)Lie groupMathematicsNilpotent groupPure mathematicsSimple Lie groupLocal convergenceMathematical optimizationEconomicsIterative methodEconomic growth

Abstract

fetched live from OpenAlex

In this paper, we consider N, a simply connected two-step nilpotent Lie group with N , its corresponding (two-step nilpotent) Lie algebra, and we study Newton's method for solving the equation f (x) = 0, where f : N N is a mapping. Under certain generalized Lipschitz condition, we obtain the convergence radius of Newton's method and the estimation of the uniqueness ball of the zero point of f . Some applications to special cases including Kantorovich's condition and -condition are provided. The determination of an approximate zero point of an analytic mapping is also presented.

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.003
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.488
Threshold uncertainty score0.470

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
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.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.047
GPT teacher head0.382
Teacher spread0.335 · 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