Computes the Inverse Muon Decay (IMD) diff. cross section using the Bardin-Dokuchaeva including all 1-loop radiative corrections.
. More...

#include <BardinIMDRadCorPXSec.h>

Inheritance diagram for genie::BardinIMDRadCorPXSec:

Public Member Functions
	BardinIMDRadCorPXSec ()

	BardinIMDRadCorPXSec (string config)

virtual	~BardinIMDRadCorPXSec ()

double	XSec (const Interaction *i, KinePhaseSpace_t k) const
	Compute the cross section for the input interaction. More...

double	Integral (const Interaction *i) const

bool	ValidProcess (const Interaction *i) const
	Can this cross section algorithm handle the input process? More...

void	Configure (const Registry &config)

void	Configure (string param_set)

Public Member Functions inherited from genie::XSecAlgorithmI
virtual	~XSecAlgorithmI ()

virtual bool	ValidKinematics (const Interaction *i) const
	Is the input kinematical point a physically allowed one? More...

Public Member Functions inherited from genie::Algorithm
virtual	~Algorithm ()

virtual void	FindConfig (void)

virtual const Registry &	GetConfig (void) const

Registry *	GetOwnedConfig (void)

virtual const AlgId &	Id (void) const
	Get algorithm ID. More...

virtual AlgStatus_t	GetStatus (void) const
	Get algorithm status. More...

virtual bool	AllowReconfig (void) const

virtual AlgCmp_t	Compare (const Algorithm *alg) const
	Compare with input algorithm. More...

virtual void	SetId (const AlgId &id)
	Set algorithm ID. More...

virtual void	SetId (string name, string config)

const Algorithm *	SubAlg (const RgKey &registry_key) const

void	AdoptConfig (void)

void	AdoptSubstructure (void)

virtual void	Print (ostream &stream) const
	Print algorithm info. More...

Private Member Functions
void	LoadConfig (void)

double	Li2 (double z) const

double	Fa (double re, double r, double y) const

double	P (int i, double r, double y) const

double	C (int i, int k, double r) const

Private Attributes
const XSecIntegratorI *	fXSecIntegrator
	differential x-sec integrator More...

Additional Inherited Members
Static Public Member Functions inherited from genie::Algorithm
static string	BuildParamVectKey (const std::string &comm_name, unsigned int i)

static string	BuildParamVectSizeKey (const std::string &comm_name)

Protected Member Functions inherited from genie::XSecAlgorithmI
	XSecAlgorithmI ()

	XSecAlgorithmI (string name)

	XSecAlgorithmI (string name, string config)

Protected Member Functions inherited from genie::Algorithm
	Algorithm ()

	Algorithm (string name)

	Algorithm (string name, string config)

void	Initialize (void)

void	DeleteConfig (void)

void	DeleteSubstructure (void)

Registry *	ExtractLocalConfig (const Registry &in) const

Registry *	ExtractLowerConfig (const Registry &in, const string &alg_key) const
	Split an incoming configuration Registry into a block valid for the sub-algo identified by alg_key. More...

template<class T >
bool	GetParam (const RgKey &name, T &p, bool is_top_call=true) const

template<class T >
bool	GetParamDef (const RgKey &name, T &p, const T &def) const

template<class T >
int	GetParamVect (const std::string &comm_name, std::vector< T > &v, bool is_top_call=true) const
	Handle to load vectors of parameters. More...

int	GetParamVectKeys (const std::string &comm_name, std::vector< RgKey > &k, bool is_top_call=true) const

int	AddTopRegistry (Registry *rp, bool owns=true)
	add registry with top priority, also update ownership More...

int	AddLowRegistry (Registry *rp, bool owns=true)
	add registry with lowest priority, also update ownership More...

int	MergeTopRegistry (const Registry &r)

int	AddTopRegisties (const vector< Registry * > &rs, bool owns=false)
	Add registries with top priority, also udated Ownerships. More...

Protected Attributes inherited from genie::Algorithm
bool	fAllowReconfig

bool	fOwnsSubstruc
	true if it owns its substructure (sub-algs,...) More...

AlgId	fID
	algorithm name and configuration set More...

vector< Registry * >	fConfVect

vector< bool >	fOwnerships
	ownership for every registry in fConfVect More...

AlgStatus_t	fStatus
	algorithm execution status More...

AlgMap *	fOwnedSubAlgMp
	local pool for owned sub-algs (taken out of the factory pool) More...

Detailed Description

Computes the Inverse Muon Decay (IMD) diff. cross section using the Bardin-Dokuchaeva including all 1-loop radiative corrections.
.

This is a 'trully' inclusive IMD cross section, i.e. the brem. cross section (dxsec_brem/dy)|w>w0 [see Bardin paper, cited below] is not subtracted from the IMD cross section and therefore it is not suitable for experimental situations where a photon energy trigger threshold is applied.

Is a concrete implementation of the XSecAlgorithmI interface.
D.Yu.Bardin and V.A.Dokuchaeva, Nucl.Phys.B287:839 (1987)

Author: Costas Andreopoulos <constantinos.andreopoulos cern.ch> University of Liverpool & STFC Rutherford Appleton Laboratory

February 14, 2005

Definition at line 39 of file BardinIMDRadCorPXSec.h.

Constructor & Destructor Documentation

BardinIMDRadCorPXSec::BardinIMDRadCorPXSec ( )

Definition at line 27 of file BardinIMDRadCorPXSec.cxx.

                                            :
 XSecAlgorithmI("genie::BardinIMDRadCorPXSec")
 {
 
 }

BardinIMDRadCorPXSec::BardinIMDRadCorPXSec ( string config )

Definition at line 33 of file BardinIMDRadCorPXSec.cxx.

                                                         :
 XSecAlgorithmI("genie::BardinIMDRadCorPXSec", config)
 {
 
 }

BardinIMDRadCorPXSec::~BardinIMDRadCorPXSec ( )

virtual

Definition at line 39 of file BardinIMDRadCorPXSec.cxx.

 {
 
 }

Member Function Documentation

double BardinIMDRadCorPXSec::C	(	int	i,
		int	k,
		double	r
	)		const

private

Definition at line 189 of file BardinIMDRadCorPXSec.cxx.

 {
   if        ( i == 1 ) {
 
       if      (k == -3) return -0.19444444*TMath::Power(r,3.);
       else if (k == -2) return (0.083333333+0.29166667*r)*TMath::Power(r,2.);
       else if (k == -1) return -0.58333333*r - 0.5*TMath::Power(r,2.) - TMath::Power(r,3.)/6.;
       else if (k ==  0) return -1.30555560 + 3.125*r + 0.375*TMath::Power(r,2.);
       else if (k ==  1) return -0.91666667 - 0.25*r;
       else if (k ==  2) return 0.041666667;
       else              return 0.;
 
   } else if ( i == 2 ) {
 
       if      (k == -3) return 0.;
       else if (k == -2) return 0.5*TMath::Power(r,2.);
       else if (k == -1) return 0.5*r - 2*TMath::Power(r,2.);
       else if (k ==  0) return 0.25 - 0.75*r + 1.5*TMath::Power(r,2);
       else if (k ==  1) return 0.5;
       else if (k ==  2) return 0.;
       else              return 0.;
 
   } else if ( i == 3 ) {
 
       if      (k == -3) return 0.16666667*TMath::Power(r,3.);
       else if (k == -2) return 0.25*TMath::Power(r,2.)*(1-r);
       else if (k == -1) return r-0.5*TMath::Power(r,2.);
       else if (k ==  0) return 0.66666667;
       else if (k ==  1) return 0.;
       else if (k ==  2) return 0.;
       else              return 0.;
 
   } else if ( i == 4 ) {
 
       if      (k == -3) return 0.;
       else if (k == -2) return TMath::Power(r,2.);
       else if (k == -1) return r*(1-4.*r);
       else if (k ==  0) return 1.5*TMath::Power(r,2.);
       else if (k ==  1) return 1.;
       else if (k ==  2) return 0.;
       else              return 0.;
 
   } else if ( i == 5 ) {
 
       if      (k == -3) return 0.16666667*TMath::Power(r,3.);
       else if (k == -2) return -0.25*TMath::Power(r,2.)*(1+r);
       else if (k == -1) return 0.5*r*(1+3*r);
       else if (k ==  0) return -1.9166667+2.25*r-1.5*TMath::Power(r,2);
       else if (k ==  1) return -0.5;
       else if (k ==  2) return 0.;
       else              return 0.;
 
   } else if ( i == 6 ) {
 
       if      (k == -3) return 0.;
       else if (k == -2) return 0.16666667*TMath::Power(r,2.);
       else if (k == -1) return -0.25*r*(r+0.33333333);
       else if (k ==  0) return 1.25*(r+0.33333333);
       else if (k ==  1) return 0.5;
       else if (k ==  2) return 0.;
       else              return 0.;
 
   } else return 0.;
 }

void BardinIMDRadCorPXSec::Configure ( const Registry & config )

virtual

Configure the algorithm with an external registry The registry is merged with the top level registry if it is owned, Otherwise a copy of it is added with the highest priority

Reimplemented from genie::Algorithm.

Definition at line 254 of file BardinIMDRadCorPXSec.cxx.

 {
   Algorithm::Configure(config);
   this->LoadConfig();
 }

void BardinIMDRadCorPXSec::Configure ( string config )

virtual

Configure the algorithm from the AlgoConfigPool based on param_set string given in input An algorithm contains a vector of registries coming from different xml configuration files, which are loaded according a very precise prioriy This methods will load a number registries in order of priority: 1) "Tunable" parameter set from CommonParametes. This is loaded with the highest prioriry and it is designed to be used for tuning procedure Usage not expected from the user. 2) For every string defined in "CommonParame" the corresponding parameter set will be loaded from CommonParameter.xml 3) parameter set specified by the config string and defined in the xml file of the algorithm 4) if config is not "Default" also the Default parameter set from the same xml file will be loaded Effectively this avoids the repetion of a parameter when it is not changed in the requested configuration

Reimplemented from genie::Algorithm.

Definition at line 260 of file BardinIMDRadCorPXSec.cxx.

 {
   Algorithm::Configure(param_set);
   this->LoadConfig();
 }

double BardinIMDRadCorPXSec::Fa	(	double	re,
		double	r,
		double	y
	)		const

private

Definition at line 111 of file BardinIMDRadCorPXSec.cxx.

 {
   double y2  = y * y;
   double rre = r * re;
   double r_y = r/y;
   double y_r = y/r;
 
   double fa = 0;
 
   fa = (1-r) *       ( TMath::Log(y2/rre) * TMath::Log(1-r_y) +
                        TMath::Log(y_r) * TMath::Log(1-y) -
                        this->Li2( r ) +
                        this->Li2( y ) +
                        this->Li2( (r-y) / (1-y) ) +
                        1.5 * (1-r) * TMath::Log(1-r)
                      )
                      +
 
        0.5*(1+3*r) * ( this->Li2( (1-r_y) / (1-r) ) -
                        this->Li2( (y-r)   / (1-r) ) -
                        TMath::Log(y_r) * TMath::Log( (y-r) / (1-r) )
                      )
                      +
 
        this->P(1,r,y)                   -
        this->P(2,r,y) * TMath::Log(r)   -
        this->P(3,r,y) * TMath::Log(re)  +
        this->P(4,r,y) * TMath::Log(y)   +
        this->P(5,r,y) * TMath::Log(1-y) +
        this->P(6,r,y) * (1 - r_y) * TMath::Log(1-r_y);
 
   return fa;
 }

double BardinIMDRadCorPXSec::Integral ( const Interaction * i ) const

virtual

Integrate the model over the kinematic phase space available to the input interaction (kinematical cuts can be included)

Implements genie::XSecAlgorithmI.

Definition at line 99 of file BardinIMDRadCorPXSec.cxx.

 {
   double xsec = fXSecIntegrator->Integrate(this,interaction);
   return xsec;
 }

double BardinIMDRadCorPXSec::Li2 ( double z ) const

private

Definition at line 158 of file BardinIMDRadCorPXSec.cxx.

 {
   double epsilon = 1e-2;
   double tmin = epsilon;
   double tmax = 1. - epsilon;
 
 #ifdef __GENIE_LOW_LEVEL_MESG_ENABLED__
   LOG("BardinIMD", pDEBUG)
     << "Summing BardinIMDRadCorIntegrand in [" << tmin<< ", " << tmax<< "]";
 #endif
 
   ROOT::Math::IBaseFunctionOneDim * integrand = new
           utils::gsl::wrap::BardinIMDRadCorIntegrand(z);
   ROOT::Math::IntegrationOneDim::Type ig_type =
           utils::gsl::Integration1DimTypeFromString("adaptive");
 
   double abstol   = 1;    // We mostly care about relative tolerance
   double reltol   = 1E-4;
   int    nmaxeval = 100000;
   ROOT::Math::Integrator ig(*integrand,ig_type,abstol,reltol,nmaxeval);
   double li2 = ig.Integral(tmin, tmax);
 
 #ifdef __GENIE_LOW_LEVEL_MESG_ENABLED__
   LOG("BardinIMD", pDEBUG) << "Li2(z = " << z << ")" << li2;
 #endif
 
   delete integrand;
 
   return li2;
 }

void BardinIMDRadCorPXSec::LoadConfig ( void )

private

Definition at line 266 of file BardinIMDRadCorPXSec.cxx.

 {
   ////fIntegrator =
 ////      dynamic_cast<const IntegratorI *> (this->SubAlg("Integrator"));
 /////  assert(fIntegrator);
 
   fXSecIntegrator =
       dynamic_cast<const XSecIntegratorI *> (this->SubAlg("XSec-Integrator"));
   assert(fXSecIntegrator);
 }

double BardinIMDRadCorPXSec::P	(	int	i,
		double	r,
		double	y
	)		const

private

Definition at line 145 of file BardinIMDRadCorPXSec.cxx.

 {
   int kmin = -3;
   int kmax =  2;
   double p = 0;
   for(int k = kmin; k <= kmax; k++) {
      double c  = this->C(i,k,r);
      double yk = TMath::Power(y,k);
      p += (c*yk);
   }
   return p;
 }

bool BardinIMDRadCorPXSec::ValidProcess ( const Interaction * i ) const

virtual

Can this cross section algorithm handle the input process?

Implements genie::XSecAlgorithmI.

Definition at line 105 of file BardinIMDRadCorPXSec.cxx.

 {
   if(interaction->TestBit(kISkipProcessChk)) return true;
   return true;
 }

double BardinIMDRadCorPXSec::XSec	(	const Interaction *	i,
		KinePhaseSpace_t	k
	)		const

virtual

Compute the cross section for the input interaction.

Implements genie::XSecAlgorithmI.

Definition at line 44 of file BardinIMDRadCorPXSec.cxx.

 {
   if(! this -> ValidProcess    (interaction) ) return 0.;
   if(! this -> ValidKinematics (interaction) ) return 0.;
 
   const InitialState & init_state = interaction -> InitState();
 
   double E    = init_state.ProbeE(kRfLab);
   double sig0 = kGF2 * kElectronMass * E / kPi;
   double re   = 0.5 * kElectronMass / E;
   double r    = (kMuonMass2 / kElectronMass2) * re;
   double y    = interaction->Kine().y();
 
   y = 1-y;  //Note: y = (Ev-El)/Ev but in Bardin's paper y=El/Ev.
 
   double ymin = r + re;
   double ymax = 1 + re + r*re / (1+re);
 
   double e = 1E-5;
   ymax = TMath::Min(ymax,1-e); // avoid ymax=1, due to a log(1-y)
 
 #ifdef __GENIE_LOW_LEVEL_MESG_ENABLED__
   LOG("BardinIMD", pDEBUG)
            << "sig0 = " << sig0 << ", r = " << r << ", re = " << re;
   LOG("BardinIMD", pDEBUG)
                    << "allowed y: [" << ymin << ", " << ymax << "]";
 #endif
 
   if(y<ymin || y>ymax) return 0;
 
   double xsec = 2 * sig0 * ( 1 - r + (kAem/kPi) * Fa(re,r,y) );
 
 #ifdef __GENIE_LOW_LEVEL_MESG_ENABLED__
   LOG("BardinIMD", pINFO)
      << "dxsec[1-loop]/dy (Ev = " << E << ", y = " << y << ") = " << xsec;
 #endif
 
   // The algorithm computes dxsec/dy
   // Check whether variable tranformation is needed
   if(kps!=kPSyfE) {
     double J = utils::kinematics::Jacobian(interaction,kPSyfE,kps);
     xsec *= J;
   }
 
   // If requested return the free electron xsec even for nuclear target
   if( interaction->TestBit(kIAssumeFreeElectron) ) return xsec;
 
   // Scale for the number of scattering centers at the target
   int Ne = init_state.Tgt().Z(); // num of scattering centers
   xsec *= Ne;
 
   return xsec;
 }

Member Data Documentation

const XSecIntegratorI* genie::BardinIMDRadCorPXSec::fXSecIntegrator

private

differential x-sec integrator

Definition at line 70 of file BardinIMDRadCorPXSec.h.

The documentation for this class was generated from the following files:

Generator/src/Physics/NuElectron/XSection/BardinIMDRadCorPXSec.h
Generator/src/Physics/NuElectron/XSection/BardinIMDRadCorPXSec.cxx

Public Member Functions

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation