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.cc
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 #include <mutex>
27 
28 namespace lsst {
29 namespace meas {
30 namespace astrom {
31 namespace detail {
32 
33 void computePowers(Eigen::VectorXd& r, double x) {
34  r[0] = 1.0;
35  for (int i = 1; i < r.size(); ++i) {
36  r[i] = r[i - 1] * x;
37  }
38 }
39 
40 Eigen::VectorXd computePowers(double x, int n) {
41  Eigen::VectorXd r(n + 1);
42  computePowers(r, x);
43  return r;
44 }
45 
46 void BinomialMatrix::extend(int const n) {
47  static std::mutex mutex;
48  auto& old = getMatrix();
49  int const m = old.rows() - 1;
50  if (n <= m) return;
51  Eigen::MatrixXd updated = Eigen::MatrixXd::Zero(n + 1, n + 1);
52  updated.topLeftCorner(old.rows(), old.cols()) = old;
53  for (int i = m + 1; i <= n; ++i) {
54  updated(i, 0) = 1.0;
55  updated(i, i) = 1.0;
56  for (int j = 1; j < i; ++j) {
57  updated(i, j) = updated(i - 1, j - 1) * (static_cast<double>(i) / static_cast<double>(j));
58  }
59  }
60  std::unique_lock<std::mutex> lock(mutex);
61  old.swap(updated);
62 }
63 
64 Eigen::MatrixXd& BinomialMatrix::getMatrix() {
65  static Eigen::MatrixXd it = Eigen::MatrixXd::Constant(2, 2, 1.0);
66  return it;
67 }
68 
69 } // namespace detail
70 } // namespace astrom
71 } // namespace meas
72 } // namespace lsst
A base class for image defects.
double x
int m
Definition: SpanSet.cc:49
void computePowers(Eigen::VectorXd &r, double x)
Fill an array with integer powers of x, so .