source: trunk/source/processes/electromagnetic/adjoint/src/G4AdjointInterpolator.cc @ 1337

Last change on this file since 1337 was 1337, checked in by garnier, 14 years ago

tag geant4.9.4 beta 1 + modifs locales
File size: 7.6 KB
Line 
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// $Id: G4AdjointInterpolator.cc,v 1.4 2009/11/20 10:31:20 ldesorgh Exp $
27// GEANT4 tag $Name: geant4-09-04-beta-01 $
28//
29#include "G4AdjointCSMatrix.hh"
30#include "G4AdjointInterpolator.hh"
31
32G4AdjointInterpolator* G4AdjointInterpolator::theInstance = 0;
33///////////////////////////////////////////////////////
34//
35G4AdjointInterpolator* G4AdjointInterpolator::GetAdjointInterpolator()
36{ if(theInstance == 0) {
37    static G4AdjointInterpolator interpolator;
38     theInstance = &interpolator;
39  }
40 return theInstance; 
41}
42///////////////////////////////////////////////////////
43//
44G4AdjointInterpolator* G4AdjointInterpolator::GetInstance()
45{ if(theInstance == 0) {
46    static G4AdjointInterpolator interpolator;
47     theInstance = &interpolator;
48  }
49 return theInstance; 
50}
51
52///////////////////////////////////////////////////////
53//
54G4AdjointInterpolator::G4AdjointInterpolator()
55{;
56}
57///////////////////////////////////////////////////////
58//
59G4AdjointInterpolator::~G4AdjointInterpolator()
60{;
61}
62///////////////////////////////////////////////////////
63//
64G4double G4AdjointInterpolator::LinearInterpolation(G4double& x,G4double& x1,G4double& x2,G4double& y1,G4double& y2)
65{ G4double res = y1+ (x-x1)*(y2-y1)/(x2-x1);
66  //G4cout<<"Linear "<<res<<G4endl;
67  return res;   
68}
69///////////////////////////////////////////////////////
70//
71G4double G4AdjointInterpolator::LogarithmicInterpolation(G4double& x,G4double& x1,G4double& x2,G4double& y1,G4double& y2)
72{ if (y1<=0 || y2<=0 || x1<=0) return LinearInterpolation(x,x1,x2,y1,y2);
73  G4double B=std::log(y2/y1)/std::log(x2/x1);
74  //G4cout<<"x1,x2,y1,y2 "<<x1<<'\t'<<x2<<'\t'<<y1<<'\t'<<y2<<'\t'<<G4endl;
75  G4double A=y1/std::pow(x1,B);
76  G4double res=A*std::pow(x,B);
77 // G4cout<<"Log "<<res<<G4endl;
78  return res;
79}
80///////////////////////////////////////////////////////
81//
82G4double G4AdjointInterpolator::ExponentialInterpolation(G4double& x,G4double& x1,G4double& x2,G4double& y1,G4double& y2)
83{ G4double B=(std::log(y2)-std::log(y1));
84  B=B/(x2-x1);
85  G4double A=y1*std::exp(-B*x1);
86  G4double res=A*std::exp(B*x);
87  return res;
88}
89///////////////////////////////////////////////////////
90//
91G4double G4AdjointInterpolator::Interpolation(G4double& x,G4double& x1,G4double& x2,G4double& y1,G4double& y2,G4String InterPolMethod)
92{
93  if (InterPolMethod == "Log" ){
94        return LogarithmicInterpolation(x,x1,x2,y1,y2);
95  }
96  else if (InterPolMethod == "Lin" ){
97        return LinearInterpolation(x,x1,x2,y1,y2);
98  }
99  else if (InterPolMethod == "Exp" ){
100        return ExponentialInterpolation(x,x1,x2,y1,y2);
101  }
102  else {
103        //G4cout<<"The interpolation method that you invoked does not exist!"<<G4endl;
104        return -1111111111.;
105  }
106}
107///////////////////////////////////////////////////////
108//
109size_t  G4AdjointInterpolator::FindPosition(G4double& x,std::vector<G4double>& x_vec,size_t , size_t ) //only valid if x_vec is monotically increasing
110{  //most rapid nethod could be used probably
111   //It is important to put std::vector<G4double>& such that the vector itself is used and not a copy
112 
113 
114  size_t ndim = x_vec.size();
115  size_t ind1 = 0;
116  size_t ind2 = ndim - 1;
117 /* if (ind_max >= ind_min){
118        ind1=ind_min;
119        ind2=ind_max;
120       
121 
122  }
123  */
124 
125 
126  if (ndim >1) {
127       
128        if (x_vec[0] < x_vec[1] ) { //increasing
129                do {
130                        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                do {
139                        size_t midBin = (ind1 + ind2)/2;
140                        if (x < x_vec[midBin])
141                                        ind1 = midBin;
142                        else 
143                                        ind2 = midBin;
144                } while (ind2 - ind1 > 1);
145        }
146 
147  }
148       
149  return ind1;
150}
151
152///////////////////////////////////////////////////////
153//
154size_t  G4AdjointInterpolator::FindPositionForLogVector(G4double& log_x,std::vector<G4double>& log_x_vec) //only valid if x_vec is monotically increasing
155{  //most rapid nethod could be used probably
156   //It is important to put std::vector<G4double>& such that the vector itself is used and not a copy
157  return FindPosition(log_x, log_x_vec);
158  if (log_x_vec.size()>3){ 
159        size_t ind=0;
160        G4double log_x1=log_x_vec[1];
161        G4double d_log =log_x_vec[2]-log_x1;
162        G4double dind=(log_x-log_x1)/d_log +1.;
163        if (dind <1.) ind=0;
164        else if (dind >= double(log_x_vec.size())-2.) ind =log_x_vec.size()-2;
165        else ind =size_t(dind);
166        return ind;
167       
168  }
169  else  return FindPosition(log_x, log_x_vec);
170 
171 
172}
173///////////////////////////////////////////////////////
174//
175G4double G4AdjointInterpolator::Interpolate(G4double& x,std::vector<G4double>& x_vec,std::vector<G4double>& y_vec,G4String InterPolMethod)
176{ size_t i=FindPosition(x,x_vec);
177  //G4cout<<i<<G4endl;
178  //G4cout<<x<<G4endl;
179  //G4cout<<x_vec[i]<<G4endl;
180  return Interpolation( x,x_vec[i],x_vec[i+1],y_vec[i],y_vec[i+1],InterPolMethod);
181}
182
183///////////////////////////////////////////////////////
184//
185G4double G4AdjointInterpolator::InterpolateWithIndexVector(G4double& x,std::vector<G4double>& x_vec,std::vector<G4double>& y_vec,
186                                            std::vector<size_t>& index_vec,G4double x0, G4double dx) //only linear interpolation possible
187{ size_t ind=0;
188  if (x>x0) ind=int((x-x0)/dx);
189  if (ind >= index_vec.size()-1) ind= index_vec.size()-2;
190  size_t ind1 = index_vec[ind];
191  size_t ind2 = index_vec[ind+1];
192  if (ind1 >ind2) {
193        size_t ind11=ind1;
194        ind1=ind2;
195        ind2=ind11;
196 
197  }
198 
199  ind=FindPosition(x,x_vec,ind1,ind2);
200  return Interpolation( x,x_vec[ind],x_vec[ind+1],y_vec[ind],y_vec[ind+1],"Lin");
201 
202}                                           
203                                             
204
205///////////////////////////////////////////////////////
206//
207G4double G4AdjointInterpolator::InterpolateForLogVector(G4double& log_x,std::vector<G4double>& log_x_vec,std::vector<G4double>& log_y_vec)
208{ //size_t i=0;
209  size_t i=FindPositionForLogVector(log_x,log_x_vec);
210  /*G4cout<<"In interpolate "<<G4endl;
211  G4cout<<i<<G4endl;
212  G4cout<<log_x<<G4endl;
213  G4cout<<log_x_vec[i]<<G4endl;
214  G4cout<<log_x_vec[i+1]<<G4endl;
215  G4cout<<log_y_vec[i]<<G4endl;
216  G4cout<<log_y_vec[i+1]<<G4endl;*/
217 
218  G4double log_y=LinearInterpolation(log_x,log_x_vec[i],log_x_vec[i+1],log_y_vec[i],log_y_vec[i+1]);
219  return log_y; 
220 
221} 
Note: See TracBrowser for help on using the repository browser.