[819] | 1 | // |
---|
| 2 | // ******************************************************************** |
---|
| 3 | // * License and Disclaimer * |
---|
| 4 | // * * |
---|
| 5 | // * The Geant4 software is copyright of the Copyright Holders of * |
---|
| 6 | // * the Geant4 Collaboration. It is provided under the terms and * |
---|
| 7 | // * conditions of the Geant4 Software License, included in the file * |
---|
| 8 | // * LICENSE and available at http://cern.ch/geant4/license . These * |
---|
| 9 | // * include a list of copyright holders. * |
---|
| 10 | // * * |
---|
| 11 | // * Neither the authors of this software system, nor their employing * |
---|
| 12 | // * institutes,nor the agencies providing financial support for this * |
---|
| 13 | // * work make any representation or warranty, express or implied, * |
---|
| 14 | // * regarding this software system or assume any liability for its * |
---|
| 15 | // * use. Please see the license in the file LICENSE and URL above * |
---|
| 16 | // * for the full disclaimer and the limitation of liability. * |
---|
| 17 | // * * |
---|
| 18 | // * This code implementation is the result of the scientific and * |
---|
| 19 | // * technical work of the GEANT4 collaboration. * |
---|
| 20 | // * By using, copying, modifying or distributing the software (or * |
---|
| 21 | // * any work based on the software) you agree to acknowledge its * |
---|
| 22 | // * use in resulting scientific publications, and indicate your * |
---|
| 23 | // * acceptance of all terms of the Geant4 Software license. * |
---|
| 24 | // ******************************************************************** |
---|
| 25 | // |
---|
| 26 | // |
---|
[1192] | 27 | // $Id: G4LinInterpolation.cc,v 1.5 2009/09/25 07:41:34 sincerti Exp $ |
---|
[1228] | 28 | // GEANT4 tag $Name: geant4-09-03 $ |
---|
[819] | 29 | // |
---|
| 30 | // Author: Maria Grazia Pia (Maria.Grazia.Pia@cern.ch) |
---|
| 31 | // |
---|
| 32 | // History: |
---|
| 33 | // ----------- |
---|
| 34 | // 31 Jul 2001 MGP Created |
---|
[1192] | 35 | // 14 JUn 2009 NAK New Calculation method implemented to which logarithmic values |
---|
| 36 | // from the G4EMLOW dataset are loaded directly to enhance performance |
---|
[819] | 37 | // |
---|
| 38 | // ------------------------------------------------------------------- |
---|
| 39 | |
---|
| 40 | #include "G4LinInterpolation.hh" |
---|
| 41 | |
---|
| 42 | // Constructor |
---|
| 43 | |
---|
| 44 | G4LinInterpolation::G4LinInterpolation() |
---|
| 45 | { } |
---|
| 46 | |
---|
| 47 | // Destructor |
---|
| 48 | |
---|
| 49 | G4LinInterpolation::~G4LinInterpolation() |
---|
| 50 | { } |
---|
| 51 | |
---|
| 52 | |
---|
| 53 | G4VDataSetAlgorithm* G4LinInterpolation::Clone() const |
---|
| 54 | { return new G4LinInterpolation; } |
---|
| 55 | |
---|
| 56 | G4double G4LinInterpolation::Calculate(G4double x, G4int bin, |
---|
| 57 | const G4DataVector& points, |
---|
| 58 | const G4DataVector& data) const |
---|
| 59 | { |
---|
[1192] | 60 | //G4cout << "G4LinInterpolation is performed (2 arguments)" << G4endl; |
---|
[819] | 61 | G4int nBins = data.size() - 1; |
---|
| 62 | G4double value = 0.; |
---|
| 63 | if (x < points[0]) |
---|
| 64 | { |
---|
| 65 | value = 0.; |
---|
| 66 | } |
---|
| 67 | else if (bin < nBins) |
---|
| 68 | { |
---|
| 69 | G4double e1 = points[bin]; |
---|
| 70 | G4double e2 = points[bin+1]; |
---|
| 71 | G4double d1 = data[bin]; |
---|
| 72 | G4double d2 = data[bin+1]; |
---|
| 73 | value = d1 + (d2 - d1)*(x - e1)/(e2 - e1); |
---|
| 74 | } |
---|
| 75 | else |
---|
| 76 | { |
---|
| 77 | value = data[nBins]; |
---|
| 78 | } |
---|
| 79 | return value; |
---|
| 80 | } |
---|
[1192] | 81 | |
---|
| 82 | |
---|
| 83 | //Nicolas A. Karakatsanis: New Calculation method implemented to which logarithmic values |
---|
| 84 | // from the G4EMLOW dataset are loaded directly to enhance performance |
---|
| 85 | |
---|
| 86 | G4double G4LinInterpolation::Calculate(G4double x, G4int bin, |
---|
| 87 | const G4DataVector& points, |
---|
| 88 | const G4DataVector& data, |
---|
| 89 | const G4DataVector& log_points, |
---|
| 90 | const G4DataVector& log_data) const |
---|
| 91 | { |
---|
| 92 | //Linear Interpolation is performed on loagarithmic data set |
---|
| 93 | //Equivalent to log-log interpolation on non-loagarithmic data set |
---|
| 94 | //G4cout << "G4LinInterpolation is performed - (4 arguments)" << G4endl; |
---|
| 95 | G4int nBins = data.size() - 1; |
---|
| 96 | G4double value = 0.; |
---|
| 97 | G4double log_x = std::log10(x); |
---|
| 98 | if (x < points[0]) |
---|
| 99 | { |
---|
| 100 | value = 0.; |
---|
| 101 | } |
---|
| 102 | else if (bin < nBins) |
---|
| 103 | { |
---|
| 104 | G4double log_e1 = log_points[bin]; |
---|
| 105 | G4double log_e2 = log_points[bin+1]; |
---|
| 106 | G4double log_d1 = log_data[bin]; |
---|
| 107 | G4double log_d2 = log_data[bin+1]; |
---|
| 108 | |
---|
| 109 | // Values e1, e2, d1 and d2 are the log values of the corresponding |
---|
| 110 | // original energy and data values. Simple linear interpolation performed |
---|
| 111 | // on loagarithmic data should be equivalent to log-log interpolation |
---|
| 112 | value = log_d1 + (log_d2 - log_d1)*(log_x - log_e1)/(log_e2 - log_e1); |
---|
| 113 | |
---|
| 114 | // Delogarithmize to obtain interpolated value |
---|
| 115 | value = std::pow(10.,value); |
---|
| 116 | } |
---|
| 117 | else |
---|
| 118 | { |
---|
| 119 | value = data[nBins]; |
---|
| 120 | } |
---|
| 121 | return value; |
---|
| 122 | } |
---|