MétaCan
Menu
Back to cohort
Record W2094006358 · doi:10.1142/s0218202501000738

ASYMPTOTIC FORMULAS FOR DISCRETE EIGENVALUE PROBLEMS IN LIOUVILLE NORMAL FORM

2001· article· en· W2094006358 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.

fundA Canadian funder is recorded on the work.
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

VenueMathematical Models and Methods in Applied Sciences · 2001
Typearticle
Languageen
FieldMathematics
TopicSpectral Theory in Mathematical Physics
Canadian institutionsnot available
FundersMcMaster University
KeywordsMathematicsEigenvalues and eigenvectorsSturm–Liouville theoryEigenfunctionMathematical analysisBoundary value problemDirichlet boundary conditionDirichlet eigenvalueBoundary (topology)ComputationApplied mathematicsDirichlet's principle

Abstract

fetched live from OpenAlex

In the analysis of both continuous and discrete eigenvalue problems, asymptotic formulas play a central and crucial role. For example, they have been fundamental in the derivation of results about the inversion of the free oscillation problem of the Earth and related inverse eigenvalue problems, the computation of uniformly valid eigenvalues approximations, the proof of results about the behavior of the eigenvalues of Sturm–Liouville problems with discontinuous coefficients, and the construction of a counterexample to the Backus–Gilbert conjecture. Useful formulas are available for continuous eigenvalue problems with general boundary conditions as well as for discrete eigenvalue problems with Dirichlet boundary condition. The purpose of this paper is the construction of asymptotic formulas for discrete eigenvalue problems with general boundary conditions. The motivation is the computation of uniformly valid eigenvalue approximations. It is now widely accepted that the algebraic correction procedure, first proposed by Paine et al., 13 is one of the simplest methods for computing uniformly valid approximations to a sequence of eigenvalues of a continuous eigenvalue problem in Liouville normal form. 8 This relates to the fact that, for Liouville normal forms with Dirichlet boundary conditions, it is not too difficult to prove that such procedures yield, under quite weak regularity conditions, uniformly valid O(h 2 ) approximations. For Liouville normal forms with general boundary conditions, the corresponding error analysis is technically more challenging. Now it is necessary to have, for such Liouville normal forms, higher order accurate asymptotic formulas for the eigenvalues and eigenfunctions of their continuous and discrete counterparts. Assuming that such asymptotic formulas are available, it has been shown 1 how uniformly valid O(h 2 ) results could be established for the application of the algebraic correction procedure to Liouville normal forms with general boundary conditions. Algorithmically, this methodology represents an efficient procedure for determining uniformly valid approximations to sequences of eigenvalues, even though it is more complex than for Liouville normal forms with Dirichlet boundary conditions. As well as giving a brief review of the subject for general (Robin) boundary conditions, this paper sketches proofs for the asymptotic formulas, for Robin boundary conditions, which are required in order to construct the mentioned O(h 2 ) results.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.323
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0060.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
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.132
GPT teacher head0.430
Teacher spread0.298 · 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