88 std::vector<double> fringeDerivatives(
maxOrder_m+2, 0.);
90 for (
size_t i = 0; i < fringeDerivatives.size(); ++i) {
91 fringeDerivatives[i] =
endField_m->function(zRel, i);
96 for (
size_t i = 1; i < x_n.size(); ++i) {
97 x_n[i] = x_n[i-1]*R[0];
106 for (
size_t i = 0; i < coefficients.size(); ++i) {
107 f_n[n] += coefficients[i]*fringeDerivatives[i];
108 dz_f_n[n] += coefficients[i]*fringeDerivatives[i+1];
111 double bref =
Bz_m*exp(
k_m*R[1]);
115 for (
size_t n = 0; n < x_n.size(); ++n) {
116 B[0] += bref*f_n[n+1]*(n+1)/
k_m*x_n[n];
117 B[1] += bref*f_n[n]*x_n[n];
118 B[2] += bref*dz_f_n[n]/
k_m*x_n[n];
134 std::vector<double> coefficients(oldCoefficients.size()+2, 0);
136 for (
size_t j = 0; j < oldCoefficients.size(); ++j) {
137 coefficients[j] += -1./(n)/(n-1)*
k_m*
k_m*oldCoefficients[j];
138 coefficients[j+2] += -1./(n)/(n-1)*oldCoefficients[j];
PartBunch< PLayout_t< double, 3 >, double, 3 > PartBunch_t
ippl::Vector< T, Dim > Vector_t
virtual void visitVerticalFFAMagnet(const VerticalFFAMagnet &)=0
Apply the algorithm to a vertical FFA magnet.
Component(const std::string &name)
Constructor with given name.
PartBunch_t * RefPartBunch_m
ElementBase(const std::string &name)
Constructor with given name.
ElementBase * clone() const
void accept(BeamlineVisitor &visitor) const
void initialise(PartBunch_t *bunch, double &startField, double &endField)
std::unique_ptr< endfieldmodel::EndFieldModel > endField_m
void calculateDfCoefficients()
BGeometryBase & getGeometry()
void setMaxOrder(size_t maxOrder)
std::vector< std::vector< double > > dfCoefficients_m
StraightGeometry straightGeometry_m
VerticalFFAMagnet(const std::string &name)
bool getFieldValue(const Vector_t< double, 3 > &R, Vector_t< double, 3 > &B) const
void setEndField(endfieldmodel::EndFieldModel *endField)
Abstract base class for accelerator geometry classes.
Abstract base class for electromagnetic fields.