Test program for the class TUnfoldSys.
Simple toy tests of the TUnfold package
Pseudo data (5000 events) are unfolded into three components The unfolding is performed once without and once with area constraint
Ideally, the pulls may show that the result is biased if no constraint is applied. This is expected because the true data errors are not known, and instead the sqrt(data) errors are used.
TUnfold version is V17.9
toy iteration: 0
toy iteration: 10
toy iteration: 20
toy iteration: 30
toy iteration: 40
toy iteration: 50
toy iteration: 60
toy iteration: 70
toy iteration: 80
toy iteration: 90
toy iteration: 100
toy iteration: 110
toy iteration: 120
toy iteration: 130
toy iteration: 140
toy iteration: 150
toy iteration: 160
toy iteration: 170
toy iteration: 180
toy iteration: 190
toy iteration: 200
toy iteration: 210
toy iteration: 220
toy iteration: 230
toy iteration: 240
toy iteration: 250
toy iteration: 260
toy iteration: 270
toy iteration: 280
toy iteration: 290
toy iteration: 300
toy iteration: 310
toy iteration: 320
toy iteration: 330
toy iteration: 340
toy iteration: 350
toy iteration: 360
toy iteration: 370
toy iteration: 380
toy iteration: 390
toy iteration: 400
toy iteration: 410
toy iteration: 420
toy iteration: 430
toy iteration: 440
toy iteration: 450
toy iteration: 460
toy iteration: 470
toy iteration: 480
toy iteration: 490
toy iteration: 500
toy iteration: 510
toy iteration: 520
toy iteration: 530
toy iteration: 540
toy iteration: 550
toy iteration: 560
toy iteration: 570
toy iteration: 580
toy iteration: 590
toy iteration: 600
toy iteration: 610
toy iteration: 620
toy iteration: 630
toy iteration: 640
toy iteration: 650
toy iteration: 660
toy iteration: 670
toy iteration: 680
toy iteration: 690
toy iteration: 700
toy iteration: 710
toy iteration: 720
toy iteration: 730
toy iteration: 740
toy iteration: 750
toy iteration: 760
toy iteration: 770
toy iteration: 780
toy iteration: 790
toy iteration: 800
toy iteration: 810
toy iteration: 820
toy iteration: 830
toy iteration: 840
toy iteration: 850
toy iteration: 860
toy iteration: 870
toy iteration: 880
toy iteration: 890
toy iteration: 900
toy iteration: 910
toy iteration: 920
toy iteration: 930
toy iteration: 940
toy iteration: 950
toy iteration: 960
toy iteration: 970
toy iteration: 980
toy iteration: 990
****************************************
Minimizer is Minuit2 / Migrad
Chi2 = 17.3145
NDf = 12
Edm = 7.81966e-06
NCalls = 52
Constant = 153.648 +/- 6.05711
Mean = -0.121307 +/- 0.0338681
Sigma = 1.0209 +/- 0.0243688 (limited)
****************************************
Minimizer is Minuit2 / Migrad
Chi2 = 8.19808
NDf = 12
Edm = 2.68037e-06
NCalls = 53
Constant = 149.692 +/- 5.79204
Mean = -0.259587 +/- 0.0346952
Sigma = 1.05667 +/- 0.0243581 (limited)
****************************************
Minimizer is Minuit2 / Migrad
Chi2 = 59.2962
NDf = 12
Edm = 3.6247e-07
NCalls = 61
Constant = 127.75 +/- 5.41128
Mean = -0.482115 +/- 0.0490259
Sigma = 1.09744 +/- 0.0308576 (limited)
****************************************
Minimizer is Minuit2 / Migrad
Chi2 = 24.0114
NDf = 12
Edm = 3.60094e-06
NCalls = 53
Constant = 147.382 +/- 5.80116
Mean = 0.189905 +/- 0.0351528
Sigma = 1.05774 +/- 0.0251621 (limited)
****************************************
Minimizer is Minuit2 / Migrad
Chi2 = 17.3474
NDf = 12
Edm = 7.55094e-06
NCalls = 53
Constant = 149.977 +/- 5.77475
Mean = 0.201466 +/- 0.034281
Sigma = 1.04379 +/- 0.0232952 (limited)
****************************************
Minimizer is Minuit2 / Migrad
Chi2 = 66.0535
NDf = 12
Edm = 1.27624e-06
NCalls = 61
Constant = 124.004 +/- 5.38123
Mean = -0.412836 +/- 0.0498374
Sigma = 1.12618 +/- 0.0336756 (limited)
using std::cout;
}
}
} else {
}
}
{
{{1.0,2.0,1.5,0.,15.},
{1.0,7.0,2.5,0.,15.},
{0.0,0.0,0.0,0.,15.}};
for(
int i=0;i<
nGen;i++) {
}
if(!(
itoy %10)) cout<<
"toy iteration: "<<
itoy<<
"\n";
for(
Int_t i=0;i<nData;i++) {
}
}
unfold.ScanLcurve(50,0.,0.,
nullptr,
nullptr,
nullptr);
for(
int i=0;i<
nGen;i++) {
}
unfold.ScanLcurve(50,0.,0.,
nullptr,
nullptr,
nullptr);
for(
int i=0;i<
nGen;i++) {
}
}
for(
int i=0;i<
nGen;i++) {
}
for(
int i=0;i<
nGen;i++) {
}
output.SaveAs(
"testUnfold4.ps");
}
ROOT::Detail::TRangeCast< T, true > TRangeDynCast
TRangeDynCast is an adapter class that allows the typed iteration through a TCollection.
Int_t gErrorIgnoreLevel
Error handling routines.
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void char Point_t Rectangle_t WindowAttributes_t Float_t r
R__EXTERN TStyle * gStyle
1-D histogram with a double per channel (see TH1 documentation)
static void SetDefaultSumw2(Bool_t sumw2=kTRUE)
When this static function is called with sumw2=kTRUE, all new histograms will automatically activate ...
2-D histogram with a double per channel (see TH1 documentation)
Random number generator class based on M.
This is the base class for the ROOT Random number generators.
static TString Format(const char *fmt,...)
Static method which formats a string using a printf style format descriptor and return a TString.
void SetOptFit(Int_t fit=1)
The type of information about fit parameters printed in the histogram statistics box can be selected ...
An algorithm to unfold distributions from detector to truth level, with background subtraction and pr...
static const char * GetTUnfoldVersion(void)
return a string describing the TUnfold version
@ kEConstraintArea
enforce preservation of the area
@ kEConstraintNone
use no extra constraint
@ kRegModeSize
regularise the amplitude of the output distribution
@ kHistMapOutputHoriz
truth level on x-axis of the response matrix
Version 17.6, in parallel to changes in TUnfold
History:
- Version 17.5, in parallel to changes in TUnfold
- Version 17.4, in parallel to changes in TUnfold
- Version 17.3, in parallel to changes in TUnfold
- Version 17.2, in parallel to changes in TUnfold
- Version 17.1, in parallel to changes in TUnfold
- Version 16.1, parallel to changes in TUnfold
- Version 16.0, parallel to changes in TUnfold
- Version 15, use L-curve scan to scan the average correlation
This file is part of TUnfold.
TUnfold is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
TUnfold is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with TUnfold. If not, see http://www.gnu.org/licenses/.
- Author
- Stefan Schmitt DESY, 14.10.2008
Definition in file testUnfold4.C.