- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- TRIUMF: Canada's national laboratory for particle and nuclear physics /
- A computer program for beam transport calculations
Open Collections
TRIUMF: Canada's national laboratory for particle and nuclear physics
A computer program for beam transport calculations Tautz, Maurice Francis
Abstract
A computer program TRIUMF for the solution of beam transport problems is described. This program tracks, to first order, particle trajectories and phase space ellipses through any combination of up to 30 drift spaces, quadrupole magnets, and constant field bending magnets with rotated pole faces. Particle trajectories or the beam envelope may be plotted for points every 20 cm. along the optic axis. The phase space ellipse at the exit of any beam element may also be plotted. The program does trajectory matching and ellipse matching to a waist or to a specified ellipse. It will also attempt to create an 'identity system'. The matching routines are based on a method for finding the minimum of a function of N variables without calculating first derivatives due to Powell. The program has been written in Fortran II and will run without modification on the IBM/360 digital computer.
Item Metadata
Title |
A computer program for beam transport calculations
|
Alternate Title |
TRIUMF brown reports TRI-68-5
|
Creator | |
Publisher |
TRIUMF
|
Date Issued |
1968-03
|
Description |
A computer program TRIUMF for the solution of beam
transport problems is described. This program tracks, to
first order, particle trajectories and phase space
ellipses through any combination of up to 30 drift spaces,
quadrupole magnets, and constant field bending magnets with
rotated pole faces. Particle trajectories or the beam
envelope may be plotted for points every 20 cm. along the
optic axis. The phase space ellipse at the exit of any beam
element may also be plotted. The program does trajectory
matching and ellipse matching to a waist or to a specified
ellipse. It will also attempt to create an 'identity
system'. The matching routines are based on a method for
finding the minimum of a function of N variables without
calculating first derivatives due to Powell. The program
has been written in Fortran II and will run without
modification on the IBM/360 digital computer.
|
Subject | |
Genre | |
Type | |
Language |
eng
|
Date Available |
2016-09-22
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0314569
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Researcher
|
Copyright Holder |
TRIUMF
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International