MuonCalib::RtResolutionFromPoints Class Reference

#include <RtResolutionFromPoints.h>

Collaboration diagram for MuonCalib::RtResolutionFromPoints:

Public Member Functions
	RtResolutionFromPoints (void)
	Default constructor. More...

Static Public Member Functions
static RtResolutionChebyshev	getRtResolutionChebyshev (const std::vector< SamplePoint > &sample_points, const unsigned int &order)
	< get an RtResolutionChebyshev resembling the sigma(t) function as described by the sample points in the vector "sample_points"; use Chebyshev polynomials up to order "order"; x1 coordinate of the sample points contains the drift time, x2 the corresponding radius; the method takes the minimum and maximum x1 values in the set of sample points a lower and upper limits in RtResolutionChebyshev More...
static RtResolutionLookUp	getRtResolutionLookUp (const std::vector< SamplePoint > &sample_points)

Static Private Member Functions
static void	get_min_max (const std::vector< SamplePoint > &sample_points, double &x_min, double &x_max)

Detailed Description

Definition at line 30 of file RtResolutionFromPoints.h.

Constructor & Destructor Documentation

RtResolutionFromPoints()

MuonCalib::RtResolutionFromPoints::RtResolutionFromPoints ( void  )

inline

Default constructor.

Definition at line 33 of file RtResolutionFromPoints.h.

Member Function Documentation

get_min_max()

void RtResolutionFromPoints::get_min_max ( const std::vector< SamplePoint > &  sample_points, double &  x_min, double &  x_max  )

staticprivate

Definition at line 20 of file RtResolutionFromPoints.cxx.

                                                                                                                  {
    for (unsigned int k = 0; k < sample_points.size(); k++) {
        if (k == 0) {
            x_min = sample_points[k].x1();
            x_max = x_min;
        }
        if (x_min > sample_points[k].x1()) { x_min = sample_points[k].x1(); }
        if (x_max < sample_points[k].x1()) { x_max = sample_points[k].x1(); }
    }
 
    return;
}

getRtResolutionChebyshev()

RtResolutionChebyshev RtResolutionFromPoints::getRtResolutionChebyshev ( const std::vector< SamplePoint > &  sample_points, const unsigned int &  order  )

static

< get an RtResolutionChebyshev resembling the sigma(t) function as described by the sample points in the vector "sample_points"; use Chebyshev polynomials up to order "order"; x1 coordinate of the sample points contains the drift time, x2 the corresponding radius; the method takes the minimum and maximum x1 values in the set of sample points a lower and upper limits in RtResolutionChebyshev

get an RtResolutionLookUp resembling the sigma(t) function as described by the sample points in the vector "sample_points"; x1 coordinate of the sample points contains the drift time, x2 the corresponding radius; the method takes the minimum and maximum x1 values in the set of sample points a lower and upper limits in RtResolutionLookUp

Definition at line 38 of file RtResolutionFromPoints.cxx.

                                                                                                  {
    // VARIABLES //
    MsgStream log(Athena::getMessageSvc(), "RtResolutionChebyshev");
 
    std::vector<double> res_param(order + 3);           // input parameters of RtChebyshev
    BaseFunctionFitter fitter(order + 1);               // Chebyshev fitter
    ChebyshevPolynomial chebyshev;                      // Chebyshev polynomial
    std::vector<SamplePoint> my_points(sample_points);  // copy of the sample to add reduced times
 
    // GET THE MINIMUM AND MAXIMUM TIMES AND CALCULATE REDUCED TIMES //
    get_min_max(sample_points, res_param[0], res_param[1]);
 
    double mean(0.5 * (res_param[1] + res_param[0]));
    double length(res_param[1] - res_param[0]);
    for (unsigned int k = 0; k < my_points.size(); k++) { my_points[k].set_x1(2 * (sample_points[k].x1() - mean) / length); }
 
    // PERFORM A CHEBYSHEV FIT TO THE SAMPLE POINTS //
    if (fitter.fit_parameters(my_points, 1, sample_points.size(), &chebyshev)) {
        log << MSG::WARNING << "Could not determine Chebyshev coefficients." << endmsg;
    }
    for (unsigned int k = 0; k < order + 1; k++) { res_param[k + 2] = fitter.coefficients()[k]; }
 
    // CREATE AN RtChebyshev OBJECT WITH THE CORRECT PARAMETERS //
    RtResolutionChebyshev rt_res_chebyshev(res_param);
 
    return rt_res_chebyshev;
}

getRtResolutionLookUp()

RtResolutionLookUp RtResolutionFromPoints::getRtResolutionLookUp ( const std::vector< SamplePoint > &  sample_points )

static

Definition at line 80 of file RtResolutionFromPoints.cxx.

                                                                                                            {
    // VARIABLES //
    RtResolutionChebyshev res(getRtResolutionChebyshev(sample_points, 8));             // auxiliary resolution-t
    unsigned int nb_points(100);                                                       // number of (r, t) points
    double bin_width((res.tUpper() - res.tLower()) / static_cast<double>(nb_points));  // step size
    std::vector<double> res_param(nb_points + 2);                                      // r-t parameters
 
    // CREATE AN RtRelationLookUp OBJECT WITH THE CORRECT PARAMETERS //
    res_param[0] = res.tLower();
    res_param[1] = bin_width;
    for (unsigned int k = 0; k < nb_points; k++) { res_param[k + 2] = res.resolution(res.tLower() + k * bin_width); }
    RtResolutionLookUp rt_res_relation_look_up(res_param);
 
    return rt_res_relation_look_up;
}

---

The documentation for this class was generated from the following files:

• RtResolutionFromPoints.h
• RtResolutionFromPoints.cxx