Error analysis of molecular dynamics and fractal time approximants from a combinatorial perspective
Bibliographic record
Abstract
Trotter's theorem forms the theoretical basis of most modern molecular dynamics. In essence this theorem states that a time displacement operator (a Lie operator) constructed by exponentiating a sum of noncommuting operators can be approximated by a product of single operators provided the time interval is "very small." In theory "very small" implies infinitesimally small (at which point the approximate product becomes exact), while in practical analysis a finite time interval is divided into several small subintervals or steps. It follows, therefore, that the larger the number of steps the better the approximation to the exact time displacement operator. The question therefore arises: How many steps are sufficient? For bounded operators, standard theorems are available to provide the answer. In this paper we show that a very simple combinatorial formula can be derived which allows the computation of the global differences (as a function of the number of steps) between the Taylor coefficients of the exact time displacement operator and an approximate one constructed by using a finite number of steps. The formula holds for both bounded and nonbounded operators and shows, quantitatively, what is qualitatively expected-that the error decreases with increasing number of steps. Furthermore, the formula applies irrespective of the complexity of the system, boundary conditions, or the thermodynamic ensemble employed for averaging the initial conditions. The analysis yields explicit expressions for the Taylor coefficients which are then used to compute the errors. In the case of the algorithmically based practical numerical simulations in which fixed, albeit small, steps are repeatedly applied, the rise in the number of steps does not reduce the size of the steps but increases the total time of interest. The combinatorial formula shows that, here, the errors diverge. Furthermore, this work can be used to supplement other efforts such as the use of shadow Hamiltonians where the truncation of the series expansion of the latter will produce errors in the higher order propagator moments.
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.002 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
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".