| 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 // $Id: G4LinInterpolation.cc 66241 2012-12-13 18:34:42Z gunter $
27 // 28 //
28 // Author: Maria Grazia Pia (Maria.Grazia.Pia@ 29 // Author: Maria Grazia Pia (Maria.Grazia.Pia@cern.ch)
29 // 30 //
30 // History: 31 // History:
31 // ----------- 32 // -----------
32 // 31 Jul 2001 MGP Created 33 // 31 Jul 2001 MGP Created
33 // 14 JUn 2009 NAK New Calculation me 34 // 14 JUn 2009 NAK New Calculation method implemented to which logarithmic values
34 // from the G4EMLOW d 35 // from the G4EMLOW dataset are loaded directly to enhance performance
35 // 36 //
36 // ------------------------------------------- 37 // -------------------------------------------------------------------
37 38
38 #include "G4LinInterpolation.hh" 39 #include "G4LinInterpolation.hh"
39 40
40 // Constructor 41 // Constructor
41 // ------------------------------------------- << 42
42 G4LinInterpolation::G4LinInterpolation() 43 G4LinInterpolation::G4LinInterpolation()
43 { } 44 { }
44 45
45 // ------------------------------------------- <<
46 // Destructor 46 // Destructor
>> 47
47 G4LinInterpolation::~G4LinInterpolation() 48 G4LinInterpolation::~G4LinInterpolation()
48 { } 49 { }
49 50
50 // ------------------------------------------- << 51
51 G4VDataSetAlgorithm* G4LinInterpolation::Clone 52 G4VDataSetAlgorithm* G4LinInterpolation::Clone() const
52 { return new G4LinInterpolation; } 53 { return new G4LinInterpolation; }
53 54
54 // ------------------------------------------- <<
55 G4double G4LinInterpolation::Calculate(G4doubl 55 G4double G4LinInterpolation::Calculate(G4double x, G4int bin,
56 const G4DataVector& points, 56 const G4DataVector& points,
57 const G4DataVector& data) const 57 const G4DataVector& data) const
58 { 58 {
59 //G4cout << "G4LinInterpolation is performed 59 //G4cout << "G4LinInterpolation is performed (2 arguments)" << G4endl;
60 G4int nBins = G4int(data.size() - 1); << 60 G4int nBins = data.size() - 1;
61 G4double value = 0.; 61 G4double value = 0.;
62 if (x < points[0]) 62 if (x < points[0])
63 { 63 {
64 value = 0.; 64 value = 0.;
65 } 65 }
66 else if (bin < nBins) 66 else if (bin < nBins)
67 { 67 {
68 G4double e1 = points[bin]; 68 G4double e1 = points[bin];
69 G4double e2 = points[bin+1]; 69 G4double e2 = points[bin+1];
70 G4double d1 = data[bin]; 70 G4double d1 = data[bin];
71 G4double d2 = data[bin+1]; 71 G4double d2 = data[bin+1];
72 value = d1 + (d2 - d1)*(x - e1)/(e2 - e1 72 value = d1 + (d2 - d1)*(x - e1)/(e2 - e1);
73 } 73 }
74 else 74 else
75 { 75 {
76 value = data[nBins]; 76 value = data[nBins];
77 } 77 }
78 return value; 78 return value;
79 } 79 }
80 80
81 // ------------------------------------------- << 81
82 //Nicolas A. Karakatsanis: New Calculation met 82 //Nicolas A. Karakatsanis: New Calculation method implemented to which logarithmic values
83 // from the G4EMLOW da 83 // from the G4EMLOW dataset are loaded directly to enhance performance
84 84
85 G4double G4LinInterpolation::Calculate(G4doubl 85 G4double G4LinInterpolation::Calculate(G4double x, G4int bin,
86 const G4DataVector& points, 86 const G4DataVector& points,
87 const G 87 const G4DataVector& data,
88 const G 88 const G4DataVector& log_points,
89 const G4DataVector& log_data) c 89 const G4DataVector& log_data) const
90 { 90 {
91 //Linear Interpolation is performed on loagari 91 //Linear Interpolation is performed on loagarithmic data set
92 //Equivalent to log-log interpolation on non-l 92 //Equivalent to log-log interpolation on non-loagarithmic data set
93 //G4cout << "G4LinInterpolation is performed 93 //G4cout << "G4LinInterpolation is performed - (4 arguments)" << G4endl;
94 G4int nBins = G4int(data.size() - 1); << 94 G4int nBins = data.size() - 1;
95 G4double value = 0.; 95 G4double value = 0.;
96 G4double log_x = std::log10(x); 96 G4double log_x = std::log10(x);
97 if (x < points[0]) 97 if (x < points[0])
98 { 98 {
99 value = 0.; 99 value = 0.;
100 } 100 }
101 else if (bin < nBins) 101 else if (bin < nBins)
102 { 102 {
103 G4double log_e1 = log_points[bin]; 103 G4double log_e1 = log_points[bin];
104 G4double log_e2 = log_points[bin+1]; 104 G4double log_e2 = log_points[bin+1];
105 G4double log_d1 = log_data[bin]; 105 G4double log_d1 = log_data[bin];
106 G4double log_d2 = log_data[bin+1]; 106 G4double log_d2 = log_data[bin+1];
107 107
108 // Values e1, e2, d1 and d2 are the log values 108 // Values e1, e2, d1 and d2 are the log values of the corresponding
109 // original energy and data values. Simple lin 109 // original energy and data values. Simple linear interpolation performed
110 // on loagarithmic data should be equivalent t 110 // on loagarithmic data should be equivalent to log-log interpolation
111 value = log_d1 + (log_d2 - log_d1)*(log_ 111 value = log_d1 + (log_d2 - log_d1)*(log_x - log_e1)/(log_e2 - log_e1);
112 112
113 // Delogarithmize to obtain interpolated value 113 // Delogarithmize to obtain interpolated value
114 value = std::pow(10.,value); 114 value = std::pow(10.,value);
115 } 115 }
116 else 116 else
117 { 117 {
118 value = data[nBins]; 118 value = data[nBins];
119 } 119 }
120 return value; 120 return value;
121 } 121 }
122 122