首页> 外文会议> >Kick factorization of symplectic maps
【24h】

Kick factorization of symplectic maps

机译:辛映射的踢分解

获取原文

摘要

There are two tacit assumptions made in the design and construction of accelerators and storage rings. The first, made by machine builders, is that if two machines are nearly the same, their performance (including long-term orbit stability) should be nearly the same. The second, made by accelerator theorists, is that analyticalumerical models of machine behavior, despite their approximate nature, still have relevance for real machines. From a mathematical perspective, what is being assumed in either case is that if two symplectic maps are close, then the behavior (including long-term behavior) of systems described by these maps should be nearly the same. The authors explore in a mathematical context, and for a simple example, some aspects of this assumption.
机译:在加速器和存储环的设计和构造中有两个默认的假设。首先是由机器制造商提出的,如果两台机器几乎相同,则它们的性能(包括长期轨道稳定性)应该几乎相同。第二个是由加速器理论家提出的,它是机器行为的分析/数值模型,尽管它们具有近似性质,但仍然与真实的机器相关。从数学角度来看,在两种情况下都假定,如果两个辛映射很接近,则这些映射所描述的系统的行为(包括长期行为)应该几乎相同。作者在数学上下文中进行了探索,并以一个简单的示例探讨了该假设的某些方面。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号