A free interactive matching program

J. Ostiguy
{"title":"A free interactive matching program","authors":"J. Ostiguy","doi":"10.1109/PAC.1999.792912","DOIUrl":null,"url":null,"abstract":"For physicists and engineers involved in the design and analysis of beamlines (transfer lines or insertions) the lattice function matching problem is central and can be time-consuming because it involves constrained nonlinear optimization. For such problems convergence can be difficult to obtain in general without expert human intervention. Over the years, powerful codes have been developed to assist beamline designers. The canonical example is MAD (Methodical Accelerator Design) developed at CERN by Christophe Iselin. MAD, through a specialized command language, allows one to solve a wide variety of problems, including matching problems. Although in principle, the MAD command interpreter can be run interactively, in practice the solution of a matching problem involves a sequence of independent trial runs. Unfortunately, but perhaps not surprisingly, there still exists relatively few tools exploiting the resources offered by modern environments to assist lattice designer with this routine and repetitive task. In this paper, we describe a fully interactive lattice matching program, written in C++ and assembled using freely available software components. An important feature of the code is that the evolution of the lattice functions during the nonlinear iterative process can be graphically monitored in real time; the user can dynamically interrupt the iterations at will to introduce new variables, freeze existing ones into their current state and/or modify constraints. The program runs under both UNIX and Windows NT.","PeriodicalId":20453,"journal":{"name":"Proceedings of the 1999 Particle Accelerator Conference (Cat. No.99CH36366)","volume":"48 1","pages":"2710-2712 vol.4"},"PeriodicalIF":0.0000,"publicationDate":"1999-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 Particle Accelerator Conference (Cat. No.99CH36366)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PAC.1999.792912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

For physicists and engineers involved in the design and analysis of beamlines (transfer lines or insertions) the lattice function matching problem is central and can be time-consuming because it involves constrained nonlinear optimization. For such problems convergence can be difficult to obtain in general without expert human intervention. Over the years, powerful codes have been developed to assist beamline designers. The canonical example is MAD (Methodical Accelerator Design) developed at CERN by Christophe Iselin. MAD, through a specialized command language, allows one to solve a wide variety of problems, including matching problems. Although in principle, the MAD command interpreter can be run interactively, in practice the solution of a matching problem involves a sequence of independent trial runs. Unfortunately, but perhaps not surprisingly, there still exists relatively few tools exploiting the resources offered by modern environments to assist lattice designer with this routine and repetitive task. In this paper, we describe a fully interactive lattice matching program, written in C++ and assembled using freely available software components. An important feature of the code is that the evolution of the lattice functions during the nonlinear iterative process can be graphically monitored in real time; the user can dynamically interrupt the iterations at will to introduce new variables, freeze existing ones into their current state and/or modify constraints. The program runs under both UNIX and Windows NT.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一个免费的互动配对程序
对于参与光束线(传递线或插入线)设计和分析的物理学家和工程师来说,晶格函数匹配问题是中心问题,并且可能很耗时,因为它涉及约束非线性优化。对于这类问题,如果没有专家的干预,通常很难获得收敛性。多年来,已经开发出强大的代码来协助光束线设计人员。典型的例子是由Christophe Iselin在欧洲核子研究中心开发的MAD(有条不紊的加速器设计)。通过一种专门的命令语言,MAD允许人们解决各种各样的问题,包括匹配问题。虽然在原则上,MAD命令解释器可以交互式地运行,但在实践中,匹配问题的解决方案涉及一系列独立的试运行。不幸的是,但也许并不令人惊讶的是,仍然有相对较少的工具利用现代环境提供的资源来帮助晶格设计师完成这种常规和重复的任务。在本文中,我们描述了一个完全交互的格子匹配程序,用c++编写,并使用免费的软件组件进行组装。该代码的一个重要特点是可以实时图形化地监测晶格函数在非线性迭代过程中的演化;用户可以随意动态地中断迭代,以引入新的变量,将现有的变量冻结到当前状态和/或修改约束。该程序可以在UNIX和Windows NT下运行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Characteristics of helium ion beams from multicusp source and study of beam transport Feedback systems for linear colliders Conceptual design of a vacuum system for a compact, high luminosity CESR upgrade Electro-optical detection of charged particle beams Pulsed neutron source using 100-MeV electron linac at Pohang Accelerator Laboratory
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1