Equilibrium of an arbitrary bunch train with cavity resonators and short range wake: Enhanced iterative solution with Anderson acceleration
Bibliographic record
Abstract
This paper continues the work of two previous treatments of bunch lengthening by a passive harmonic cavity in an electron storage ring. Such cavities, intended to reduce the effect of Touschek scattering, are a feature of fourth generation synchrotron light sources. The charge densities in the equilibrium state are given by solutions of coupled Ha\"{\i}ssinski equations, which are nonlinear integral equations. If the only wake fields are from cavity resonators, the unknowns can be the Fourier transforms of bunch densities at the resonator frequencies. The solution scheme based on this choice of unknowns proved to be deficient at the design current when multiple resonators were included. Here we return to the conventional formulation of Ha\"{\i}ssinski equations in coordinate space, the unknowns being charge densities at mesh points on a fine grid. This system would be awkward to solve by the Newton method used previously, because the Jacobian matrix is very large. Here a new solution is described, which is both Jacobian-free and much simpler. It is based on an elementary fixed point iteration, accelerated by Anderson's method. The scheme is notably fast and robust, accommodating even the case of extreme overstretching at current far beyond the design value. The Anderson method is promising for many problems in accelerator theory and beyond, since it is quite simple and can be used to attack all kinds of nonlinear and linear integral and differential equations. Results are presented for ALS-U with updated design parameters. The model includes harmonic and main rf cavities, compensation of beam loading of the main cavity by adjustment of the generator voltage, and a realistic short range wake field (rather than the broadband resonator wake invoked previously).
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| 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".