Mathematical Models with Nonlocal Initial Conditions: An Exemplification from Quantum Mechanics
Bibliographic record
Abstract
Nonlocal models are ubiquitous in all branches of science and engineering, with a rapidly expanding range of mathematical and computational applications due to the ability of such models to capture effects and phenomena that traditional models cannot. While spatial nonlocalities have received considerable attention in the research community, the same cannot be said about nonlocality in time, in particular when nonlocal initial conditions are present. This paper aims at filling this gap, providing an overview of the current status of nonlocal models and focusing on the mathematical treatment of such models when nonlocal initial conditions are at the heart of the problem. Specifically, our representative example is given for a nonlocal-in-time problem for the abstract Schrödinger equation. By exploiting the linear nature of nonlocal conditions, we derive an exact representation of the solution operator under assumptions that the spectrum of Hamiltonian is contained in the horizontal strip of the complex plane. The derived representation permits us to establish the necessary and sufficient conditions for the problem’s well-posedness and the existence of its solution under different regularities. Furthermore, we present new sufficient conditions for the existence of the solution that extend the existing results in this field to the case when some nonlocal parameters are unbounded. Two further examples demonstrate the developed methodology and highlight the importance of its computer algebra component in the reduction procedures and parameter estimations for nonlocal models. Finally, a connection of the considered models and developed analysis is discussed in the context of other reduction techniques, concentrating on the most promising from the viewpoint of data-driven modelling environments, and providing directions for further generalizations.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".