LSSTApplications  17.0+124,17.0+14,17.0+73,18.0.0+37,18.0.0+80,18.0.0-4-g68ffd23+4,18.1.0-1-g0001055+12,18.1.0-1-g03d53ef+5,18.1.0-1-g1349e88+55,18.1.0-1-g2505f39+44,18.1.0-1-g5315e5e+4,18.1.0-1-g5e4b7ea+14,18.1.0-1-g7e8fceb+4,18.1.0-1-g85f8cd4+48,18.1.0-1-g8ff0b9f+4,18.1.0-1-ga2c679d+1,18.1.0-1-gd55f500+35,18.1.0-10-gb58edde+2,18.1.0-11-g0997b02+4,18.1.0-13-gfe4edf0b+12,18.1.0-14-g259bd21+21,18.1.0-19-gdb69f3f+2,18.1.0-2-g5f9922c+24,18.1.0-2-gd3b74e5+11,18.1.0-2-gfbf3545+32,18.1.0-26-g728bddb4+5,18.1.0-27-g6ff7ca9+2,18.1.0-3-g52aa583+25,18.1.0-3-g8ea57af+9,18.1.0-3-gb69f684+42,18.1.0-3-gfcaddf3+6,18.1.0-32-gd8786685a,18.1.0-4-gf3f9b77+6,18.1.0-5-g1dd662b+2,18.1.0-5-g6dbcb01+41,18.1.0-6-gae77429+3,18.1.0-7-g9d75d83+9,18.1.0-7-gae09a6d+30,18.1.0-9-gc381ef5+4,w.2019.45
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 .