/home/bes3soft/bes3soft/Boss/7.0.2/dist/7.0.2/Generator/BesEvtGen/BesEvtGen-00-03-58/src/EvtGen/EvtGenBase/EvtCGCoefSingle.cc

Go to the documentation of this file.

//--------------------------------------------------------------------------
//
// Environment:
//      This software is part of the EvtGen package developed jointly
//      for the BaBar and CLEO collaborations.  If you use all or part
//      of it, please give an appropriate acknowledgement.
//
// Copyright Information: See EvtGen/COPYRIGHT
//      Copyright (C) 2000      Caltech, UCSB
//
// Module: EvtCGCoefSingle.cc
//
// Description: Evaluates Clebsch-Gordon coef for fixed j1 and j2.
//
// Modification history:
//
//    fkw           February 2, 2001     changes to satisfy KCC
//    RYD            August 12, 2000         Module created
//
//------------------------------------------------------------------------
// 
#include "EvtGenBase/EvtPatches.hh"
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <assert.h>
#include "EvtGenBase/EvtCGCoefSingle.hh"
#include "EvtGenBase/EvtOrthogVector.hh"



EvtCGCoefSingle::~EvtCGCoefSingle(){
}


void EvtCGCoefSingle::init(int j1,int j2){

  _j1=j1;
  _j2=j2;

  _Jmax=abs(j1+j2);
  _Jmin=abs(j1-j2);

  _table.resize((_Jmax-_Jmin)/2+1);

  int J,M;

  int lenmax=j1+1;
  if (j2<j1) lenmax=j2+1;

  //set vector sizes
  for(J=_Jmax;J>=_Jmin;J-=2){
    _table[(J-_Jmin)/2].resize(J+1);
    for(M=J;J>=-M;M-=2){
      int len=((_j1+_j2)-abs(M))/2+1;
      if (len>lenmax) len=lenmax;
      _table[(J-_Jmin)/2][(M+J)/2].resize(len);
    }
  }

  //now fill the vectors
  for(J=_Jmax;J>=_Jmin;J-=2){
    //bootstrap with highest M(=J) as a special case
    if (J==_Jmax) {
      cg(J,J,_j1,_j2)=1.0;
    }else{
      int n=(_Jmax-J)/2+1;
      std::vector<double>* vectors=new std::vector<double>[n-1];
      int i,k;
      for(i=0;i<n-1;i++){
        // i corresponds to J=Jmax-2*i
        vectors[i].resize(n);
        for(k=0;k<n;k++){
          double tmp=_table[(_Jmax-_Jmin)/2-i][(J+_Jmax-2*i)/2][k];
          vectors[i][k]=tmp;
        }
      }
      EvtOrthogVector getOrth(n,vectors);
      std::vector<double> orth=getOrth.getOrthogVector();
      int sign=1;
      if (orth[n-1]<0.0) sign=-1;
      for(k=0;k<n;k++){
        _table[(J-_Jmin)/2][J][k]=sign*orth[k];
      }
      
    }
    for(M=J-2;M>=-J;M-=2){
      int len=((_j1+_j2)-abs(M))/2+1;
      if (len>lenmax) len=lenmax;
      int mmin=M-j2;
      if (mmin<-j1) mmin=-j1;
      int m1;
      for(m1=mmin;m1<mmin+len*2;m1+=2){
        int m2=M-m1;
        double sum=0.0;
        float fkwTmp = _j1*(_j1+2)-(m1+2)*m1;
        //fkw 2/2/2001: changes needed to satisfy KCC 
        //fkw if (m1+2<=_j1) sum+=0.5*sqrt(_j1*(_j1+2)-(m1+2)*m1)*cg(J,M+2,m1+2,m2);
        //fkw if (m2+2<=_j2) sum+=0.5*sqrt(_j2*(_j2+2)-(m2+2)*m2)*cg(J,M+2,m1,m2+2);
        //fkw sum/=(0.5*sqrt(J*(J+2)-(M+2)*M));
        if (m1+2<=_j1) sum+=0.5*sqrt(fkwTmp)*cg(J,M+2,m1+2,m2);
        fkwTmp = _j2*(_j2+2)-(m2+2)*m2;
        if (m2+2<=_j2) sum+=0.5*sqrt(fkwTmp)*cg(J,M+2,m1,m2+2);
        fkwTmp = J*(J+2)-(M+2)*M;
        sum/=(0.5*sqrt(fkwTmp));
        cg(J,M,m1,m2)=sum;
      }
    }
  }

  

}


double EvtCGCoefSingle::coef(int J,int M,int j1,int j2,int m1,int m2){

  assert(j1==_j1);
  assert(j2==_j2);

  return cg(J,M,m1,m2);

  
}


double& EvtCGCoefSingle::cg(int J,int M, int m1, int m2){

  assert(M==m1+m2);
  assert(abs(M)<=J);
  assert(J<=_Jmax);
  assert(J>=_Jmin);
  assert(abs(m1)<=_j1);
  assert(abs(m2)<=_j2);

  //find lowest m1 allowed for the given M

  int mmin=M-_j2;
  
  if (mmin<-_j1) mmin=-_j1;

  int n=m1-mmin;

  return _table[(J-_Jmin)/2][(M+J)/2][n/2];

}

---