| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer 3 // * License and Disclaimer *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th 5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided 6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License 7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/ 8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. 9 // * include a list of copyright holders. *
10 // * 10 // * *
11 // * Neither the authors of this software syst 11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file 15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitatio 16 // * for the full disclaimer and the limitation of liability. *
17 // * 17 // * *
18 // * This code implementation is the result 18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboratio 19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distri 20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you ag 21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publicati 22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Sof 23 // * acceptance of all terms of the Geant4 Software license. *
24 // ******************************************* 24 // ********************************************************************
25 // 25 //
26 // 26 //
27 // Author: Vladimir Ivanchenko 27 // Author: Vladimir Ivanchenko
28 // 28 //
29 // History: 29 // History:
30 // -------- 30 // --------
31 // 31 May 2011 V.Ivanchenko Created 31 // 31 May 2011 V.Ivanchenko Created
32 // 09 Mar 2012 L.Pandola update methods 32 // 09 Mar 2012 L.Pandola update methods
33 // 33 //
34 // 34 //
35 35
36 #include "G4LivermoreIonisationCrossSection.hh 36 #include "G4LivermoreIonisationCrossSection.hh"
37 #include "G4SystemOfUnits.hh" 37 #include "G4SystemOfUnits.hh"
38 #include "G4AtomicTransitionManager.hh" 38 #include "G4AtomicTransitionManager.hh"
39 #include "G4VCrossSectionHandler.hh" 39 #include "G4VCrossSectionHandler.hh"
40 #include "G4eCrossSectionHandler.hh" 40 #include "G4eCrossSectionHandler.hh"
41 #include "G4SemiLogInterpolation.hh" 41 #include "G4SemiLogInterpolation.hh"
42 42
43 //....oooOO0OOooo........oooOO0OOooo........oo 43 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
44 44
45 45
46 G4LivermoreIonisationCrossSection::G4Livermore 46 G4LivermoreIonisationCrossSection::G4LivermoreIonisationCrossSection(
47 const G4String& nam) : G4VhShellCrossSection 47 const G4String& nam) : G4VhShellCrossSection(nam), crossSectionHandler(nullptr)
48 { 48 {
49 fLowEnergyLimit = 10.0*eV; 49 fLowEnergyLimit = 10.0*eV;
50 fHighEnergyLimit = 100.0*GeV; 50 fHighEnergyLimit = 100.0*GeV;
51 51
52 transitionManager = G4AtomicTransitionManage 52 transitionManager = G4AtomicTransitionManager::Instance();
53 verboseLevel = 0; 53 verboseLevel = 0;
54 54
55 Initialise(); 55 Initialise();
56 } 56 }
57 57
58 //....oooOO0OOooo........oooOO0OOooo........oo 58 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
59 59
60 G4LivermoreIonisationCrossSection::~G4Livermor 60 G4LivermoreIonisationCrossSection::~G4LivermoreIonisationCrossSection()
61 { 61 {
62 delete crossSectionHandler; 62 delete crossSectionHandler;
63 } 63 }
64 64
65 //....oooOO0OOooo........oooOO0OOooo........oo 65 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
66 66
67 void G4LivermoreIonisationCrossSection::Initia 67 void G4LivermoreIonisationCrossSection::Initialise()
68 { 68 {
69 const G4int binForFluo = 20; 69 const G4int binForFluo = 20;
70 G4int nbin = G4int(std::log10(fHighEnergyLim 70 G4int nbin = G4int(std::log10(fHighEnergyLimit/fLowEnergyLimit) + 0.5);
71 if(nbin <= 0) { nbin = 1; } 71 if(nbin <= 0) { nbin = 1; }
72 nbin *= binForFluo; 72 nbin *= binForFluo;
73 73
74 // Data on shell ionisation x-sections 74 // Data on shell ionisation x-sections
75 if (crossSectionHandler) { 75 if (crossSectionHandler) {
76 crossSectionHandler->Clear(); 76 crossSectionHandler->Clear();
77 delete crossSectionHandler; 77 delete crossSectionHandler;
78 } 78 }
79 79
80 G4VDataSetAlgorithm* inter = new G4SemiLogIn 80 G4VDataSetAlgorithm* inter = new G4SemiLogInterpolation();
81 crossSectionHandler = 81 crossSectionHandler =
82 new G4eCrossSectionHandler(inter,fLowEnerg 82 new G4eCrossSectionHandler(inter,fLowEnergyLimit,fHighEnergyLimit,nbin);
83 crossSectionHandler->LoadShellData("ioni/ion 83 crossSectionHandler->LoadShellData("ioni/ion-ss-cs-");
84 //G4cout << "!!! G4LivermoreIonisationCross 84 //G4cout << "!!! G4LivermoreIonisationCrossSection::Initialise()" << G4endl;
85 } 85 }
86 86
87 G4double 87 G4double
88 G4LivermoreIonisationCrossSection::CrossSectio 88 G4LivermoreIonisationCrossSection::CrossSection(G4int Z, G4AtomicShellEnumerator shell,
89 G4double kinEnergy, G4double, 89 G4double kinEnergy, G4double,
90 const G4Material*) 90 const G4Material*)
91 { 91 {
92 G4double cross = 0.0; 92 G4double cross = 0.0;
93 G4int n = G4int(shell); 93 G4int n = G4int(shell);
94 G4int nmax = std::min(9,transitionManager->N 94 G4int nmax = std::min(9,transitionManager->NumberOfShells(Z));
95 if(Z > 6 && Z < 93 && n < nmax && 95 if(Z > 6 && Z < 93 && n < nmax &&
96 kinEnergy >= fLowEnergyLimit && kinEnergy 96 kinEnergy >= fLowEnergyLimit && kinEnergy <= fHighEnergyLimit) {
97 cross = crossSectionHandler->FindValue(Z, 97 cross = crossSectionHandler->FindValue(Z, kinEnergy, n);
98 } 98 }
99 return cross; 99 return cross;
100 } 100 }
101 101
102 //....oooOO0OOooo........oooOO0OOooo........oo 102 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
103 103
104 std::vector<G4double> 104 std::vector<G4double>
105 G4LivermoreIonisationCrossSection::GetCrossSec 105 G4LivermoreIonisationCrossSection::GetCrossSection(G4int Z,
106 G4double kinEnergy, 106 G4double kinEnergy,
107 G4double, G4double, 107 G4double, G4double,
108 const G4Material*) 108 const G4Material*)
109 { 109 {
110 G4int nmax = std::min(9,transitionManager->N 110 G4int nmax = std::min(9,transitionManager->NumberOfShells(Z));
111 std::vector<G4double> vec(nmax,0.0); 111 std::vector<G4double> vec(nmax,0.0);
112 for(G4int i=0; i<nmax; ++i) { 112 for(G4int i=0; i<nmax; ++i) {
113 vec[i] = CrossSection(Z, G4AtomicShellEnum 113 vec[i] = CrossSection(Z, G4AtomicShellEnumerator(i), kinEnergy);
114 } 114 }
115 return vec; 115 return vec;
116 } 116 }
117 117
118 //....oooOO0OOooo........oooOO0OOooo........oo 118 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
119 119
120 std::vector<G4double> 120 std::vector<G4double>
121 G4LivermoreIonisationCrossSection::Probabiliti 121 G4LivermoreIonisationCrossSection::Probabilities(G4int Z,
122 G4double kinEnergy, 122 G4double kinEnergy,
123 G4double, 123 G4double,
124 G4double, 124 G4double,
125 const G4Material*) 125 const G4Material*)
126 { 126 {
127 std::vector<G4double> vec = GetCrossSection( 127 std::vector<G4double> vec = GetCrossSection(Z, kinEnergy);
128 size_t n = vec.size(); 128 size_t n = vec.size();
129 size_t i; 129 size_t i;
130 G4double sum = 0.0; 130 G4double sum = 0.0;
131 for(i=0; i<n; ++i) { sum += vec[i]; } 131 for(i=0; i<n; ++i) { sum += vec[i]; }
132 if(sum > 0.0) { 132 if(sum > 0.0) {
133 sum = 1.0/sum; 133 sum = 1.0/sum;
134 for(i=0; i<n; ++i) { vec[i] = vec[i]*sum; 134 for(i=0; i<n; ++i) { vec[i] = vec[i]*sum; }
135 } 135 }
136 return vec; 136 return vec;
137 } 137 }
138 138
139 //....oooOO0OOooo........oooOO0OOooo........oo 139 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo....
140 140