Using simultaneous diagonalization and trace minimization to make an efficient and simple multidimensional basis for solving the vibrational Schrödinger equation
Bibliographic record
Abstract
In this paper we improve the product simultaneous diagonalization (SD) basis method we previously proposed [J. Chem. Phys. 122, 134101 (2005)] and applied to solve the Schrodinger equation for the motion of nuclei on a potential surface. The improved method is tested using coupled complicated Hamiltonians with as many as 16 coordinates for which we can easily find numerically exact solutions. In a basis of sorted products of one-dimensional (1D) SD functions the Hamiltonian matrix is nearly diagonal. The localization of the 1D SD functions for coordinate qc depends on a parameter we denote alphac. In this paper we present a trace minimization scheme for choosing alphac to nearly block diagonalize the Hamiltonian matrix. Near-block diagonality makes it possible to truncate the matrix without degrading the accuracy of the lowest energy levels. We show that in the sorted product SD basis perturbation theory works extremely well. The trace minimization scheme is general and easy to implement.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".