Binary Degraders Often we want to control both scattering and energy loss in a beam line element. For instance, we might want a contoured scatterer with.

Slides:



Advertisements
Similar presentations
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
Advertisements

CSE 330: Numerical Methods
Mechanics of Machines Dr. Mohammad Kilani
FUNCTIONS AND MODELS Chapter 1. Preparation for calculus :  The basic ideas concerning functions  Their graphs  Ways of transforming and combining.
Maximum likelihood Conditional distribution and likelihood Maximum likelihood estimations Information in the data and likelihood Observed and Fisher’s.
INTEGRALS 5. INTEGRALS We saw in Section 5.1 that a limit of the form arises when we compute an area.  We also saw that it arises when we try to find.
Evaluating Hypotheses
Cmpt-225 Algorithm Efficiency.
Understanding Arrays and Pointers Object-Oriented Programming Using C++ Second Edition 3.
Data Flow Analysis Compiler Design Nov. 8, 2005.
LIMITS Calculating Limits Using the Limit Laws LIMITS In this section, we will: Use the Limit Laws to calculate limits.
Lecture Slides Elementary Statistics Twelfth Edition
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by.
2 Graphs and Functions Sections 2.2–2.3 © 2008 Pearson Addison-Wesley.
Lehrstuhl für Informatik 2 Gabriella Kókai: Maschine Learning 1 Evaluating Hypotheses.
Maximum likelihood (ML)
Solving Systems of Equations Algebraically
LIAL HORNSBY SCHNEIDER
Linear Systems The definition of a linear equation given in Chapter 1 can be extended to more variables; any equation of the form for real numbers.
Simple Random Sampling
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Introduction to MATLAB 7 for Engineers William J. Palm.
Copyright © Cengage Learning. All rights reserved. 1 Functions and Limits.
Preview of Calculus.
Introduction to MATLAB for Engineers, Third Edition William J. Palm III Chapter 8 Linear Algebraic Equations PowerPoint to accompany Copyright © 2010.
1 Preliminaries Precalculus Review I Precalculus Review II
LIMITS AND DERIVATIVES 2. We have used calculators and graphs to guess the values of limits.  However, we have learned that such methods don’t always.
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 2 Graphs and Functions Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Chapter 2.2 Functions. Relations and Functions Recall from Section 2.1 how we described one quantity in terms of another. The letter grade you receive.
11 Table 2.1 defines a correspondence between a set of percent scores and a set of letter grades. For each score from 0 to 100, there corresponds only.
Mechanics of Machines Dr. Mohammad Kilani Class 3 Position Analysis.
We have used calculators and graphs to guess the values of limits.  However, we have learned that such methods do not always lead to the correct answer.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Chapter 3 Roots of Equations. Objectives Understanding what roots problems are and where they occur in engineering and science Knowing how to determine.
© The McGraw-Hill Companies, 2006 Chapter 2 Selection.
Sequences and Summations Section 2.4. Section Summary Sequences. – Examples: Geometric Progression, Arithmetic Progression Recurrence Relations – Example:
Numerical Methods.
CMP-MX21: Lecture 5 Repetitions Steve Hordley. Overview 1. Repetition using the do-while construct 2. Repetition using the while construct 3. Repetition.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
CHAPTER 3 NUMERICAL METHODS
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
Single scattering is the simplest way to spread out a proton beam. It is relatively immune to beam alignment. On the other hand, it is inefficient and.
1 Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Example: In a recent poll, 70% of 1501 randomly selected adults said they believed.
Advanced Engineering Mathematics, 7 th Edition Peter V. O’Neil © 2012 Cengage Learning Engineering. All Rights Reserved. CHAPTER 4 Series Solutions.
CSC5101 Advanced Algorithms Analysis
Key Stone Problem… Key Stone Problem… Set 17 Part 2 © 2007 Herbert I. Gross next.
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
INTEGRALS We saw in Section 5.1 that a limit of the form arises when we compute an area. We also saw that it arises when we try to find the distance traveled.
5 INTEGRALS.
Sampling Design and Analysis MTH 494 Lecture-21 Ossam Chohan Assistant Professor CIIT Abbottabad.
FUNCTIONS AND MODELS Exponential Functions FUNCTIONS AND MODELS In this section, we will learn about: Exponential functions and their applications.
Finding Limits Algebraically In Section 12-1, we used calculators and graphs to guess the values of limits. However, we saw that such methods don’t always.
Algorithms and Pseudocode
If information seems to be missing, make any reasonable assumptions. 1.A target has an areal density of 2.3 g/cm 2 and a thickness of 0.8 inch. What is.
Foundations of Software Testing Chapter 5: Test Selection, Minimization, and Prioritization for Regression Testing Last update: September 3, 2007 These.
LIMITS Calculating Limits Using the Limit Laws LIMITS In this section, we will: Use the Limit Laws to calculate limits.
2.3 Calculating Limits Using the Limit Laws LIMITS AND DERIVATIVES In this section, we will: Use the Limit Laws to calculate limits.
Week 1 Real Numbers and Their Properties (Section 1.6, 1.7, 1.8)
CSE 330: Numerical Methods. What is true error? True error is the difference between the true value (also called the exact value) and the approximate.
NUMERICAL ANALYSIS I. Introduction Numerical analysis is concerned with the process by which mathematical problems are solved by the operations.
Trigonometric Identities
6.1 One-to-One Functions; Inverse Function
Graphing Equations and Inequalities
Trigonometric Identities
Section 6.2 Linear Equations in One Variable
Coding Concepts (Basics)
College Algebra Fifth Edition
William Stallings Computer Organization and Architecture 10th Edition
Lecture Slides Elementary Statistics Twelfth Edition
Presentation transcript:

Binary Degraders Often we want to control both scattering and energy loss in a beam line element. For instance, we might want a contoured scatterer with an energy loss independent of radius, or a modulator with scattering angle independent of modulator step (thickness). We call such devices `compensated’ and one could make them by scouring the periodic table for an appropriate material. That is usually impractical. Instead, we combine high-Z and low-Z materials (e.g. lead and plastic) in ‘sandwiches’ having the correct ratio of materials. Finding that combination (if it exists) is basically trial-and-error, tedious by hand but relatively trivial on a computer if we use some standard ‘root finder’ technique. BGware has subprograms to solve such problems in beam line design. LOOKUP is a convenient user interface for by-hand design. This lecture explains how these programs work.

Energy loss and multiple scattering for 160 MeV protons incident on 1 g/cm 2 of various materials. L R ≡ radiation length, a property of the material which you can look up. Use lead (Pb) for scattering, plastic or beryllium for degrading. Ingredients

Examples Left: compensated modulator, principally of plastic. Energy loss increases with step # but multiple scattering angle remains constant thanks to the layer of lead. Right: compensated contoured scatterer, principally of lead. Scattering decreases with radius but total energy loss remains constant thanks to the plastic. The lead/plastic mix must respect both the required energy loss and the required scattering angle in both designs. The scatterer shows failure of compensation at large radius. We can tolerate it in this case.

Assume we have four functions at our disposal : where material a code e.g. ‘WATER’ or ‘polystyrene’ mode a code e.g. ‘HIGHLAND’ or ‘MOLIERE’ energy MeV range g/cm 2 thickness g/cm 2 Software Building Blocks

Let Then denotes the single degrader problem ‘Given the incoming and outgoing angles and the outgoing energy, find the degrader thickness and the incoming energy.’ Materials are always given. Similarly, Abbreviated Notation for Problems denotes the binary degrader problem ‘Given the incoming and outgoing energies and angles, find the required thicknesses and the energy at the interface.’ This is the binary problem most commonly encountered in beam line design.

Module BDG.FOR has subroutines for solving two single degrader problems: and five binary degrader problems: All can be run by hand from LOOKUP, and all sometimes arise in the design of passive beam spreading systems ! Solved Problems

A ‘forward’ problem is one where all thicknesses are known: The solution is straightforward: You can repeat this for as many degraders as you have. TOUT.FOR runs this procedure for a stack of degraders. TINP.FOR does it backwards. Single Degrader Forward Problem

In an inverse problem at least one thickness is unknown: We solve it by iteration (trial and error) on a related forward problem, after testing that a solution is possible. For instance, we can construct a function a2 = F(g1...) as follows. g1 is called x here because it is the cardinal unknown. rr = Range(t1,m1) – x t2 = Energy(rr,m1) F = SQRT(a1**2 + Theta0(mode,x,t2,m1,bb)**2) We now need to solve F(x) – c = 0 where c is the desired value of a2 and F(x) is not an algebraic expression, but a known numerical function. This is the standard numerical problem of finding the root of a function (see Numerical Methods). The Method of False Position (next slide) is often a good choice. Programming note: because the root finder iterates the whole sequence of statements, once it converges ancillary variables (such as t2) are already known. We don’t have to recompute them. Single Degrader Inverse Problem

Method of False Position ( Regula Falsa ) Find x such that F(x) – c = 0. In this method (Vaishali Ganit, ca. 3 rd century BC) a line is drawn between the last two points to bracket the root, and its intersection with y = c is used for the next bracket. The method is robust --- the root always stays bracketed --- and reasonably fast. We usually use it or the even more robust method of bisection. y = c y = F(x)

The following inverse problem is common in beam line design: The solution is similar. Focusing on one of the unknowns, say t2 because its brackets are known, we write down the forward solution a3(t2), then use a root finder to locate the value of t2 that yields the desired a3. We must check whether a solution exists and decide what to do if it does not. Energy trumps: t1 and t3 will be satisfied even if a3 cannot be. (In beam line design we usually need the correct energy, but we can often tolerate a small error in multiple scattering angle.) Suppose 160 MeV protons enter a lead/Lexan degrader. We want to reduce the energy to 110 MeV while obtaining exactly 40 mrad of multiple scattering. The solution, and the range of energies over which a solution exists, are shown in the next slide. Binary Degrader Inverse Problem

Binary Degrader Problem (Graphical) This graph shows the solution as well as the range of incoming and outgoing energies over which we can hold any given scattering angle a3. ‘All Lexan’ means we are asking for too much energy degradation given the desired angle; ‘all lead’ means we are asking for too little. Eventually the angle saturates at the maximum possible value for Lexan (see lecture on multiple scattering).

The order of materials makes a difference. If the lead is second it sees a lower energy and scatters more, so less lead is needed. In our example: However, the range over which a solution exists does not change, because once the binary degrader is all one or the other, ‘which comes first’ is meaningless. We can’t extend the range by changing the order! In our example the t3 range over which we can hold 40 mrad is 64 to 148 MeV. Does the Order of Materials Matter?

Summary High-Z elements scatter more and low-Z materials stop more. By combining e.g. lead and plastic we can (over a finite range) control both the multiple scattering and the energy loss in a beam line element. It is convenient to categorize problems using a compact notation. Forward problems, where all thicknesses are known, are solved by applying subroutines Range, Energy and Theta0. Inverse problems, where at least one thickness is to be found, are solved by focusing on one variable, writing down as a Fortran function the solution to the corresponding forward problem, and applying a root finder. Module BDG.FOR comprises solutions to two single- and five binary-degrader problems. LOOKUP is a convenient user interface to this module for by-hand designs. BDG.FOR is also used by our beam line design programs. The order of two materials affects how much of each material will be used, but cannot affect the range over which a solution satisfying all requirements exists. If no solution exists, energy trumps angle, and the program usually issues a ‘failure in compensation’ warning.