LSSTApplications  17.0+11,17.0+34,17.0+56,17.0+57,17.0+59,17.0+7,17.0-1-g377950a+33,17.0.1-1-g114240f+2,17.0.1-1-g4d4fbc4+28,17.0.1-1-g55520dc+49,17.0.1-1-g5f4ed7e+52,17.0.1-1-g6dd7d69+17,17.0.1-1-g8de6c91+11,17.0.1-1-gb9095d2+7,17.0.1-1-ge9fec5e+5,17.0.1-1-gf4e0155+55,17.0.1-1-gfc65f5f+50,17.0.1-1-gfc6fb1f+20,17.0.1-10-g87f9f3f+1,17.0.1-11-ge9de802+16,17.0.1-16-ga14f7d5c+4,17.0.1-17-gc79d625+1,17.0.1-17-gdae4c4a+8,17.0.1-2-g26618f5+29,17.0.1-2-g54f2ebc+9,17.0.1-2-gf403422+1,17.0.1-20-g2ca2f74+6,17.0.1-23-gf3eadeb7+1,17.0.1-3-g7e86b59+39,17.0.1-3-gb5ca14a,17.0.1-3-gd08d533+40,17.0.1-30-g596af8797,17.0.1-4-g59d126d+4,17.0.1-4-gc69c472+5,17.0.1-6-g5afd9b9+4,17.0.1-7-g35889ee+1,17.0.1-7-gc7c8782+18,17.0.1-9-gc4bbfb2+3,w.2019.22
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 .