LSSTApplications  18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
LSSTDataManagementBasePackage
polynomialUtils.h
Go to the documentation of this file.
1 // -*- LSST-C++ -*-
2 
3 /*
4  * LSST Data Management System
5  * Copyright 2016 LSST/AURA
6  *
7  * This product includes software developed by the
8  * LSST Project (http://www.lsst.org/).
9  *
10  * This program is free software: you can redistribute it and/or modify
11  * it under the terms of the GNU General Public License as published by
12  * the Free Software Foundation, either version 3 of the License, or
13  * (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU General Public License for more details.
19  *
20  * You should have received a copy of the LSST License Statement and
21  * the GNU General Public License along with this program. If not,
22  * see <http://www.lsstcorp.org/LegalNotices/>.
23  */
24 
25 #ifndef LSST_MEAS_ASTROM_DETAIL_polynomialUtils_h_INCLUDED
26 #define LSST_MEAS_ASTROM_DETAIL_polynomialUtils_h_INCLUDED
27 
28 #include "Eigen/Core"
29 
30 namespace lsst {
31 namespace meas {
32 namespace astrom {
33 namespace detail {
34 
45 inline int computePackedOffset(int order) { return (order * (order + 1)) / 2; }
46 
50 inline int computePackedSize(int order) { return computePackedOffset(order + 1); }
51 
58 void computePowers(Eigen::VectorXd& r, double x);
59 
66 Eigen::VectorXd computePowers(double x, int n);
67 
85 public:
90  explicit BinomialMatrix(int const nMax) { extend(nMax); }
91 
101  double operator()(int n, int k) const { return getMatrix()(n, k); }
102 
103 private:
104  static void extend(int const n);
105 
106  static Eigen::MatrixXd& getMatrix();
107 };
108 
109 } // namespace detail
110 } // namespace astrom
111 } // namespace meas
112 } // namespace lsst
113 
114 #endif // !LSST_MEAS_ASTROM_DETAIL_polynomialUtils_h_INCLUDED
BinomialMatrix(int const nMax)
Construct an object that can compute binomial coefficients with up to and including the given value...
A class that computes binomial coefficients up to a certain power.
int computePackedSize(int order)
Compute this size of a packed 2-d polynomial coefficient array.
A base class for image defects.
int computePackedOffset(int order)
Compute the index of the first coefficient with the given order in a packed 2-d polynomial coefficien...
double x
double operator()(int n, int k) const
Return the binomial coefficient.
void computePowers(Eigen::VectorXd &r, double x)
Fill an array with integer powers of x, so .