LSSTApplications  11.0-13-gbb96280,12.1+18,12.1+7,12.1-1-g14f38d3+72,12.1-1-g16c0db7+5,12.1-1-g5961e7a+84,12.1-1-ge22e12b+23,12.1-11-g06625e2+4,12.1-11-g0d7f63b+4,12.1-19-gd507bfc,12.1-2-g7dda0ab+38,12.1-2-gc0bc6ab+81,12.1-21-g6ffe579+2,12.1-21-gbdb6c2a+4,12.1-24-g941c398+5,12.1-3-g57f6835+7,12.1-3-gf0736f3,12.1-37-g3ddd237,12.1-4-gf46015e+5,12.1-5-g06c326c+20,12.1-5-g648ee80+3,12.1-5-gc2189d7+4,12.1-6-ga608fc0+1,12.1-7-g3349e2a+5,12.1-7-gfd75620+9,12.1-9-g577b946+5,12.1-9-gc4df26a+10
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 { namespace meas { namespace astrom { namespace detail {
29 
30 void computePowers(Eigen::VectorXd & r, double x) {
31  r[0] = 1.0;
32  for (int i = 1; i < r.size(); ++i) {
33  r[i] = r[i - 1] * x;
34  }
35 }
36 
37 Eigen::VectorXd computePowers(double x, int n) {
38  Eigen::VectorXd r(n + 1);
39  computePowers(r, x);
40  return r;
41 }
42 
43 void BinomialMatrix::extend(int const n) {
44  static std::mutex mutex;
45  auto & old = getMatrix();
46  int const m = old.rows() - 1;
47  if (n <= m) return;
48  Eigen::MatrixXd updated = Eigen::MatrixXd::Zero(n + 1, n + 1);
49  updated.topLeftCorner(old.rows(), old.cols()) = old;
50  for (int i = m + 1; i <= n; ++i) {
51  updated(i, 0) = 1.0;
52  updated(i, i) = 1.0;
53  for (int j = 1; j < i; ++j) {
54  updated(i, j) = updated(i - 1, j - 1) *
55  (static_cast<double>(i) / static_cast<double>(j));
56  }
57  }
58  std::unique_lock<std::mutex> lock(mutex);
59  old.swap(updated);
60 }
61 
62 Eigen::MatrixXd & BinomialMatrix::getMatrix() {
63  static Eigen::MatrixXd it = Eigen::MatrixXd::Constant(2, 2, 1.0);
64  return it;
65 }
66 
67 }}}} // namespace lsst::meas::astrom::detail
metadata import lsst afw display as afwDisplay n
double x
tuple m
Definition: lsstimport.py:48
void computePowers(Eigen::VectorXd &r, double x)
Fill an array with integer powers of x, so .