Description
Main linac tuning techniques – we want independently-prepared versions of our algorithms to give convergent results; we want to understand the limitations of the algorithms as they are (what are the oversimplifications, etc); we want to understand whether these techniques will work on a continually-curved lattice. Goal is to ensure that our tuning techniques actually work (by having independent versions of them which agree) and to define the work that still needs to be done on each of them. To this end we probably need a short presentation from each simulator on what their results are for some given set of inputs (the DFS is already going in this direction), and what their simplifications are, followed by discussion when it turns out they don’t agree. The techniques are BA, DFS, KM.
