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.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 .