290 lines
8.9 KiB
Plaintext
290 lines
8.9 KiB
Plaintext
//
|
|
// ********************************************************************
|
|
// * License and Disclaimer *
|
|
// * *
|
|
// * The Geant4 software is copyright of the Copyright Holders of *
|
|
// * the Geant4 Collaboration. It is provided under the terms and *
|
|
// * conditions of the Geant4 Software License, included in the file *
|
|
// * LICENSE and available at http://cern.ch/geant4/license . These *
|
|
// * include a list of copyright holders. *
|
|
// * *
|
|
// * Neither the authors of this software system, nor their employing *
|
|
// * institutes,nor the agencies providing financial support for this *
|
|
// * work make any representation or warranty, express or implied, *
|
|
// * regarding this software system or assume any liability for its *
|
|
// * use. Please see the license in the file LICENSE and URL above *
|
|
// * for the full disclaimer and the limitation of liability. *
|
|
// * *
|
|
// * This code implementation is the result of the scientific and *
|
|
// * technical work of the GEANT4 collaboration. *
|
|
// * By using, copying, modifying or distributing the software (or *
|
|
// * any work based on the software) you agree to acknowledge its *
|
|
// * use in resulting scientific publications, and indicate your *
|
|
// * acceptance of all terms of the Geant4 Software license. *
|
|
// ********************************************************************
|
|
//
|
|
//
|
|
//
|
|
//
|
|
//---------------------------------------------------------------
|
|
// GEANT 4 class source file
|
|
//
|
|
// G4PhysicsVector.icc
|
|
//
|
|
// Description:
|
|
// A physics vector which has values of energy-loss, cross-section,
|
|
// and other physics values of a particle in matter in a given
|
|
// range of the energy, momentum, etc.
|
|
// This class serves as the base class for a vector having various
|
|
// energy scale, for example like 'log', 'linear', 'free', etc.
|
|
//
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::operator[](const size_t index) const
|
|
{
|
|
return dataVector[index];
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::operator()(const size_t index) const
|
|
{
|
|
return dataVector[index];
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::Energy(const size_t index) const
|
|
{
|
|
return binVector[index];
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::GetMaxEnergy() const
|
|
{
|
|
return edgeMax;
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
size_t G4PhysicsVector::GetVectorLength() const
|
|
{
|
|
return numberOfNodes;
|
|
}
|
|
|
|
//------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::LinearInterpolation(size_t idx, G4double e) const
|
|
{
|
|
// Linear interpolation is used to get the value. Before this method
|
|
// is called it is ensured that the energy is inside the bin
|
|
// 0 < idx < numberOfNodes-1
|
|
|
|
return dataVector[idx] +
|
|
( dataVector[idx + 1]-dataVector[idx] ) * (e - binVector[idx])
|
|
/( binVector[idx + 1]-binVector[idx] );
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::SplineInterpolation(size_t idx, G4double e) const
|
|
{
|
|
// Spline interpolation is used to get the value. Before this method
|
|
// is called it is ensured that the energy is inside the bin
|
|
// 0 < idx < numberOfNodes-1
|
|
|
|
static const G4double onesixth = 1.0/6.0;
|
|
|
|
// check bin value
|
|
G4double x1 = binVector[idx];
|
|
G4double x2 = binVector[idx + 1];
|
|
G4double delta = x2 - x1;
|
|
|
|
G4double a = (x2 - e)/delta;
|
|
G4double b = (e - x1)/delta;
|
|
|
|
// Final evaluation of cubic spline polynomial for return
|
|
G4double y1 = dataVector[idx];
|
|
G4double y2 = dataVector[idx + 1];
|
|
|
|
G4double res = a*y1 + b*y2 +
|
|
( (a*a*a - a)*secDerivative[idx] +
|
|
(b*b*b - b)*secDerivative[idx + 1] )*delta*delta*onesixth;
|
|
|
|
return res;
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::Interpolation(size_t idx, G4double e) const
|
|
{
|
|
return useSpline ? SplineInterpolation(idx, e) : LinearInterpolation(idx, e);
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
void G4PhysicsVector::PutValue(size_t index, G4double theValue)
|
|
{
|
|
if(index >= numberOfNodes) { PrintPutValueError(index); }
|
|
dataVector[index] = theValue;
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4bool G4PhysicsVector::IsFilledVectorExist() const
|
|
{
|
|
return (numberOfNodes > 0) ? true : false;
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4PhysicsVectorType G4PhysicsVector::GetType() const
|
|
{
|
|
return type;
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
// Flag useSpline is "true" only if second derivatives are filled
|
|
inline
|
|
void G4PhysicsVector::SetSpline(G4bool val)
|
|
{
|
|
if(val) {
|
|
if(0 == secDerivative.size() && 0 < dataVector.size()) {
|
|
FillSecondDerivatives();
|
|
}
|
|
} else {
|
|
useSpline = false;
|
|
secDerivative.clear();
|
|
}
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
void G4PhysicsVector::SetVerboseLevel(G4int value)
|
|
{
|
|
verboseLevel = value;
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
/*
|
|
inline
|
|
G4int G4PhysicsVector::GetVerboseLevel() const
|
|
{
|
|
return verboseLevel;
|
|
}
|
|
*/
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
size_t G4PhysicsVector::FindBinLocation(G4double theEnergy) const
|
|
{
|
|
size_t bin;
|
|
if(type == T_G4PhysicsLogVector) {
|
|
bin = size_t(G4Log(theEnergy)*invdBin - baseBin);
|
|
if(bin > 0 && theEnergy < binVector[bin]) { --bin; }
|
|
else if(theEnergy > binVector[bin+1]) { ++bin; }
|
|
} else if(type == T_G4PhysicsLinearVector) {
|
|
bin = size_t( theEnergy*invdBin - baseBin );
|
|
if(bin > 0 && theEnergy < binVector[bin]) { --bin; }
|
|
else if(theEnergy > binVector[bin+1]) { ++bin; }
|
|
} else {
|
|
// Bin location proposed by K.Genser (FNAL)
|
|
bin = std::lower_bound(binVector.begin(), binVector.end(), theEnergy)
|
|
- binVector.begin() - 1;
|
|
}
|
|
return std::min(bin, numberOfNodes-2);
|
|
}
|
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline size_t G4PhysicsVector::FindBin(G4double e, size_t idx) const
|
|
{
|
|
size_t id = idx;
|
|
if(e < binVector[1]) {
|
|
id = 0;
|
|
} else if(e >= binVector[numberOfNodes-2]) {
|
|
id = numberOfNodes - 2;
|
|
} else if(idx >= numberOfNodes-2 || e < binVector[idx]
|
|
|| e > binVector[idx+1]) {
|
|
id = FindBinLocation(e);
|
|
}
|
|
return id;
|
|
}
|
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
size_t G4PhysicsVector::ComputeLogVectorBin(const G4double loge) const
|
|
{
|
|
return size_t(std::max(0., std::min(loge*invdBin-baseBin, numberOfNodes-2.)));
|
|
}
|
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::Value(G4double theEnergy) const
|
|
{
|
|
size_t idx=0;
|
|
return Value(theEnergy, idx);
|
|
}
|
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
inline
|
|
G4double G4PhysicsVector::GetValue(G4double theEnergy, G4bool&) const
|
|
{
|
|
size_t idx=0;
|
|
return Value(theEnergy, idx);
|
|
}
|
|
|
|
//---------------------------------------------------------------
|
|
inline
|
|
G4double G4PhysicsVector::LogVectorValue(const G4double theEnergy,
|
|
const G4double theLogEnergy) const
|
|
{
|
|
// handle cases below/above the enrgy grid (by ek, idx that gives b=0/1)
|
|
// ek = x[0] if e<=x[0] and idx will be 0 ^ b=0 => so y=y0
|
|
// ek = x[N-1] if e>=x[N-1] and idx will be N-2 ^ b=1 => so y=y_{N-1}
|
|
const G4double ek = std::max(binVector[0],
|
|
std::min(binVector[numberOfNodes-1], theEnergy));
|
|
// compute the lowerindex of the bin (idx \in [0,N-2] will be guaranted)
|
|
const size_t idx = ComputeLogVectorBin(theLogEnergy);
|
|
// perform the interpolation
|
|
const G4double x1 = binVector[idx];
|
|
const G4double x2 = binVector[idx+1];
|
|
const G4double dl = x2-x1;
|
|
// note: all corner cases of the previous methods are covered and eventually
|
|
// gives b=0/1 that results in y=y0\y_{N-1} if e<=x[0]/e>=x[N-1] or
|
|
// y=y_i/y_{i+1} if e<x[i]/e>=x[i+1] due to small numerical errors
|
|
const G4double b = std::max(0., std::min(1., (ek - x1)/dl));
|
|
if (useSpline) { // spline interpolation
|
|
const G4double os = 0.166666666667; // 1./6.
|
|
const G4double a = 1.0 - b;
|
|
const G4double c0 = (a*a*a-a)*secDerivative[idx];
|
|
const G4double c1 = (b*b*b-b)*secDerivative[idx+1];
|
|
return a*dataVector[idx] + b*dataVector[idx+1] + (c0+c1)*dl*dl*os;
|
|
} else { // linear interpolation
|
|
const G4double y1 = dataVector[idx];
|
|
const G4double y2 = dataVector[idx+1];
|
|
return y1 + b*(y2-y1);
|
|
}
|
|
}
|