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