Accelerator Modeling with PTC What is PTC? Etienne Forest 高エネルギー加速器研究機構 (KEK)

Slides:



Advertisements
Similar presentations
Agenda Definitions Evolution of Programming Languages and Personal Computers The C Language.
Advertisements

An introduction to pointers in c
Lecture 14 User-defined functions Function: concept, syntax, and examples © 2007 Daniel Valentine. All rights reserved. Published by Elsevier.
Chapter 7 Introduction to Procedures. So far, all programs written in such way that all subtasks are integrated in one single large program. There is.
CHAPTER 2 GC101 Program’s algorithm 1. COMMUNICATING WITH A COMPUTER  Programming languages bridge the gap between human thought processes and computer.
Time Tracking in PTC. First order Time Tracking A high order integrator in the so-called “ s ” variable can be turned into a first order time tracker.
Chapter 1 An Overview of Computers and Programming Languages.
Programming Languages Marjan Sirjani 2 2. Language Design Issues Design to Run efficiently : early languages Easy to write correctly : new languages.
Microprocessors Introduction to ia64 Architecture Jan 31st, 2002 General Principles.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 3 Programming and Software.
Templates. Objectives At the conclusion of this lesson, students should be able to Explain how function templates are used Correctly create a function.
1 Topic Mathematical Proofs. 2 Topic Mathematical Proofs California Standards: 24.2 Students identify the hypothesis and conclusion in logical.
OBJECT ORIENTED PROGRAMMING IN C++ LECTURE
Functions. Program complexity the more complicated our programs get, the more difficult they are to develop and debug. It is easier to write short algorithms.
Introduction Status of SC simulations at CERN
MapleSim and the Advantages of Physical Modeling
Basic Mathematics Rende Steerenberg BE/OP CERN Accelerator School Basic Accelerator Science & Technology at CERN 3 – 7 February 2014 – Chavannes de Bogis.
Lecture 22 Miscellaneous Topics 4 + Memory Allocation.
Guidelines for the CMM coding project 5 October 2006 (or, “How to make your life easier in the long run”)
Profile and a quick introduction Software Engineering: ) هندسة البرمجيات (in Arabic: is the branch of computer science Designed to develop a set rules.
Spin Tracking Using the Bmad Software Library David Sagan Cornell Laboratory for Accelerator-Based Sciences and Education.
Simple Program Design Third Edition A Step-by-Step Approach
Lecture 2 How do we approach Perturbation theory with a Tracking Code equipped with a TPSA package? a.Description of our goals b.Concept of a Hierarchical.
1 CSI5388: Functional Elements of Statistics for Machine Learning Part I.
PTC ½ day – Experience in PS2 and SPS H. Bartosik, Y. Papaphilippou.
Computation of Taylor Maps and Applications to Accelerator Physics Six lectures with emphasis on examples and their computer implementations Etienne Forest.
1 Tracking code development for FFAGs S. Machida ASTeC/RAL 21 October, ffag/machida_ ppt & pdf.
Lecture 3 Need for new theory Stern-Gerlach Experiments Some doubts Analogy with mathematics of light Feynman’s double slit thought experiment.
Introduction of C++ language. C++ Predecessors Early high level languages or programming languages were written to address a particular kind of computing.
Polymorphism Lecture-10. Print A Cheque A Report A Photograph PrintCheque() PrintReport() PrintPhoto() Printing.
Eric Prebys, FNAL.  Let’s look at the Hill’ equation again…  We can write the general solution as a linear combination of a “sine-like” and “cosine-like”
PTC Integration into MAD-X What is PTC? (Etienne’s words) Some Facts about PTC What are the advantages for MAD-X? Magnet Treatment in PTC How will we use.
Compiling and the Java Virtual Machine (JVM). The syntax of Pseudocode is pretty loose –visual validation encourages a permissive approach –emphasized.
The Relativistic Quantum Field Calculator for Elementary Particle Interactions Brandon Green, Dr. Edward Deveney (Mentor) Department of Physics, Bridgewater.
Matching recipe and tracking for the final focus T. Asaka †, J. Resta López ‡ and F. Zimmermann † CERN, Geneve / SPring-8, Japan ‡ CERN, Geneve / University.
CS 350, slide set 5 M. Overstreet Old Dominion University Spring 2005.
Documentation of the Library FPP 高エネルギー加速器研究機構 KEK Etienne Forest and Yukiko Nogiwa With the help of Frank Schmidt and Piotr Skowronski FPP creates a type.
Historical (Hysterical?) Background Three schools of thought on codes & machine design –Quartermaster –Hacker –Curmudgeon.
Simulation of direct space charge in Booster by using MAD program Y.Alexahin, A.Drozhdin, N.Kazarinov.
Serge Andrianov Theory of Symplectic Formalism for Spin-Orbit Tracking Institute for Nuclear Physics Forschungszentrum Juelich Saint-Petersburg State University,
COMP3190: Principle of Programming Languages
Beginning Fortran Fortran (77) Advanced 29 October 2009 *Black text on white background provided for easy printing.
J-PARC Trace3D Upgrades Christopher K. Allen Los Alamos National Laboratory.
Frank SchmidtSpace Charge # 31 Style of the Meeting I have agreed with Elias that we want meetings without fear to ask any crazy question! Fancy presentations.
CSCI1600: Embedded and Real Time Software Lecture 28: Verification I Steven Reiss, Fall 2015.
Advanced Engineering Mathematics, 7 th Edition Peter V. O’Neil © 2012 Cengage Learning Engineering. All Rights Reserved. CHAPTER 4 Series Solutions.
Zeuten 19 - E. Wilson - 1/18/ Slide 1 Recap. of Transverse Dynamics E. Wilson – 15 th September 2003  Transverse Coordinates  Relativistic definitions.
PTC-ORBIT code for CERN machines (PSB, PS, SPS) Alexander Molodozhentsev (KEK) Etienne Forest (KEK) Group meeting, CERN June 1, 2011 current status …
Panel Discussion on Single Particle Codes 1.Catalogue of existing codes 2.Transparency of input and output between different codes: what is the status.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Off-momentum DA of RCS 3D_BM & QFF & CC AP meeting / December 8, 2004 Alexander Molodozhentsev Etienne Forest KEK.
PLACET User experiences with PLACET and examples of use for the Drive Beam CLIC Workshop 2008 Erik Adli, CERN/University of Oslo, October 16 th 2008 Lots.
Lecture 4 - E. Wilson –- Slide 1 Lecture 4 - Transverse Optics II ACCELERATOR PHYSICS MT 2009 E. J. N. Wilson.
SLAC LET Meeting Global Design Effort 1 CHEF: Recent Activity + Observations about Dispersion in Linacs Jean-Francois Ostiguy FNAL.
Sadegh Aliakbary Sharif University of Technology Fall 2010.
Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To understand the structure of a C-language program. ❏ To write your first C.
Canonical Variables in MAD John Jowett J.M. Jowett, MAD-X meeting, 7/11/
CHAPTER 2 GC101 Program’s algorithm 1. COMMUNICATING WITH A COMPUTER  Programming languages bridge the gap between human thought processes and computer.
Programming Languages
Lecture 2 How do we approach Perturbation theory with a Tracking Code equipped with a TPSA package? Description of our goals Concept of a Hierarchical.
Dynamic Aperture Studies with Acceleraticum
Introduction to the C Language
Benchmarking MAD, SAD and PLACET Characterization and performance of the CLIC Beam Delivery System with MAD, SAD and PLACET T. Asaka† and J. Resta López‡
CS 326 Programming Languages, Concepts and Implementation
Character (String) Data
Beam dynamics study for J-PARC Main Ring with PTC-ORBIT
Chapter 1 Introduction(1.1)
CS2013 Lecture 7 John Hurley Cal State LA.
Physics 417/517 Introduction to Particle Accelerator Physics
Non-linear (Effective) Modeling of Accelerators
Presentation transcript:

Accelerator Modeling with PTC What is PTC? Etienne Forest 高エネルギー加速器研究機構 (KEK)

Why talking about PTC? Epsilon documentation, no support and no patience. I suppose because it is in MAD-X MAD is a code from CERN Code was written by order of the present MAD-X guru Frank Schmidt Code contains vaguely interesting ideas especially in the light of the CLASSIC collapse (MAD9)

What is PTC? Contains two parts 1.FPP => Overloading of Berz and Forest FORTRAN77 tools for production and analysis of Taylor Maps. Creation of a convenient Polymorphic Taylor Type. 2.PTC proper=> A single particle tracking code with structures fully exploiting the “s”-maps of magnets which also uses FPP.

FPP Stands for fully polymorphic package. It is only useful if you know what to do with a Taylor map. Personally I use it mainly for lattice function calculations and other perturbative calculations. Nothing new there if you know my work.

Example in a Tracking Environment SUBROUTINE EXAMPLE_TWISS USE ORBIT_PTC IMPLICIT NONE INTEGER I,NO REAL(DP) BETA_X TYPE(REAL_8) X_POL(6) TYPE(DAMAP) ID TYPE(NORMALFORM) NFORM CALL ALLOC(X_POL); X_ORBIT=0.D0; X_ORBIT(5)=0.01D0; CALL FIND_ORBIT(MY_RING,X_ORBIT,1) WRITE(6,*) X_ORBIT WRITE(6,*) & "GIVE ORDER OF TAYLOR MAP "; READ(5,*) NO; IF(NO>0) THEN CALL INIT(NO) CALL ALLOC(ID); CALL ALLOC(NFORM); ID=1 X_POL=X_ORBIT+ID ELSE X_POL=X_ORBIT ENDIF DO I=1,MY_ORBIT_LATTICE%ORBIT_N_NODE CALL ORBIT_TRACK_NODE(I,X_POL) ENDDO WRITE(6,*) "POLYMORPHS PRINTED " CALL PRINT(X_POL,6) ! WE WILL DO A TWISS CALCULATION OF BETA_X IF(NO>0) THEN NFORM=X_POL WRITE(6,*) NFORM%TUNE X_POL=X_ORBIT+NFORM%A_T BETA_X= (X_POL(1).SUB.'10')**2+(X_POL(1).SUB.'01')**2 WRITE(6,*) 'POS = ',0,' BETA_X = ', BETA_X DO I=1,MY_ORBIT_LATTICE%ORBIT_N_NODE CALL ORBIT_TRACK_NODE(I,X_POL,DEFAULT) BETA_X= (X_POL(1).SUB.'10')**2+(X_POL(1).SUB.'01')**2 IF(MOD(I,50)==1.OR.I==MY_ORBIT_LATTICE%ORBIT_N_NODE) & WRITE(6,*) 'POS = ',I,' BETA_X = ', BETA_X ENDDO ENDIF CALL KILL(X_POL); IF(NO>1) THEN CALL KILL(ID); ENDIF END SUBROUTINE EXAMPLE_TWISS

More about FPP? Please come to the poster session! Or bug me any time during this conference! Conclusion : FPP overloads Berz’s Old package in FORTRAN90 and my own Lie/Da/etc.. analysis tools (Lielib) from the old days. An essential but independent part of PTC and PTC based software such as MAD-XP.

What is structurally new in PTC? What is new in PTC?

Things which are not really new! Its is an “exact” integrator: So is TEAPOT, so is Meot’s code Zgoubi. It is, for the most part, a symplectic integrator: so are kick codes and TEAPOT. It is an explicit symplectic integrator which can handle correctly the body of magnets (square-root effect): Well perhaps most complete but this was first a Talman idea. Using TPSA (Berz’s DA) and Forest’s Lielib in all perturbative calculations: I have been bitching about this since 1986! Taylor Polymorphism: Berz in interpreted form (COSY) and Bengtsson in compiled form since the late 80s or early 90s. Radiation through beam envelopes rather that the stinky Sands integrals: Oide in SAD in the early 90s. Etc…

New Stuff: Motivation “Real World”: Newton-Lorentz Equation Primordial input Describing the global B field is what matter

Accelerator Code sisi s i+1 sjsj s j+1

Summary ? → Generic Magnet → Magnet Propagator → Propagation through the magnet Arrangement of Hardware → Global B,E → Lorentz → Propagation for a time dt Standard Laws of Physics Usual Beam Dynamics Code Question: what kind of structures should be located above the generic magnet? This question fits in the object oriented paradigm in which MAD9 swam and ultimately sunk because objected oriented programming is centred around data rather than algorithms. Local B,E

Magnet Oriented Obviously map(s) attached to magnets are central objects. The B/E field is important but it is now attached to a magnet rather than a global object. The two propagators shown in previous slide can exist in the same machine: dogbone, colliders, etc… What can we conclude?

Structures 1.Beam lines are actually link lists of the discretized “s” variables and not sequences of magnet propagators as in standard codes. 2.I baptized the element of this sequence “fibres” inspired by Hirata since it is connected to the mathematical fibre bundles. 3.Fibres contains pointers to magnets and pointers to transformations to the local variables used at that particular “s” position: my so-called patches. WHY?

Example: Recirculator Magnify this common region

Pictorial Justification Epsilon documentation, no support and no patience. dafne Dog bone Hose

My solution

Conclusions Most bizarre topologies permitted: recirculators, dog bones, colliders and multiple combinations of these horrors Fully 3d lattices like the quadrupole fibres of Mori and Machida. In PTC the survey command is essentially useless and definitely arbitrary. It is used for double checking geometric patching or entering standard lattices. (N.B. MAD and SAD have different conventions for survey!) PTC is only one possible solution: Malitsky has done some work to generalize the ideas in this lecture. In particular we should be able to access diverse propagators from any kind of complex structures.