]> git.uio.no Git - u/mrichter/AliRoot.git/blame - STEER/AliMillePede2.cxx
git://git.uio.no / u / mrichter / AliRoot.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Adding support for the fast cluster to the physics selection
[u/mrichter/AliRoot.git] / STEER / AliMillePede2.cxx
CommitLineData
de34b538 1/**********************************************************************************************/
2/* General class for alignment with large number of degrees of freedom */
3/* Based on the original milliped2 by Volker Blobel */
4/* http://www.desy.de/~blobel/mptalks.html */
5/* */
6/* Author: ruben.shahoyan@cern.ch */
7/* */
8/**********************************************************************************************/
9
8a9ab0eb 10#include "AliMillePede2.h"
11#include "AliLog.h"
12#include <TStopwatch.h>
de34b538 13#include <TFile.h>
f9efbbf6 14#include <TChain.h>
de34b538 15#include <TMath.h>
7c3070ec 16#include <TVectorD.h>
e30a812f 17#include <TArrayL.h>
f9efbbf6 18#include <TSystem.h>
de34b538 19#include "AliMatrixSq.h"
20#include "AliSymMatrix.h"
21#include "AliRectMatrix.h"
22#include "AliMatrixSparse.h"
e30a812f 23#include <stdio.h>
24#include <stdlib.h>
25#include <unistd.h>
26#include <sys/types.h>
27#include <sys/stat.h>
28#include <fcntl.h>
f9efbbf6 29#include <fstream>
8a9ab0eb 30
de34b538 31using namespace std;
8a9ab0eb 32
8a9ab0eb 33
8a9ab0eb 34ClassImp(AliMillePede2)
35
de34b538 36Bool_t AliMillePede2::fgInvChol = kTRUE; // Invert global matrix with Cholesky solver
37Bool_t AliMillePede2::fgWeightSigma = kTRUE; // weight local constraint by module statistics
38Bool_t AliMillePede2::fgIsMatGloSparse = kFALSE; // use faster dense matrix by default
39Int_t AliMillePede2::fgMinResCondType = 1; // Jacoby preconditioner by default
40Double_t AliMillePede2::fgMinResTol = 1.e-11; // default tolerance
41Int_t AliMillePede2::fgMinResMaxIter = 10000; // default max number of iterations
8a9ab0eb 42Int_t AliMillePede2::fgIterSol = AliMinResSolve::kSolMinRes; // default iterative solver
de34b538 43Int_t AliMillePede2::fgNKrylovV = 240; // default number of Krylov vectors to keep
8a9ab0eb 44
45//_____________________________________________________________________________________________
46AliMillePede2::AliMillePede2()
47: fNLocPar(0),
48 fNGloPar(0),
49 fNGloSize(0),
50//
51 fNLocEquations(0),
52 fIter(0),
53 fMaxIter(10),
54 fNStdDev(3),
55 fNGloConstraints(0),
de34b538 56 fNLagrangeConstraints(0),
8a9ab0eb 57 fNLocFits(0),
58 fNLocFitsRejected(0),
59 fNGloFix(0),
60 fGloSolveStatus(gkFailed),
61//
62 fChi2CutFactor(1.),
63 fChi2CutRef(1.),
64 fResCutInit(100.),
65 fResCut(100.),
de34b538 66 fMinPntValid(1),
8a9ab0eb 67//
de34b538 68 fNGroupsSet(0),
69 fParamGrID(0),
8a9ab0eb 70 fProcPnt(0),
71 fVecBLoc(0),
72 fDiagCGlo(0),
73 fVecBGlo(0),
74 fInitPar(0),
75 fDeltaPar(0),
76 fSigmaPar(0),
77 fIsLinear(0),
78 fConstrUsed(0),
79//
80 fGlo2CGlo(0),
81 fCGlo2Glo(0),
82//
83 fMatCLoc(0),
84 fMatCGlo(0),
85 fMatCGloLoc(0),
de34b538 86 //
87 fFillIndex(0),
88 fFillValue(0),
89 //
8a9ab0eb 90 fDataRecFName("/tmp/mp2_data_records.root"),
91 fRecord(0),
92 fDataRecFile(0),
93 fTreeData(0),
a8c5b94c 94 fRecFileStatus(0),
8a9ab0eb 95 //
96 fConstrRecFName("/tmp/mp2_constraints_records.root"),
97 fTreeConstr(0),
98 fConsRecFile(0),
99 fCurrRecDataID(0),
de34b538 100 fCurrRecConstrID(0),
e30a812f 101 fLocFitAdd(kTRUE),
102 fSelFirst(1),
103 fSelLast(-1),
104 fRejRunList(0),
105 fAccRunList(0)
8a9ab0eb 106{}
107
108//_____________________________________________________________________________________________
109AliMillePede2::AliMillePede2(const AliMillePede2& src) :
110 TObject(src),fNLocPar(0),fNGloPar(0),fNGloSize(0),fNLocEquations(0),fIter(0),
de34b538 111 fMaxIter(10),fNStdDev(3),fNGloConstraints(0),fNLagrangeConstraints(0),
112 fNLocFits(0),fNLocFitsRejected(0),
8a9ab0eb 113 fNGloFix(0),fGloSolveStatus(0),fChi2CutFactor(0),fChi2CutRef(0),fResCutInit(0),
de34b538 114 fResCut(0),fMinPntValid(1),fNGroupsSet(0),fParamGrID(0),fProcPnt(0),fVecBLoc(0),fDiagCGlo(0),fVecBGlo(0),
8a9ab0eb 115 fInitPar(0),fDeltaPar(0),fSigmaPar(0),fIsLinear(0),fConstrUsed(0),fGlo2CGlo(0),fCGlo2Glo(0),
de34b538 116 fMatCLoc(0),fMatCGlo(0),fMatCGloLoc(0),fFillIndex(0),fFillValue(0),
117 fDataRecFName(0),fRecord(0),fDataRecFile(0),
a8c5b94c 118 fTreeData(0),fRecFileStatus(0),fConstrRecFName(0),fTreeConstr(0),fConsRecFile(0),fCurrRecDataID(0),
e30a812f 119 fCurrRecConstrID(0),fLocFitAdd(kTRUE),
120 fSelFirst(1),
121 fSelLast(-1),
122 fRejRunList(0),
123 fAccRunList(0)
8a9ab0eb 124{printf("Dummy\n");}
125
126//_____________________________________________________________________________________________
127AliMillePede2::~AliMillePede2()
128{
129 CloseDataRecStorage();
130 CloseConsRecStorage();
131 //
de34b538 132 delete[] fParamGrID;
8a9ab0eb 133 delete[] fProcPnt;
134 delete[] fVecBLoc;
135 delete[] fDiagCGlo;
136 delete[] fVecBGlo;
137 delete[] fInitPar;
138 delete[] fDeltaPar;
139 delete[] fSigmaPar;
140 delete[] fGlo2CGlo;
141 delete[] fCGlo2Glo;
142 delete[] fIsLinear;
143 delete[] fConstrUsed;
de34b538 144 delete[] fFillIndex;
145 delete[] fFillValue;
8a9ab0eb 146 //
147 delete fRecord;
148 delete fMatCLoc;
149 delete fMatCGlo;
150 delete fMatCGloLoc;
e30a812f 151 delete fRejRunList;
152 delete fAccRunList;
8a9ab0eb 153}
154
155//_____________________________________________________________________________________________
156Int_t AliMillePede2::InitMille(int nGlo, int nLoc, int lNStdDev,double lResCut, double lResCutInit)
157{
158 //
159 if (nLoc>0) fNLocPar = nLoc;
160 if (nGlo>0) fNGloPar = nGlo;
161 if (lResCutInit>0) fResCutInit = lResCutInit;
162 if (lResCut>0) fResCut = lResCut;
163 if (lNStdDev>0) fNStdDev = lNStdDev;
164 //
165 fNGloSize = fNGloPar;
166 //
167 try {
168 //
169 if (fgIsMatGloSparse) {fMatCGlo = new AliMatrixSparse(fNGloPar); fMatCGlo->SetSymmetric(kTRUE);}
170 else fMatCGlo = new AliSymMatrix(fNGloPar);
171 //
de34b538 172 fFillIndex = new Int_t[fNGloPar];
173 fFillValue = new Double_t[fNGloPar];
174 //
8a9ab0eb 175 fMatCLoc = new AliSymMatrix(fNLocPar);
de34b538 176 fMatCGloLoc = new AliRectMatrix(fNGloPar,fNLocPar);
8a9ab0eb 177 //
de34b538 178 fParamGrID = new Int_t[fNGloPar];
8a9ab0eb 179 fProcPnt = new Int_t[fNGloPar];
180 fVecBLoc = new Double_t[fNLocPar];
181 fDiagCGlo = new Double_t[fNGloPar];
182 //
183 fInitPar = new Double_t[fNGloPar];
184 fDeltaPar = new Double_t[fNGloPar];
185 fSigmaPar = new Double_t[fNGloPar];
186 fIsLinear = new Bool_t[fNGloPar];
187 //
188 fGlo2CGlo = new Int_t[fNGloPar];
189 fCGlo2Glo = new Int_t[fNGloPar];
190 }
191 catch(bad_alloc&) {
192 AliInfo(Form("Failed to allocate the memory for %d global and %d local parameters",fNGloPar,fNLocPar));
193 return 0;
194 }
195 //
196 memset(fVecBLoc ,0,fNLocPar*sizeof(Double_t));
197 memset(fDiagCGlo ,0,fNGloPar*sizeof(Double_t));
198 memset(fInitPar ,0,fNGloPar*sizeof(Double_t));
199 memset(fDeltaPar ,0,fNGloPar*sizeof(Double_t));
200 memset(fSigmaPar ,0,fNGloPar*sizeof(Double_t));
201 memset(fProcPnt ,0,fNGloPar*sizeof(Int_t));
202 //
203 for (int i=fNGloPar;i--;) {
de34b538 204 fGlo2CGlo[i] = fCGlo2Glo[i] = -1;
8a9ab0eb 205 fIsLinear[i] = kTRUE;
de34b538 206 fParamGrID[i] = -1;
8a9ab0eb 207 }
208 //
209 return 1;
210}
211
8a9ab0eb 212//_____________________________________________________________________________________________
213Bool_t AliMillePede2::ImposeDataRecFile(const char* fname)
214{
215 CloseDataRecStorage();
216 SetDataRecFName(fname);
217 return InitDataRecStorage(kTRUE); // open in read mode
218}
219
220//_____________________________________________________________________________________________
221Bool_t AliMillePede2::ImposeConsRecFile(const char* fname)
222{
223 CloseConsRecStorage();
224 SetConsRecFName(fname);
225 return InitConsRecStorage(kTRUE); // open in read mode
226}
227
228//_____________________________________________________________________________________________
229Bool_t AliMillePede2::InitDataRecStorage(Bool_t read)
230{
231 // initialize the buffer for processed measurements records
232 //
f9efbbf6 233 if (fTreeData) {AliInfo("Data Records File is already initialized"); return kFALSE;}
8a9ab0eb 234 //
235 if (!fRecord) fRecord = new AliMillePedeRecord();
236 //
f9efbbf6 237 if (!read) { // write mode: cannot use chain
238 fDataRecFile = TFile::Open(GetDataRecFName(),"recreate");
239 if (!fDataRecFile) {AliFatal(Form("Failed to initialize data records file %s",GetDataRecFName())); return kFALSE;}
240 AliInfo(Form("File %s used for derivatives records",GetDataRecFName()));
8a9ab0eb 241 fTreeData = new TTree("AliMillePedeRecords_Data","Data Records for AliMillePede2");
242 fTreeData->Branch("Record_Data","AliMillePedeRecord",&fRecord,32000,99);
243 }
f9efbbf6 244 else { // use chain
245 TChain* ch = new TChain("AliMillePedeRecords_Data");
246 //
247 if (fDataRecFName.EndsWith(".root")) ch->AddFile(fDataRecFName);
248 else { // assume text file with list of filenames
249 //
250 ifstream inpf(fDataRecFName.Data());
251 if (!inpf.good()) {AliInfo(Form("Failed on input records list %s\n",fDataRecFName.Data())); return kFALSE;}
252 //
253 TString recfName;
254 recfName.ReadLine(inpf);
255 while ( !(recfName.ReadLine(inpf)).eof() ) {
256 recfName = recfName.Strip(TString::kBoth,' ');
257 if (recfName.BeginsWith("//") || recfName.BeginsWith("#") || !recfName.EndsWith(".root")) { // comment
258 AliInfo(Form("Skip %s\n",recfName.Data()));
259 continue;
260 }
261 //
262 recfName = recfName.Strip(TString::kBoth,',');
263 recfName = recfName.Strip(TString::kBoth,'"');
264 gSystem->ExpandPathName(recfName);
265 printf("Adding %s\n",recfName.Data());
266 ch->AddFile(recfName.Data());
267 }
268 }
269 //
270 Long64_t nent = ch->GetEntries();
271 if (nent<1) { AliInfo("Obtained chain is empty"); return kFALSE;}
272 fTreeData = ch;
273 fTreeData->SetBranchAddress("Record_Data",&fRecord);
274 AliInfo(Form("Found %lld derivatives records",nent));
275 }
8a9ab0eb 276 fCurrRecDataID = -1;
a8c5b94c 277 fRecFileStatus = read ? 1:2;
8a9ab0eb 278 //
279 return kTRUE;
280}
281
282//_____________________________________________________________________________________________
283Bool_t AliMillePede2::InitConsRecStorage(Bool_t read)
284{
285 // initialize the buffer for processed measurements records
286 //
287 if (fConsRecFile) {AliInfo("Constraints Records File is already initialized"); return kFALSE;}
288 //
289 if (!fRecord) fRecord = new AliMillePedeRecord();
290 //
291 fConsRecFile = TFile::Open(GetConsRecFName(),read ? "":"recreate");
292 if (!fConsRecFile) {AliInfo(Form("Failed to initialize constraints records file %s",GetConsRecFName())); return kFALSE;}
293 //
294 AliInfo(Form("File %s used for constraints records",GetConsRecFName()));
295 if (read) {
296 fTreeConstr = (TTree*)fConsRecFile->Get("AliMillePedeRecords_Constraints");
297 if (!fTreeConstr) {AliInfo(Form("Did not find constraints records tree in %s",GetConsRecFName())); return kFALSE;}
298 fTreeConstr->SetBranchAddress("Record_Constraints",&fRecord);
73bbf779 299 AliInfo(Form("Found %lld constraints records",fTreeConstr->GetEntries()));
8a9ab0eb 300 //
301 }
302 else {
303 //
304 fTreeConstr = new TTree("AliMillePedeRecords_Constraints","Constraints Records for AliMillePede2");
305 fTreeConstr->Branch("Record_Constraints","AliMillePedeRecord",&fRecord,32000,99);
306 }
307 fCurrRecConstrID = -1;
308 //
309 return kTRUE;
310}
311
312//_____________________________________________________________________________________________
313void AliMillePede2::CloseDataRecStorage()
314{
315 if (fTreeData) {
f9efbbf6 316 if (fDataRecFile && fDataRecFile->IsWritable()) {
8a9ab0eb 317 fDataRecFile->cd();
318 fTreeData->Write();
319 }
320 delete fTreeData;
321 fTreeData = 0;
f9efbbf6 322 if (fDataRecFile) {
323 fDataRecFile->Close();
324 delete fDataRecFile;
325 fDataRecFile = 0;
326 }
8a9ab0eb 327 }
a8c5b94c 328 fRecFileStatus = 0;
8a9ab0eb 329 //
330}
331
332//_____________________________________________________________________________________________
333void AliMillePede2::CloseConsRecStorage()
334{
335 if (fTreeConstr) {
336 if (fConsRecFile->IsWritable()) {
337 fConsRecFile->cd();
338 fTreeConstr->Write();
339 }
340 delete fTreeConstr;
341 fTreeConstr = 0;
342 fConsRecFile->Close();
343 delete fConsRecFile;
344 fConsRecFile = 0;
345 }
346 //
347}
348
349//_____________________________________________________________________________________________
350Bool_t AliMillePede2::ReadNextRecordData()
351{
352 // read next data record (if any)
353 if (!fTreeData || ++fCurrRecDataID >= fTreeData->GetEntries()) { fCurrRecDataID--; return kFALSE;}
354 fTreeData->GetEntry(fCurrRecDataID);
355 return kTRUE;
356}
357
358//_____________________________________________________________________________________________
359Bool_t AliMillePede2::ReadNextRecordConstraint()
360{
361 // read next constraint record (if any)
362 if (!fTreeConstr || ++fCurrRecConstrID >= fTreeConstr->GetEntries()) { fCurrRecConstrID--; return kFALSE;}
363 fTreeConstr->GetEntry(fCurrRecConstrID);
364 return kTRUE;
365}
366
a8c5b94c 367//_____________________________________________________________________________________________
368void AliMillePede2::SetRecordWeight(double wgh)
369{
370 if (fRecFileStatus<2) InitDataRecStorage(); // create a buffer to store the data
371 fRecord->SetWeight(wgh);
372}
373
e30a812f 374//_____________________________________________________________________________________________
375void AliMillePede2::SetRecordRun(Int_t run)
376{
377 if (fRecFileStatus<2) InitDataRecStorage(); // create a buffer to store the data
378 fRecord->SetRunID(run);
379}
380
8a9ab0eb 381//_____________________________________________________________________________________________
382void AliMillePede2::SetLocalEquation(double *dergb, double *derlc, double lMeas, double lSigma)
383{
a8c5b94c 384 if (fRecFileStatus<2) InitDataRecStorage(); // create a buffer to store the data
8a9ab0eb 385 //
386 // write data of single measurement
387 if (lSigma<=0.0) { // If parameter is fixed, then no equation
388 for (int i=fNLocPar; i--;) derlc[i] = 0.0;
389 for (int i=fNGloPar; i--;) dergb[i] = 0.0;
390 return;
391 }
392 //
393 fRecord->AddResidual(lMeas);
394 //
395 // Retrieve local param interesting indices
cc9bec47 396 for (int i=0;i<fNLocPar;i++) if (!IsZero(derlc[i])) {fRecord->AddIndexValue(i,derlc[i]); derlc[i] = 0.0;}
8a9ab0eb 397 //
398 fRecord->AddWeight( 1.0/lSigma/lSigma );
399 //
400 // Idem for global parameters
cc9bec47 401 for (int i=0;i<fNGloPar;i++) if (!IsZero(dergb[i])) {
de34b538 402 fRecord->AddIndexValue(i,dergb[i]); dergb[i] = 0.0;
403 fRecord->MarkGroup(fParamGrID[i]);
404 }
8a9ab0eb 405 //
406}
407
408//_____________________________________________________________________________________________
409void AliMillePede2::SetLocalEquation(int *indgb, double *dergb, int ngb, int *indlc,
410 double *derlc,int nlc,double lMeas,double lSigma)
411{
412 // write data of single measurement
413 if (lSigma<=0.0) { // If parameter is fixed, then no equation
414 for (int i=nlc;i--;) derlc[i] = 0.0;
415 for (int i=ngb;i--;) dergb[i] = 0.0;
416 return;
417 }
418 //
a8c5b94c 419 if (fRecFileStatus<2) InitDataRecStorage(); // create a buffer to store the data
8a9ab0eb 420 //
421 fRecord->AddResidual(lMeas);
422 //
423 // Retrieve local param interesting indices
cc9bec47 424 for (int i=0;i<nlc;i++) if (!IsZero(derlc[i])) {fRecord->AddIndexValue(indlc[i],derlc[i]); derlc[i]=0.; indlc[i]=0;}
8a9ab0eb 425 //
426 fRecord->AddWeight( 1./lSigma/lSigma );
427 //
428 // Idem for global parameters
cc9bec47 429 for (int i=0;i<ngb;i++) if (!IsZero(dergb[i])) {fRecord->AddIndexValue(indgb[i],dergb[i]); dergb[i]=0.; indgb[i]=0;}
8a9ab0eb 430 //
431}
432
de34b538 433
8a9ab0eb 434//_____________________________________________________________________________________________
de34b538 435void AliMillePede2::SetGlobalConstraint(double *dergb, double val, double sigma)
8a9ab0eb 436{
437 // Define a constraint equation.
438 if (!fConsRecFile || !fConsRecFile->IsWritable()) InitConsRecStorage(); // create a buffer to store the data
439 //
440 fRecord->Reset();
441 fRecord->AddResidual(val);
de34b538 442 fRecord->AddWeight(sigma);
cc9bec47 443 for (int i=0; i<fNGloPar; i++) if (!IsZero(dergb[i])) fRecord->AddIndexValue(i,dergb[i]);
8a9ab0eb 444 fNGloConstraints++;
cc9bec47 445 if (IsZero(sigma)) fNLagrangeConstraints++;
de34b538 446 // printf("NewConstraint:\n"); fRecord->Print(); //RRR
8a9ab0eb 447 SaveRecordConstraint();
448 //
449}
450
451//_____________________________________________________________________________________________
de34b538 452void AliMillePede2::SetGlobalConstraint(const int *indgb, double *dergb, int ngb, double val,double sigma)
8a9ab0eb 453{
454 // Define a constraint equation.
455 if (!fConsRecFile || !fConsRecFile->IsWritable()) InitConsRecStorage(); // create a buffer to store the data
456 fRecord->Reset();
457 fRecord->AddResidual(val);
de34b538 458 fRecord->AddWeight(sigma); // dummy
cc9bec47 459 for (int i=0; i<ngb; i++) if (!IsZero(dergb[i])) fRecord->AddIndexValue(indgb[i],dergb[i]);
8a9ab0eb 460 fNGloConstraints++;
cc9bec47 461 if (IsZero(sigma)) fNLagrangeConstraints++;
8a9ab0eb 462 SaveRecordConstraint();
463 //
464}
465
466//_____________________________________________________________________________________________
467Int_t AliMillePede2::LocalFit(double *localParams)
468{
469 /*
470 Perform local parameters fit once all the local equations have been set
471 -----------------------------------------------------------
472 localParams = (if !=0) will contain the fitted track parameters and
473 related errors
474 */
de34b538 475 static int nrefSize = 0;
476 // static TArrayI refLoc,refGlo,nrefLoc,nrefGlo;
477 static Int_t *refLoc=0,*refGlo=0,*nrefLoc=0,*nrefGlo=0;
8a9ab0eb 478 int nPoints = 0;
479 //
de34b538 480 AliSymMatrix &matCLoc = *fMatCLoc;
481 AliMatrixSq &matCGlo = *fMatCGlo;
482 AliRectMatrix &matCGloLoc = *fMatCGloLoc;
8a9ab0eb 483 //
484 memset(fVecBLoc,0,fNLocPar*sizeof(double));
de34b538 485 matCLoc.Reset();
8a9ab0eb 486 //
487 int cnt=0;
488 int recSz = fRecord->GetSize();
489 //
490 while(cnt<recSz) { // Transfer the measurement records to matrices
491 //
492 // extract addresses of residual, weight and pointers on local and global derivatives for each point
de34b538 493 if (nrefSize<=nPoints) {
494 int *tmpA = 0;
495 nrefSize = 2*(nPoints+1);
496 tmpA = refLoc; refLoc = new Int_t[nrefSize]; if (tmpA) memcpy(refLoc,tmpA,nPoints*sizeof(int));
497 tmpA = refGlo; refGlo = new Int_t[nrefSize]; if (tmpA) memcpy(refGlo,tmpA,nPoints*sizeof(int));
498 tmpA = nrefLoc; nrefLoc = new Int_t[nrefSize]; if (tmpA) memcpy(nrefLoc,tmpA,nPoints*sizeof(int));
499 tmpA = nrefGlo; nrefGlo = new Int_t[nrefSize]; if (tmpA) memcpy(nrefGlo,tmpA,nPoints*sizeof(int));
8a9ab0eb 500 }
501 //
de34b538 502 refLoc[nPoints] = ++cnt;
8a9ab0eb 503 int nLoc = 0;
504 while(!fRecord->IsWeight(cnt)) {nLoc++; cnt++;}
de34b538 505 nrefLoc[nPoints] = nLoc;
8a9ab0eb 506 //
de34b538 507 refGlo[nPoints] = ++cnt;
8a9ab0eb 508 int nGlo = 0;
509 while(!fRecord->IsResidual(cnt) && cnt<recSz) {nGlo++; cnt++;}
de34b538 510 nrefGlo[nPoints] = nGlo;
8a9ab0eb 511 //
512 nPoints++;
513 }
514 double vl;
515 //
a8c5b94c 516 double gloWgh = fRecord->GetWeight(); // global weight for this set
7c3070ec 517 Int_t maxLocUsed = 0;
518 //
8a9ab0eb 519 for (int ip=nPoints;ip--;) { // Transfer the measurement records to matrices
de34b538 520 double resid = fRecord->GetValue( refLoc[ip]-1 );
a8c5b94c 521 double weight = fRecord->GetValue( refGlo[ip]-1 )*gloWgh;
de34b538 522 double *derLoc = fRecord->GetValue()+refLoc[ip];
523 double *derGlo = fRecord->GetValue()+refGlo[ip];
524 int *indLoc = fRecord->GetIndex()+refLoc[ip];
525 int *indGlo = fRecord->GetIndex()+refGlo[ip];
526 //
a8c5b94c 527 for (int i=nrefGlo[ip];i--;) { // suppress the global part (only relevant with iterations)
8a9ab0eb 528 int iID = indGlo[i]; // Global param indice
de34b538 529 if (fSigmaPar[iID]<=0.) continue; // fixed parameter RRRCheck
8a9ab0eb 530 if (fIsLinear[iID]) resid -= derGlo[i]*(fInitPar[iID]+fDeltaPar[iID]); // linear parameter
531 else resid -= derGlo[i]*fDeltaPar[iID]; // nonlinear parameter
532 }
533 //
de34b538 534 // Symmetric matrix, don't bother j>i coeffs
535 for (int i=nrefLoc[ip];i--;) { // Fill local matrix and vector
536 fVecBLoc[ indLoc[i] ] += weight*resid*derLoc[i];
7c3070ec 537 if (indLoc[i]>maxLocUsed) maxLocUsed = indLoc[i];
de34b538 538 for (int j=i+1;j--;) matCLoc(indLoc[i] ,indLoc[j]) += weight*derLoc[i]*derLoc[j];
7c3070ec 539 }
8a9ab0eb 540 //
541 } // end of the transfer of the measurement record to matrices
542 //
7c3070ec 543 matCLoc.SetSizeUsed(++maxLocUsed); // data with B=0 may use less than declared nLocals
544 //
f9efbbf6 545 /* //RRR
546 fRecord->Print("l");
547 printf("\nBefore\nLocalMatrix: "); matCLoc.Print("l");
548 printf("RHSLoc: "); for (int i=0;i<fNLocPar;i++) printf("%+e |",fVecBLoc[i]); printf("\n");
549 */
8a9ab0eb 550 // first try to solve by faster Cholesky decomposition, then by Gaussian elimination
de34b538 551 if (!matCLoc.SolveChol(fVecBLoc,kTRUE)) {
a8c5b94c 552 AliInfo("Failed to solve locals by Cholesky, trying Gaussian Elimination");
de34b538 553 if (!matCLoc.SolveSpmInv(fVecBLoc,kTRUE)) {
8a9ab0eb 554 AliInfo("Failed to solve locals by Gaussian Elimination, skip...");
de34b538 555 matCLoc.Print("d");
8a9ab0eb 556 return 0; // failed to solve
557 }
558 }
559 //
560 // If requested, store the track params and errors
f9efbbf6 561 //RRR printf("locfit: "); for (int i=0;i<fNLocPar;i++) printf("%+e |",fVecBLoc[i]); printf("\n");
562
7c3070ec 563 if (localParams) for (int i=maxLocUsed; i--;) {
8a9ab0eb 564 localParams[2*i] = fVecBLoc[i];
de34b538 565 localParams[2*i+1] = TMath::Sqrt(TMath::Abs(matCLoc.QueryDiag(i)));
8a9ab0eb 566 }
567 //
568 float lChi2 = 0;
569 int nEq = 0;
570 //
571 for (int ip=nPoints;ip--;) { // Calculate residuals
de34b538 572 double resid = fRecord->GetValue( refLoc[ip]-1 );
a8c5b94c 573 double weight = fRecord->GetValue( refGlo[ip]-1 )*gloWgh;
de34b538 574 double *derLoc = fRecord->GetValue()+refLoc[ip];
575 double *derGlo = fRecord->GetValue()+refGlo[ip];
576 int *indLoc = fRecord->GetIndex()+refLoc[ip];
577 int *indGlo = fRecord->GetIndex()+refGlo[ip];
8a9ab0eb 578 //
579 // Suppress local and global contribution in residuals;
de34b538 580 for (int i=nrefLoc[ip];i--;) resid -= derLoc[i]*fVecBLoc[ indLoc[i] ]; // local part
8a9ab0eb 581 //
de34b538 582 for (int i=nrefGlo[ip];i--;) { // global part
8a9ab0eb 583 int iID = indGlo[i];
584 if ( fSigmaPar[iID] <= 0.) continue; // fixed parameter RRRCheck
585 if (fIsLinear[iID]) resid -= derGlo[i]*(fInitPar[iID]+fDeltaPar[iID]); // linear parameter
586 else resid -= derGlo[i]*fDeltaPar[iID]; // nonlinear parameter
587 }
588 //
589 // reject the track if the residual is too large (outlier)
de34b538 590 double absres = TMath::Abs(resid);
591 if ( (absres >= fResCutInit && fIter ==1 ) ||
592 (absres >= fResCut && fIter > 1)) {
593 if (fLocFitAdd) fNLocFitsRejected++;
cc9bec47 594 // printf("reject res %5ld %+e\n",fCurrRecDataID,resid);
8a9ab0eb 595 return 0;
596 }
597 //
598 lChi2 += weight*resid*resid ; // total chi^2
599 nEq++; // number of equations
600 } // end of Calculate residuals
601 //
a8c5b94c 602 lChi2 /= gloWgh;
7c3070ec 603 int nDoF = nEq-maxLocUsed;
8a9ab0eb 604 lChi2 = (nDoF>0) ? lChi2/nDoF : 0; // Chi^2/dof
605 //
606 if (fNStdDev != 0 && nDoF>0 && lChi2 > Chi2DoFLim(fNStdDev,nDoF)*fChi2CutFactor) { // check final chi2
de34b538 607 if (fLocFitAdd) fNLocFitsRejected++;
cc9bec47 608 // printf("reject chi2 %5ld: %+e\n",fCurrRecDataID, lChi2);
8a9ab0eb 609 return 0;
610 }
611 //
de34b538 612 if (fLocFitAdd) {
613 fNLocFits++;
614 fNLocEquations += nEq;
615 }
616 else {
617 fNLocFits--;
618 fNLocEquations -= nEq;
619 }
8a9ab0eb 620 //
621 // local operations are finished, track is accepted
622 // We now update the global parameters (other matrices)
623 //
624 int nGloInFit = 0;
625 //
626 for (int ip=nPoints;ip--;) { // Update matrices
de34b538 627 double resid = fRecord->GetValue( refLoc[ip]-1 );
a8c5b94c 628 double weight = fRecord->GetValue( refGlo[ip]-1 )*gloWgh;
de34b538 629 double *derLoc = fRecord->GetValue()+refLoc[ip];
630 double *derGlo = fRecord->GetValue()+refGlo[ip];
631 int *indLoc = fRecord->GetIndex()+refLoc[ip];
632 int *indGlo = fRecord->GetIndex()+refGlo[ip];
633 //
634 for (int i=nrefGlo[ip];i--;) { // suppress the global part
8a9ab0eb 635 int iID = indGlo[i]; // Global param indice
636 if ( fSigmaPar[iID] <= 0.) continue; // fixed parameter RRRCheck
de34b538 637 if (fIsLinear[iID]) resid -= derGlo[i]*(fInitPar[iID]+fDeltaPar[iID]); // linear parameter
638 else resid -= derGlo[i]*fDeltaPar[iID]; // nonlinear parameter
8a9ab0eb 639 }
640 //
de34b538 641 for (int ig=nrefGlo[ip];ig--;) {
8a9ab0eb 642 int iIDg = indGlo[ig]; // Global param indice (the matrix line)
643 if ( fSigmaPar[iIDg] <= 0.) continue; // fixed parameter RRRCheck
de34b538 644 if (fLocFitAdd) fVecBGlo[ iIDg ] += weight*resid*derGlo[ig]; //!!!
645 else fVecBGlo[ iIDg ] -= weight*resid*derGlo[ig]; //!!!
8a9ab0eb 646 //
647 // First of all, the global/global terms (exactly like local matrix)
de34b538 648 int nfill = 0;
649 for (int jg=ig+1;jg--;) { // matCGlo is symmetric by construction
8a9ab0eb 650 int jIDg = indGlo[jg];
651 if ( fSigmaPar[jIDg] <= 0.) continue; // fixed parameter RRRCheck
cc9bec47 652 if ( !IsZero(vl = weight*derGlo[ig]*derGlo[jg]) ) {
de34b538 653 fFillIndex[nfill] = jIDg;
654 fFillValue[nfill++] = fLocFitAdd ? vl:-vl;
655 }
656 }
657 if (nfill) matCGlo.AddToRow(iIDg,fFillValue,fFillIndex,nfill);
8a9ab0eb 658 //
659 // Now we have also rectangular matrices containing global/local terms.
660 int iCIDg = fGlo2CGlo[iIDg]; // compressed Index of index
661 if (iCIDg == -1) {
de34b538 662 Double_t *rowGL = matCGloLoc(nGloInFit);
7c3070ec 663 for (int k=maxLocUsed;k--;) rowGL[k] = 0.0; // reset the row
8a9ab0eb 664 iCIDg = fGlo2CGlo[iIDg] = nGloInFit;
665 fCGlo2Glo[nGloInFit++] = iIDg;
666 }
667 //
de34b538 668 Double_t *rowGLIDg = matCGloLoc(iCIDg);
669 for (int il=nrefLoc[ip];il--;) rowGLIDg[ indLoc[il] ] += weight*derGlo[ig]*derLoc[il];
670 fProcPnt[iIDg] += fLocFitAdd ? 1:-1; // update counter
8a9ab0eb 671 //
672 }
673 } // end of Update matrices
674 //
f9efbbf6 675 /*//RRR
676 printf("After GLO\n");
677 printf("MatCLoc: "); fMatCLoc->Print("l");
678 printf("MatCGlo: "); fMatCGlo->Print("l");
679 printf("MatCGlLc:"); fMatCGloLoc->Print("l");
680 printf("BGlo: "); for (int i=0; i<fNGloPar; i++) printf("%+e |",fVecBGlo[i]); printf("\n");
681 */
8a9ab0eb 682 // calculate fMatCGlo -= fMatCGloLoc * fMatCLoc * fMatCGloLoc^T
683 // and fVecBGlo -= fMatCGloLoc * fVecBLoc
684 //
de34b538 685 //-------------------------------------------------------------- >>>
8a9ab0eb 686 double vll;
687 for (int iCIDg=0; iCIDg<nGloInFit; iCIDg++) {
688 int iIDg = fCGlo2Glo[iCIDg];
689 //
690 vl = 0;
de34b538 691 Double_t *rowGLIDg = matCGloLoc(iCIDg);
7c3070ec 692 for (int kl=0;kl<maxLocUsed;kl++) if (rowGLIDg[kl]) vl += rowGLIDg[kl]*fVecBLoc[kl];
cc9bec47 693 if (!IsZero(vl)) fVecBGlo[iIDg] -= fLocFitAdd ? vl : -vl;
8a9ab0eb 694 //
de34b538 695 int nfill = 0;
8a9ab0eb 696 for (int jCIDg=0;jCIDg<=iCIDg; jCIDg++) {
697 int jIDg = fCGlo2Glo[jCIDg];
698 //
699 vl = 0;
de34b538 700 Double_t *rowGLJDg = matCGloLoc(jCIDg);
7c3070ec 701 for (int kl=0;kl<maxLocUsed;kl++) {
8a9ab0eb 702 // diag terms
cc9bec47 703 if ( (!IsZero(vll=rowGLIDg[kl]*rowGLJDg[kl])) ) vl += matCLoc.QueryDiag(kl)*vll;
8a9ab0eb 704 //
705 // off-diag terms
706 for (int ll=0;ll<kl;ll++) {
cc9bec47 707 if ( !IsZero(vll=rowGLIDg[kl]*rowGLJDg[ll]) ) vl += matCLoc(kl,ll)*vll;
708 if ( !IsZero(vll=rowGLIDg[ll]*rowGLJDg[kl]) ) vl += matCLoc(kl,ll)*vll;
8a9ab0eb 709 }
710 }
cc9bec47 711 if (!IsZero(vl)) {
de34b538 712 fFillIndex[nfill] = jIDg;
713 fFillValue[nfill++] = fLocFitAdd ? -vl : vl;
714 }
8a9ab0eb 715 }
de34b538 716 if (nfill) matCGlo.AddToRow(iIDg,fFillValue,fFillIndex,nfill);
8a9ab0eb 717 }
718 //
719 // reset compressed index array
720 //
f9efbbf6 721 /*//RRR
722 printf("After GLOLoc\n");
723 printf("MatCGlo: "); fMatCGlo->Print("");
724 printf("BGlo: "); for (int i=0; i<fNGloPar; i++) printf("%+e |",fVecBGlo[i]); printf("\n");
725 */
de34b538 726 for (int i=nGloInFit;i--;) {
727 fGlo2CGlo[ fCGlo2Glo[i] ] = -1;
728 fCGlo2Glo[i] = -1;
729 }
8a9ab0eb 730 //
de34b538 731 //---------------------------------------------------- <<<
8a9ab0eb 732 return 1;
733}
734
735//_____________________________________________________________________________________________
736Int_t AliMillePede2::GlobalFit(Double_t *par, Double_t *error, Double_t *pull)
737{
738 // performs a requested number of global iterations
739 fIter = 1;
740 //
741 TStopwatch sw; sw.Start();
742 //
743 int res = 0;
744 AliInfo("Starting Global fit.");
745 while (fIter<=fMaxIter) {
746 //
747 res = GlobalFitIteration();
748 if (!res) break;
749 //
cc9bec47 750 if (!IsZero(fChi2CutFactor-fChi2CutRef)) {
8a9ab0eb 751 fChi2CutFactor = TMath::Sqrt(fChi2CutFactor);
752 if (fChi2CutFactor < 1.2*fChi2CutRef) {
753 fChi2CutFactor = fChi2CutRef;
e30a812f 754 //RRR fIter = fMaxIter - 1; // Last iteration
8a9ab0eb 755 }
756 }
757 fIter++;
758 }
759 //
760 sw.Stop();
761 AliInfo(Form("Global fit %s, CPU time: %.1f",res ? "Converged":"Failed",sw.CpuTime()));
762 if (!res) return 0;
763 //
764 if (par) for (int i=fNGloPar;i--;) par[i] = fInitPar[i]+fDeltaPar[i];
765 //
766 if (fGloSolveStatus==gkInvert) { // errors on params are available
de34b538 767 if (error) for (int i=fNGloPar;i--;) error[i] = fProcPnt[i]>0 ? TMath::Sqrt(TMath::Abs(fMatCGlo->QueryDiag(i))) : 0.;
768 if (pull) for (int i=fNGloPar;i--;) pull[i] = fProcPnt[i]>0 && (fSigmaPar[i]*fSigmaPar[i]-fMatCGlo->QueryDiag(i))>0. && fSigmaPar[i]>0
769 ? fDeltaPar[i]/TMath::Sqrt(fSigmaPar[i]*fSigmaPar[i]-fMatCGlo->QueryDiag(i)) : 0;
8a9ab0eb 770 }
771 //
772 return 1;
773}
774
775//_____________________________________________________________________________________________
776Int_t AliMillePede2::GlobalFitIteration()
777{
778 // perform global parameters fit once all the local equations have been fitted
779 //
780 AliInfo(Form("Global Fit Iteration#%2d (Local Fit Chi^2 cut factor: %.2f)",fIter,fChi2CutFactor));
781 //
782 if (!fNGloPar || !fTreeData) {
783 AliInfo("No data was stored, aborting iteration");
784 return 0;
785 }
de34b538 786 TStopwatch sw,sws;
787 sw.Start();
788 sws.Stop();
8a9ab0eb 789 //
790 if (!fConstrUsed) {
791 fConstrUsed = new Bool_t[fNGloConstraints];
792 memset(fConstrUsed,0,fNGloConstraints*sizeof(Bool_t));
793 }
794 // Reset all info specific for this step
de34b538 795 AliMatrixSq& matCGlo = *fMatCGlo;
796 matCGlo.Reset();
8a9ab0eb 797 memset(fProcPnt,0,fNGloPar*sizeof(Int_t));
798 //
799 fNGloConstraints = fTreeConstr ? fTreeConstr->GetEntries() : 0;
800 //
de34b538 801 // count number of Lagrange constraints: they need new row/cols to be added
802 fNLagrangeConstraints = 0;
803 for (int i=0; i<fNGloConstraints; i++) {
804 ReadRecordConstraint(i);
cc9bec47 805 if ( IsZero(fRecord->GetValue(1)) ) fNLagrangeConstraints++; // exact constraint (no error) -> Lagrange multiplier
de34b538 806 }
807 //
8a9ab0eb 808 // if needed, readjust the size of the global vector (for matrices this is done automatically)
de34b538 809 if (!fVecBGlo || fNGloSize!=fNGloPar+fNLagrangeConstraints) {
8a9ab0eb 810 delete[] fVecBGlo; // in case some constraint was added between the two manual iterations
de34b538 811 fNGloSize = fNGloPar+fNLagrangeConstraints;
8a9ab0eb 812 fVecBGlo = new Double_t[fNGloSize];
813 }
814 memset(fVecBGlo,0,fNGloSize*sizeof(double));
815 //
816 fNLocFits = 0;
817 fNLocFitsRejected = 0;
de34b538 818 fNLocEquations = 0;
8a9ab0eb 819 //
820 // Process data records and build the matrices
821 Long_t ndr = fTreeData->GetEntries();
e30a812f 822 Long_t first = fSelFirst>0 ? fSelFirst : 0;
823 Long_t last = fSelLast<1 ? ndr : (fSelLast>=ndr ? ndr : fSelLast+Long_t(1));
824 ndr = last - first;
825 //
73bbf779 826 AliInfo(Form("Building the Global matrix from data records %ld : %ld",first,last));
e30a812f 827 if (ndr<1) return 0;
de34b538 828 //
829 TStopwatch swt; swt.Start();
830 fLocFitAdd = kTRUE; // add contributions of matching tracks
8a9ab0eb 831 for (Long_t i=0;i<ndr;i++) {
e30a812f 832 Long_t iev = i+first;
833 ReadRecordData(iev);
834 if (!IsRecordAcceptable()) continue;
8a9ab0eb 835 LocalFit();
7c3070ec 836 if ( (i%int(0.2*ndr)) == 0) printf("%.1f%% of local fits done\n", double(100.*i)/ndr);
8a9ab0eb 837 }
de34b538 838 swt.Stop();
839 printf("%ld local fits done: ", ndr);
f9efbbf6 840 /*
841 printf("MatCGlo: "); fMatCGlo->Print("l");
842 printf("BGlo: "); for (int i=0; i<fNGloPar; i++) printf("%+e |",fVecBGlo[i]); printf("\n");
de34b538 843 swt.Print();
f9efbbf6 844 */
de34b538 845 sw.Start(kFALSE);
846 //
8a9ab0eb 847 //
de34b538 848 // ---------------------- Reject parameters with low statistics ------------>>
8a9ab0eb 849 fNGloFix = 0;
de34b538 850 if (fMinPntValid>1 && fNGroupsSet) {
851 //
852 printf("Checking parameters with statistics < %d\n",fMinPntValid);
853 TStopwatch swsup;
854 swsup.Start();
855 // 1) build the list of parameters to fix
856 Int_t fixArrSize = 10;
857 Int_t nFixedGroups = 0;
858 TArrayI fixGroups(fixArrSize);
859 //
91e1aa2c 860 int grIDold = -2;
861 int oldStart = -1;
862 double oldMin = 1.e20;
863 double oldMax =-1.e20;
864 //
de34b538 865 for (int i=fNGloPar;i--;) { // // Reset row and column of fixed params and add 1/sig^2 to free ones
866 int grID = fParamGrID[i];
867 if (grID<0) continue; // not in the group
91e1aa2c 868 //
869 if (grID!=grIDold) { // starting new group
870 if (grIDold>=0) { // decide if the group has enough statistics
871 if (oldMin<fMinPntValid && oldMax<2*fMinPntValid) { // suppress group
872 for (int iold=oldStart;iold>i;iold--) fProcPnt[iold] = 0;
873 Bool_t fnd = kFALSE; // check if the group is already accounted
874 for (int j=nFixedGroups;j--;) if (fixGroups[j]==grIDold) {fnd=kTRUE; break;}
875 if (!fnd) {
876 if (nFixedGroups>=fixArrSize) {fixArrSize*=2; fixGroups.Set(fixArrSize);}
877 fixGroups[nFixedGroups++] = grIDold; // add group to fix
878 }
879 }
880 }
881 grIDold = grID; // mark the start of the new group
882 oldStart = i;
883 oldMin = 1.e20;
884 oldMax = -1.e20;
885 }
886 if (oldMin>fProcPnt[i]) oldMin = fProcPnt[i];
887 if (oldMax<fProcPnt[i]) oldMax = fProcPnt[i];
de34b538 888 //
889 }
91e1aa2c 890 // extra check for the last group
891 if (grIDold>=0 && oldMin<fMinPntValid && oldMax<2*fMinPntValid) { // suppress group
892 for (int iold=oldStart;iold--;) fProcPnt[iold] = 0;
893 Bool_t fnd = kFALSE; // check if the group is already accounted
894 for (int j=nFixedGroups;j--;) if (fixGroups[j]==grIDold) {fnd=kTRUE; break;}
895 if (!fnd) {
896 if (nFixedGroups>=fixArrSize) {fixArrSize*=2; fixGroups.Set(fixArrSize);}
897 fixGroups[nFixedGroups++] = grIDold; // add group to fix
898 }
899 }
900 //
de34b538 901 // 2) loop over records and add contributions of fixed groups with negative sign
902 fLocFitAdd = kFALSE;
903 //
904 for (Long_t i=0;i<ndr;i++) {
e30a812f 905 Long_t iev = i+first;
906 ReadRecordData(iev);
907 if (!IsRecordAcceptable()) continue;
de34b538 908 Bool_t suppr = kFALSE;
909 for (int ifx=nFixedGroups;ifx--;)if (fRecord->IsGroupPresent(fixGroups[ifx])) suppr = kTRUE;
910 if (suppr) LocalFit();
911 }
912 fLocFitAdd = kTRUE;
913 //
914 if (nFixedGroups) {
915 printf("Suppressed contributions of groups with NPoints<%d :\n",fMinPntValid);
916 for (int i=0;i<nFixedGroups;i++) printf("%d ",fixGroups[i]); printf("\n");
917 }
918 swsup.Stop();
919 swsup.Print();
920 }
921 // ---------------------- Reject parameters with low statistics ------------<<
922 //
923 // add large number to diagonal of fixed params
8a9ab0eb 924 //
8a9ab0eb 925 for (int i=fNGloPar;i--;) { // // Reset row and column of fixed params and add 1/sig^2 to free ones
7c3070ec 926 // printf("#%3d : Nproc : %5d grp: %d\n",i,fProcPnt[i],fParamGrID[i]);
de34b538 927 if (fProcPnt[i]<1) {
8a9ab0eb 928 fNGloFix++;
8a9ab0eb 929 fVecBGlo[i] = 0.;
a8c5b94c 930 matCGlo.DiagElem(i) = 1.;//float(fNLocEquations*fNLocEquations);
e30a812f 931 // matCGlo.DiagElem(i) = float(fNLocEquations*fNLocEquations);
8a9ab0eb 932 }
de34b538 933 else matCGlo.DiagElem(i) += (fgWeightSigma ? fProcPnt[i] : 1.)/(fSigmaPar[i]*fSigmaPar[i]);
8a9ab0eb 934 }
935 //
de34b538 936 for (int i=fNGloPar;i--;) fDiagCGlo[i] = matCGlo.QueryDiag(i); // save the diagonal elements
937 //
8a9ab0eb 938 // add constraint equations
939 int nVar = fNGloPar; // Current size of global matrix
940 for (int i=0; i<fNGloConstraints; i++) {
941 ReadRecordConstraint(i);
942 double val = fRecord->GetValue(0);
de34b538 943 double sig = fRecord->GetValue(1);
8a9ab0eb 944 int *indV = fRecord->GetIndex()+2;
945 double *der = fRecord->GetValue()+2;
946 int csize = fRecord->GetSize()-2;
947 //
de34b538 948 // check if after suppression of fixed variables there are non-0 derivatives
949 // and determine the max statistics of involved params
950 int nSuppressed = 0;
951 int maxStat = 1;
952 for (int j=csize;j--;) {
953 if (fProcPnt[indV[j]]<1) nSuppressed++;
954 else {
955 maxStat = TMath::Max(maxStat,fProcPnt[indV[j]]);
956 }
957 }
8a9ab0eb 958 //
de34b538 959 if (nSuppressed==csize) {
960 // AliInfo(Form("Neglecting constraint %d of %d derivatives since no free parameters left",i,csize));
8a9ab0eb 961 //
962 // was this constraint ever created ?
de34b538 963 if ( sig==0 && fConstrUsed[i] ) { // this is needed only for constraints with Lagrange multiplier
8a9ab0eb 964 // to avoid empty row impose dummy constraint on "Lagrange multiplier"
de34b538 965 matCGlo.DiagElem(nVar) = 1.;
8a9ab0eb 966 fVecBGlo[nVar++] = 0;
967 }
968 continue;
969 }
970 //
de34b538 971 // account for already accumulated corrections
972 for (int j=csize; j--;) val -= der[j]*(fInitPar[ indV[j] ]+fDeltaPar[ indV[j] ]);
8a9ab0eb 973 //
de34b538 974 if (sig > 0) { // this is a gaussian constriant: no Lagrange multipliers are added
975 //
976 double sig2i = (fgWeightSigma ? TMath::Sqrt(maxStat) : 1.)/sig/sig;
977 for (int ir=0;ir<csize;ir++) {
978 int iID = indV[ir];
979 for (int ic=0;ic<=ir;ic++) { // matrix is symmetric
980 int jID = indV[ic];
981 double vl = der[ir]*der[ic]*sig2i;
cc9bec47 982 if (!IsZero(vl)) matCGlo(iID,jID) += vl;
de34b538 983 }
984 fVecBGlo[iID] += val*der[ir]*sig2i;
985 }
986 }
987 else { // this is exact constriant: Lagrange multipliers must be added
988 for (int j=csize; j--;) {
989 int jID = indV[j];
990 if (fProcPnt[jID]<1) continue; // this parameter was fixed, don't put it into constraint
991 matCGlo(nVar,jID) = float(fNLocEquations)*der[j]; // fMatCGlo is symmetric, only lower triangle is filled
992 }
993 //
994 if (matCGlo.QueryDiag(nVar)) matCGlo.DiagElem(nVar) = 0.0;
995 fVecBGlo[nVar++] = float(fNLocEquations)*val; //RS ? should we use here fNLocFits ?
996 fConstrUsed[i] = kTRUE;
997 }
8a9ab0eb 998 }
999 //
1000 AliInfo(Form("Obtained %-7ld equations from %-7ld records (%-7ld rejected). Fixed %-4d globals",
1001 fNLocEquations,fNLocFits,fNLocFitsRejected,fNGloFix));
1002
1003 //
de34b538 1004 sws.Start();
f9efbbf6 1005
1006 /*
1007 printf("Solving:\n");
1008 matCGlo.Print();
1009 for (int i=0;i<fNGloSize;i++) printf("b%2d : %+e\n",i,fVecBGlo[i]);
1010 */
8a9ab0eb 1011 fGloSolveStatus = SolveGlobalMatEq(); // obtain solution for this step
de34b538 1012 sws.Stop();
1013 printf("Solve %d |",fIter); sws.Print();
8a9ab0eb 1014 //
1015 sw.Stop();
1016 AliInfo(Form("Iteration#%2d %s. CPU time: %.1f",fIter,fGloSolveStatus==gkFailed ? "Failed":"Converged",sw.CpuTime()));
1017 if (fGloSolveStatus==gkFailed) return 0;
1018 //
1019 for (int i=fNGloPar;i--;) fDeltaPar[i] += fVecBGlo[i]; // Update global parameters values (for iterations)
1020 //
de34b538 1021 // PrintGlobalParameters();
8a9ab0eb 1022 return 1;
1023}
1024
1025//_____________________________________________________________________________________________
1026Int_t AliMillePede2::SolveGlobalMatEq()
1027{
1028 //
1029 // solve global matrix equation MatCGlob*X=VecBGlo and store the result in the VecBGlo
1030 //
de34b538 1031 /*
1032 printf("GlobalMatrix\n");
1033 fMatCGlo->Print();
1034 printf("RHS\n");
1035 for (int i=0;i<fNGloPar;i++) printf("%d %+e\n",i,fVecBGlo[i]);
1036 */
1037 //
8a9ab0eb 1038 if (!fgIsMatGloSparse) {
1039 //
de34b538 1040 if (fNLagrangeConstraints==0) { // pos-def systems are faster to solve by Cholesky
1041 if ( ((AliSymMatrix*)fMatCGlo)->SolveChol(fVecBGlo, fgInvChol) ) return fgInvChol ? gkInvert:gkNoInversion;
8a9ab0eb 1042 else AliInfo("Solution of Global Dense System by Cholesky failed, trying Gaussian Elimiation");
1043 }
1044 //
1045 if (((AliSymMatrix*)fMatCGlo)->SolveSpmInv(fVecBGlo, kTRUE)) return gkInvert;
e30a812f 1046 else AliInfo("Solution of Global Dense System by Gaussian Elimination failed, trying iterative methods");
8a9ab0eb 1047 }
1048 // try to solve by minres
de34b538 1049 TVectorD sol(fNGloSize);
8a9ab0eb 1050 //
1051 AliMinResSolve *slv = new AliMinResSolve(fMatCGlo,fVecBGlo);
1052 if (!slv) return gkFailed;
1053 //
1054 Bool_t res = kFALSE;
1055 if (fgIterSol == AliMinResSolve::kSolMinRes)
de34b538 1056 res = slv->SolveMinRes(sol,fgMinResCondType,fgMinResMaxIter,fgMinResTol);
8a9ab0eb 1057 else if (fgIterSol == AliMinResSolve::kSolFGMRes)
de34b538 1058 res = slv->SolveFGMRES(sol,fgMinResCondType,fgMinResMaxIter,fgMinResTol,fgNKrylovV);
8a9ab0eb 1059 else
1060 AliInfo(Form("Undefined Iteritive Solver ID=%d, only %d are defined",fgIterSol,AliMinResSolve::kNSolvers));
1061 //
e30a812f 1062 if (!res) {
1063 const char* faildump = "fgmr_failed.dat";
1064 int defout = dup(1);
c8f37c50 1065 if (defout<0) {
1066 AliInfo("Failed on dup");
1067 return gkFailed;
1068 }
642724dc 1069 int slvDump = open(faildump, O_RDWR|O_CREAT, 0666);
f9efbbf6 1070 if (slvDump>=0) {
1071 dup2(slvDump,1);
1072 //
1073 printf("#Failed to solve using solver %d with PreCond: %d MaxIter: %d Tol: %e NKrylov: %d\n",
1074 fgIterSol,fgMinResCondType,fgMinResMaxIter,fgMinResTol,fgNKrylovV);
1075 printf("#Dump of matrix:\n");
1076 fMatCGlo->Print("10");
1077 printf("#Dump of RHS:\n");
1078 for (int i=0;i<fNGloSize;i++) printf("%d %+.10f\n",i,fVecBGlo[i]);
1079 //
1080 dup2(defout,1);
1081 close(slvDump);
1082 close(defout);
1083 printf("#Dumped failed matrix and RHS to %s\n",faildump);
1084 }
1085 else AliInfo("Failed on file open for matrix dumping");
e30a812f 1086 return gkFailed;
1087 }
de34b538 1088 for (int i=fNGloSize;i--;) fVecBGlo[i] = sol[i];
1089 return gkNoInversion;
8a9ab0eb 1090 //
1091}
1092
1093//_____________________________________________________________________________________________
1094Float_t AliMillePede2::Chi2DoFLim(int nSig, int nDoF) const
1095{
1096 /// return the limit in chi^2/nd for n sigmas stdev authorized
1097 // Only n=1, 2, and 3 are expected in input
1098 int lNSig;
1099 float sn[3] = {0.47523, 1.690140, 2.782170};
1100 float table[3][30] = {{1.0000, 1.1479, 1.1753, 1.1798, 1.1775, 1.1730, 1.1680, 1.1630,
1101 1.1581, 1.1536, 1.1493, 1.1454, 1.1417, 1.1383, 1.1351, 1.1321,
1102 1.1293, 1.1266, 1.1242, 1.1218, 1.1196, 1.1175, 1.1155, 1.1136,
1103 1.1119, 1.1101, 1.1085, 1.1070, 1.1055, 1.1040},
1104 {4.0000, 3.0900, 2.6750, 2.4290, 2.2628, 2.1415, 2.0481, 1.9736,
1105 1.9124, 1.8610, 1.8171, 1.7791, 1.7457, 1.7161, 1.6897, 1.6658,
1106 1.6442, 1.6246, 1.6065, 1.5899, 1.5745, 1.5603, 1.5470, 1.5346,
1107 1.5230, 1.5120, 1.5017, 1.4920, 1.4829, 1.4742},
1108 {9.0000, 5.9146, 4.7184, 4.0628, 3.6410, 3.3436, 3.1209, 2.9468,
1109 2.8063, 2.6902, 2.5922, 2.5082, 2.4352, 2.3711, 2.3143, 2.2635,
1110 2.2178, 2.1764, 2.1386, 2.1040, 2.0722, 2.0428, 2.0155, 1.9901,
1111 1.9665, 1.9443, 1.9235, 1.9040, 1.8855, 1.8681}};
1112
1113 if (nDoF < 1) {
1114 return 0.0;
1115 }
1116 else {
1117 lNSig = TMath::Max(1,TMath::Min(nSig,3));
1118
1119 if (nDoF <= 30) {
1120 return table[lNSig-1][nDoF-1];
1121 }
1122 else { // approximation
1123 return ((sn[lNSig-1]+TMath::Sqrt(float(2*nDoF-3)))*
1124 (sn[lNSig-1]+TMath::Sqrt(float(2*nDoF-3))))/float(2*nDoF-2);
1125 }
1126 }
1127}
1128
1129//_____________________________________________________________________________________________
1130Int_t AliMillePede2::SetIterations(double lChi2CutFac)
1131{
1132 // Number of iterations is calculated from lChi2CutFac
1133 fChi2CutFactor = TMath::Max(1.0, lChi2CutFac);
1134 //
1135 AliInfo(Form("Initial cut factor is %f",fChi2CutFactor));
1136 fIter = 1; // Initializes the iteration process
1137 return 1;
1138}
1139
1140//_____________________________________________________________________________________________
1141Double_t AliMillePede2::GetParError(int iPar) const
1142{
1143 // return error for parameter iPar
1144 if (fGloSolveStatus==gkInvert) {
de34b538 1145 double res = fMatCGlo->QueryDiag(iPar);
8a9ab0eb 1146 if (res>=0) return TMath::Sqrt(res);
1147 }
1148 return -1.;
1149}
1150
1151
1152//_____________________________________________________________________________________________
1153Int_t AliMillePede2::PrintGlobalParameters() const
1154{
1155 /// Print the final results into the logfile
1156 double lError = 0.;
1157 double lGlobalCor =0.;
1158
1159 AliInfo("");
1160 AliInfo(" Result of fit for global parameters");
1161 AliInfo(" ===================================");
1162 AliInfo(" I initial final differ lastcor error gcor Npnt");
1163 AliInfo("----------------------------------------------------------------------------------------------");
1164 //
1165 for (int i=0; i<fNGloPar; i++) {
1166 lError = GetParError(i);
1167 lGlobalCor = 0.0;
1168 //
1169 double dg;
de34b538 1170 if (fGloSolveStatus==gkInvert && TMath::Abs( (dg=fMatCGlo->QueryDiag(i)) *fDiagCGlo[i]) > 0) {
8a9ab0eb 1171 lGlobalCor = TMath::Sqrt(TMath::Abs(1.0-1.0/(dg*fDiagCGlo[i])));
1172 AliInfo(Form("%d\t %.6f\t %.6f\t %.6f\t %.6f\t %.6f\t %.6f\t %6d",
1173 i,fInitPar[i],fInitPar[i]+fDeltaPar[i],fDeltaPar[i],fVecBGlo[i],lError,lGlobalCor,fProcPnt[i]));
1174 }
1175 else {
1176 AliInfo(Form("%d\t %.6f\t %.6f\t %.6f\t %.6f\t OFF\t OFF\t %6d",i,fInitPar[i],fInitPar[i]+fDeltaPar[i],
1177 fDeltaPar[i],fVecBGlo[i],fProcPnt[i]));
1178 }
1179 }
1180 return 1;
1181}
e30a812f 1182
1183//_____________________________________________________________________________________________
1184Bool_t AliMillePede2::IsRecordAcceptable() const
1185{
1186 // validate record according run lists set by the user
1a39bef4 1187 static Long_t prevRunID = kMaxInt;
e30a812f 1188 static Bool_t prevAns = kTRUE;
1189 Long_t runID = fRecord->GetRunID();
1190 if (runID!=prevRunID) {
1191 int n = 0;
1192 prevRunID = runID;
1193 // is run to be rejected?
1194 if (fRejRunList && (n=fRejRunList->GetSize())) {
1195 prevAns = kTRUE;
1196 for (int i=n;i--;) if (runID == (*fRejRunList)[i]) {
1197 prevAns = kFALSE;
1198 printf("New Run to reject: %ld -> %d\n",runID,prevAns);
1199 break;
1200 }
1201 }
1202 else if (fAccRunList && (n=fAccRunList->GetSize())) { // is run specifically selected
1203 prevAns = kFALSE;
1204 for (int i=n;i--;) if (runID == (*fAccRunList)[i]) {prevAns = kTRUE; break;}
1205 }
1206 }
1207 //
1208 return prevAns;
1209 //
1210}
1211
1212//_____________________________________________________________________________________________
1213void AliMillePede2::SetRejRunList(const UInt_t *runs, Int_t nruns)
1214{
1215 // set the list of runs to be rejected
1216 if (fRejRunList) delete fRejRunList;
1217 fRejRunList = 0;
1218 if (nruns<1 || !runs) return;
1219 fRejRunList = new TArrayL(nruns);
1220 for (int i=0;i<nruns;i++) (*fRejRunList)[i] = runs[i];
1221}
1222
1223//_____________________________________________________________________________________________
1224void AliMillePede2::SetAccRunList(const UInt_t *runs, Int_t nruns)
1225{
1226 // set the list of runs to be selected
1227 if (fAccRunList) delete fAccRunList;
1228 fAccRunList = 0;
1229 if (nruns<1 || !runs) return;
1230 fAccRunList = new TArrayL(nruns);
1231 for (int i=0;i<nruns;i++) (*fAccRunList)[i] = runs[i];
1232}