This volume lays down the foundations of a theory of rings based on finite maps. The purpose of the ring is entirely discussed in terms of the global properties of the one-turn map. Proposing a theory of rings based on such maps, this work offers another perspective on storage ring theory.

This volume lays down the foundations of a theory of rings based on finite maps. The purpose of the ring is entirely discussed in terms of the global properties of the one-turn map. Proposing a theory of rings based on such maps, this work offers another perspective on storage ring theory.

This book illustrates a theory well suited to tracking codes, which the author has developed over the years. Tracking codes now play a central role in the design and operation of particle accelerators. The theory is fully explained step by step with equations and actual codes that the reader can compile and run with freely available compilers. In this book, the author pursues a detailed approach based on finite "s"-maps, since this is more natural as long as tracking codes remain at the centre of accelerator design. The hierarchical nature of software imposes a hierarchy that puts map-based perturbation theory above any other methods. The map-based approach, perhaps paradoxically, allows ultimately an implementation of the Deprit-Guignard-Schoch algorithms more faithful than anything found in the standard literature. This hierarchy of methods is not a personal choice: it follows logically from tracking codes overloaded with a truncated power series algebra package. After defining abstractly and briefly what a tracking code is, the author illustrates most of the accelerator perturbation theory using an actual code: PTC. This book may seem like a manual for PTC; however, the reader is encouraged to explore other tools as well. The presence of an actual code ensures that readers will have a tool with which they can test their understanding. Codes and examples will be available from various sites since PTC is in MAD-X (CERN) and BMAD (Cornell).

This book illustrates a theory well suited to tracking codes, which the author has developed over the years. Tracking codes now play a central role in the design and operation of particle accelerators. The theory is fully explained step by step with equations and actual codes that the reader can compile and run with freely available compilers. In this book, the author pursues a detailed approach based on finite "s"-maps, since this is more natural as long as tracking codes remain at the centre of accelerator design. The hierarchical nature of software imposes a hierarchy that puts map-based perturbation theory above any other methods. The map-based approach, perhaps paradoxically, allows ultimately an implementation of the Deprit-Guignard-Schoch algorithms more faithful than anything found in the standard literature. This hierarchy of methods is not a personal choice: it follows logically from tracking codes overloaded with a truncated power series algebra package. After defining abstractly and briefly what a tracking code is, the author illustrates most of the accelerator perturbation theory using an actual code: PTC. This book may seem like a manual for PTC; however, the reader is encouraged to explore other tools as well. The presence of an actual code ensures that readers will have a tool with which they can test their understanding. Codes and examples will be available from various sites since PTC is in MAD-X (CERN) and BMAD (Cornell).