ASYMPTOTIC FORMULAS FOR DISCRETE EIGENVALUE PROBLEMS IN LIOUVILLE NORMAL FORM
Bibliographic record
Abstract
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".