[FFA_CEBAF_Collab] [EXTERNAL] Re: Convergence map with action-angle variables based on square matrix for nonlinear lattice optimization

[Georg Heinz Hoffstaetter]

Hi Jay,

Thanks for sending, it does sound like an interesting idea, good for all long-term stability question, e.g., in storage rings, and maybe also in highly repetitive FFAs.

Best,
Georg


> On Dec 6, 2022, at 7:32 AM, Jay Benesch via FFA_CEBAF_Collab <ffa_cebaf_collab at jlab.org> wrote:
> 
> seems relevant to FFA and EIC.  YMMV
> 
> https://urldefense.proofpoint.com/v2/url?u=https-3A__arxiv.org_abs_2212.01430&d=DwIFAg&c=CJqEzB1piLOyyvZjb8YUQw&r=Ogg4WFNBwvADBq3fkmCLiJ7SaRDPYtawHzJElJMB0jE&m=oXODN3ph1JwXJLqNnRnzwOYMFCz3WQvNu9HgSt-lyXGLYGZzFUx52Xa5OBpwsdKf&s=55n9AYwfzSm5ypLK-VoajOJ6SL2dydr_dsRSiX05-6M&e= 
> 
> Convergence map with action-angle variables based on square matrix for nonlinear lattice optimization
> Li Hua Yu, Yoshiteru Hidaka, Victor Smaluk  (BNL)
> 
>    To analyze nonlinear dynamic systems, we developed a new technique based on the square matrix method. We propose this technique called the \convergence map" for generating particle stability diagrams similar to the frequency maps widely used in accelerator physics to estimate dynamic aperture. The convergence map provides similar information as the frequency map but in a much shorter computing time. The dynamic equation can be rewritten in terms of action-angle variables provided by the square matrix derived from the accelerator lattice. The convergence map is obtained by solving the exact nonlinear equation iteratively by the perturbation method using Fourier transform and studying convergence. When the iteration is convergent, the solution is expressed as a quasi-periodic analytical function as a highly accurate approximation, and hence the motion is stable. The border of stable motion determines the dynamical aperture. As an example, we applied the new method to the nonlinear optimization of the NSLS-II storage ring and demonstrated a dynamic aperture comparable to or larger than the nominal one obtained by particle tracking. The computation speed of the convergence map is 30 to 300 times faster than the speed of the particle tracking, depending on the size of the ring lattice (number of superperiods). The computation speed ratio is larger for complex lattices with low symmetry, such as particle colliders.
> 
> Subjects: 	Accelerator Physics (physics.acc-ph); Numerical Analysis (math.NA)
> Cite as: 	arXiv:2212.01430 [physics.acc-ph]
> _______________________________________________
> FFA_CEBAF_Collab mailing list
> FFA_CEBAF_Collab at jlab.org
> https://mailman.jlab.org/mailman/listinfo/ffa_cebaf_collab