LSSTApplications  16.0-10-g0ee56ad+5,16.0-11-ga33d1f2+5,16.0-12-g3ef5c14+3,16.0-12-g71e5ef5+18,16.0-12-gbdf3636+3,16.0-13-g118c103+3,16.0-13-g8f68b0a+3,16.0-15-gbf5c1cb+4,16.0-16-gfd17674+3,16.0-17-g7c01f5c+3,16.0-18-g0a50484+1,16.0-20-ga20f992+8,16.0-21-g0e05fd4+6,16.0-21-g15e2d33+4,16.0-22-g62d8060+4,16.0-22-g847a80f+4,16.0-25-gf00d9b8+1,16.0-28-g3990c221+4,16.0-3-gf928089+3,16.0-32-g88a4f23+5,16.0-34-gd7987ad+3,16.0-37-gc7333cb+2,16.0-4-g10fc685+2,16.0-4-g18f3627+26,16.0-4-g5f3a788+26,16.0-5-gaf5c3d7+4,16.0-5-gcc1f4bb+1,16.0-6-g3b92700+4,16.0-6-g4412fcd+3,16.0-6-g7235603+4,16.0-69-g2562ce1b+2,16.0-8-g14ebd58+4,16.0-8-g2df868b+1,16.0-8-g4cec79c+6,16.0-8-gadf6c7a+1,16.0-8-gfc7ad86,16.0-82-g59ec2a54a+1,16.0-9-g5400cdc+2,16.0-9-ge6233d7+5,master-g2880f2d8cf+3,v17.0.rc1
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 .