| Geant4 Cross Reference |
1 // 1
2 // *******************************************
3 // * License and Disclaimer
4 // *
5 // * The Geant4 software is copyright of th
6 // * the Geant4 Collaboration. It is provided
7 // * conditions of the Geant4 Software License
8 // * LICENSE and available at http://cern.ch/
9 // * include a list of copyright holders.
10 // *
11 // * Neither the authors of this software syst
12 // * institutes,nor the agencies providing fin
13 // * work make any representation or warran
14 // * regarding this software system or assum
15 // * use. Please see the license in the file
16 // * for the full disclaimer and the limitatio
17 // *
18 // * This code implementation is the result
19 // * technical work of the GEANT4 collaboratio
20 // * By using, copying, modifying or distri
21 // * any work based on the software) you ag
22 // * use in resulting scientific publicati
23 // * acceptance of all terms of the Geant4 Sof
24 // *******************************************
25 //
26
27 #include "G4AdjointInterpolator.hh"
28
29 G4ThreadLocal G4AdjointInterpolator* G4Adjoint
30
31 //////////////////////////////////////////////
32 G4AdjointInterpolator* G4AdjointInterpolator::
33 {
34 return GetInstance();
35 }
36
37 //////////////////////////////////////////////
38 G4AdjointInterpolator* G4AdjointInterpolator::
39 {
40 if(!fInstance)
41 {
42 fInstance = new G4AdjointInterpolator;
43 }
44 return fInstance;
45 }
46
47 //////////////////////////////////////////////
48 G4AdjointInterpolator::G4AdjointInterpolator()
49
50 //////////////////////////////////////////////
51 G4AdjointInterpolator::~G4AdjointInterpolator(
52
53 //////////////////////////////////////////////
54 G4double G4AdjointInterpolator::LinearInterpol
55
56
57 {
58 G4double res = y1 + (x - x1) * (y2 - y1) / (
59 return res;
60 }
61
62 //////////////////////////////////////////////
63 G4double G4AdjointInterpolator::LogarithmicInt
64 G4double& x, G4double& x1, G4double& x2, G4d
65 {
66 if(y1 <= 0. || y2 <= 0. || x1 <= 0.)
67 return LinearInterpolation(x, x1, x2, y1,
68 G4double B = std::log(y2 / y1) / std::log(
69 G4double A = y1 / std::pow(x1, B);
70 G4double res = A * std::pow(x, B);
71 return res;
72 }
73
74 //////////////////////////////////////////////
75 G4double G4AdjointInterpolator::ExponentialInt
76 G4double& x, G4double& x1, G4double& x2, G4d
77 {
78 G4double B = (std::log(y2) - std::log(y1))
79 G4double A = y1 * std::exp(-B * x1);
80 G4double res = A * std::exp(B * x);
81 return res;
82 }
83
84 //////////////////////////////////////////////
85 G4double G4AdjointInterpolator::Interpolation(
86
87
88
89 {
90 if(InterPolMethod == "Log")
91 {
92 return LogarithmicInterpolation(x, x1, x2,
93 }
94 else if(InterPolMethod == "Lin")
95 {
96 return LinearInterpolation(x, x1, x2, y1,
97 }
98 else if(InterPolMethod == "Exp")
99 {
100 return ExponentialInterpolation(x, x1, x2,
101 }
102 else
103 {
104 G4ExceptionDescription ed;
105 ed << "The interpolation method that you i
106 G4Exception("G4AdjointInterpolator::Interp
107 FatalException, ed);
108 return 0.;
109 }
110 }
111
112 //////////////////////////////////////////////
113 // only valid if x_vec is monotically increasi
114 std::size_t G4AdjointInterpolator::FindPositio
115 std
116 std
117 {
118 // most rapid method could be used probably
119
120 std::size_t ndim = x_vec.size();
121 std::size_t ind1 = 0;
122 std::size_t ind2 = ndim - 1;
123
124 if(ndim > 1)
125 {
126 if(x_vec[0] < x_vec[1])
127 { // increasing
128 do
129 {
130 std::size_t midBin = (ind1 + ind2) / 2
131 if(x < x_vec[midBin])
132 ind2 = midBin;
133 else
134 ind1 = midBin;
135 } while(ind2 - ind1 > 1);
136 }
137 else
138 {
139 do
140 {
141 std::size_t midBin = (ind1 + ind2) / 2
142 if(x < x_vec[midBin])
143 ind1 = midBin;
144 else
145 ind2 = midBin;
146 } while(ind2 - ind1 > 1);
147 }
148 }
149
150 return ind1;
151 }
152
153 //////////////////////////////////////////////
154 // only valid if x_vec is monotically increasi
155 std::size_t G4AdjointInterpolator::FindPositio
156 G4double& log_x, std::vector<G4double>& log_
157 {
158 // most rapid method could be used probably
159 return FindPosition(log_x, log_x_vec);
160 }
161
162 //////////////////////////////////////////////
163 G4double G4AdjointInterpolator::Interpolate(G4
164 st
165 st
166 co
167 {
168 std::size_t i = FindPosition(x, x_vec);
169 return Interpolation(x, x_vec[i], x_vec[i +
170 InterPolMethod);
171 }
172
173 //////////////////////////////////////////////
174 G4double G4AdjointInterpolator::InterpolateWit
175 G4double& x, std::vector<G4double>& x_vec, s
176 std::vector<std::size_t>& index_vec, G4doubl
177 G4double dx) // only linear interpolation p
178 {
179 std::size_t ind = 0;
180 if(x > x0)
181 ind = G4int((x - x0) / dx);
182 if(ind >= index_vec.size() - 1)
183 ind = index_vec.size() - 2;
184 std::size_t ind1 = index_vec[ind];
185 std::size_t ind2 = index_vec[ind + 1];
186 if(ind1 > ind2)
187 {
188 std::size_t ind11 = ind1;
189 ind1 = ind2;
190 ind2 = ind11;
191 }
192 ind = FindPosition(x, x_vec, ind1, ind2);
193 return Interpolation(x, x_vec[ind], x_vec[in
194 y_vec[ind + 1], "Lin");
195 }
196
197 //////////////////////////////////////////////
198 G4double G4AdjointInterpolator::InterpolateFor
199 G4double& log_x, std::vector<G4double>& log_
200 std::vector<G4double>& log_y_vec)
201 {
202 std::size_t i = FindPositionForLogVector(log
203
204 G4double log_y = LinearInterpolation(log_x,
205 log_y_v
206 return log_y;
207 }
208