-
Notifications
You must be signed in to change notification settings - Fork 0
/
AdaptiveGrid.cc
157 lines (137 loc) · 4.2 KB
/
AdaptiveGrid.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#include <RAT/AdaptiveGrid.hh>
#include <RAT/OptimisedComponent.hh>
#include <iostream>
#include <math.h>
#include <sstream>
using namespace RAT::Optimisers;
void AdaptiveGrid::Initialise( const std::string& param )
{
// Convert input string to fDiv, else make fDiv take default val
if ( param.empty() ){
// this sets up number of steps in each dimension. Eventually could be read from a ratdb file
fDiv.push_back(12);//12
fDiv.push_back(12);//12
fDiv.push_back(12);//12
fDiv.push_back(0);
fDiv.push_back(20);//20
fDiv.push_back(20);//20
} else {
// std::stringstream strStream(param);
//strStream >> fDiv;
}
}
double
AdaptiveGrid::Minimise()
{
fMinFactor = 1.0;
return fMinFactor*Evaluate();
}
double
AdaptiveGrid::Maximise()
{
fMinFactor = -1.0;
return fMinFactor*Evaluate();
}
double AdaptiveGrid::Evaluate()
{
// Get initial seed parameters
fParams = fComponent->GetParams();
fPositiveErrors = fComponent->GetPositiveErrors();
fNegativeErrors = fComponent->GetNegativeErrors();
// step arounnd seet result, but around 0 for directions
//fParams[0] = 0;
//fParams[1] = 0;
// fParams[2] = 0;
// fParams[3] = 225;
fParams[4] = 0;
fParams[5] = 0;
// fParams[6] = 0;
//max and min points of search in each dimension
fPositiveErrors[0] = 600;
fPositiveErrors[1] = 600;
fPositiveErrors[2] = 600;
fPositiveErrors[3] = 0;
fPositiveErrors[4] = 1.0;
fPositiveErrors[5] = M_PI;
fNegativeErrors[0] = 600;
fNegativeErrors[1] = 600;
fNegativeErrors[2] = 600;
fNegativeErrors[3] = 0;
fNegativeErrors[4] = 1;
fNegativeErrors[5] = M_PI;
fTotalDim=fParams.size();
// Initialise starting point of mixed space grid and increments
fStartPos = fParams;
fIncrements = fParams;
// Range to be evaluated is from (seed-NegativeError) to (seed+PositiveError)
for (int ii=0; ii<fTotalDim; ii++) {
fStartPos[ii] = fParams[ii] - fNegativeErrors[ii];
if(fDiv.at(ii)>0)
fIncrements[ii] = ( fPositiveErrors[ii]+fNegativeErrors[ii] ) / (double) fDiv.at(ii) ;
else
fIncrements[ii] = 0;
}
//want to step in cos theta, but llh is evaluated with non cos
std::vector<double> facosPos;
facosPos = fParams;
facosPos[4] = acos(fParams[4]);
fOptimalFom = fMinFactor * (*fComponent)(facosPos);
Scan( fParams, 0, 5 );
fStartPos = fParams;
//doing second scan over smaller range. Eventually this would all be done in a while loop so can have many iterations if needed
for (int ii=0; ii<fTotalDim; ii++) {
if(fDiv.at(ii)>0){
//step round smaller area
fPositiveErrors[ii] = 2*fPositiveErrors[ii]/(double) fDiv.at(ii);
fNegativeErrors[ii] = 2*fNegativeErrors[ii]/(double) fDiv.at(ii);
fStartPos[ii] = fParams[ii] - fNegativeErrors[ii];
fIncrements[ii] = ( fPositiveErrors[ii]+fNegativeErrors[ii] ) / (double) fDiv.at(ii) ;
}
else{
fIncrements[ii] = 0;
fPositiveErrors[ii] = 0;
fNegativeErrors[ii] = 0;
fStartPos[ii] = fParams[ii];
}
}
facosPos = fParams;
facosPos[4] = acos(fParams[4]);
fOptimalFom = fMinFactor * (*fComponent)(facosPos);
Scan( fParams, 0, 5 );
facosPos = fParams;
facosPos[4] = acos(fParams[4]);
fParams = facosPos;
fValid = true;
return fOptimalFom;
}
void AdaptiveGrid::Scan( std::vector<double> coords, int dimension, int maxdim )
{
//Scan( coords, dimension + 1 );
for( int spacePosition=0 ; spacePosition<fDiv.at(dimension)+1; spacePosition++ )
{
coords[dimension] = fStartPos[dimension] + (spacePosition * fIncrements[dimension]);
if(dimension == 5)//phi between -pi and pi
{
if(fParams[dimension] > M_PI)
fParams[dimension] -= 2*M_PI;
if(fParams[dimension] < -M_PI)
fParams[dimension] += 2*M_PI;
}
if( dimension != maxdim )
{
Scan( coords, dimension + 1, maxdim );
}
else
{
// std::cout << coords[0] << " " << coords[1] << " " << coords[2] <<" " << coords[3] << " "<< coords[4] <<" " << coords[5] << std::endl;
coords[4] = acos(coords[4]);
double fomHere = fMinFactor * (*fComponent)( coords );
coords[4] = cos(coords[4]);
if ( fomHere <= fOptimalFom)
{
fOptimalFom = fomHere;
fParams = coords;
}
}
}
}