LSST Applications g00274db5b6+edbf708997,g00d0e8bbd7+edbf708997,g199a45376c+5137f08352,g1fd858c14a+1d4b6db739,g262e1987ae+f4d9505c4f,g29ae962dfc+7156fb1a53,g2cef7863aa+73c82f25e4,g35bb328faa+edbf708997,g3e17d7035e+5b3adc59f5,g3fd5ace14f+852fa6fbcb,g47891489e3+6dc8069a4c,g53246c7159+edbf708997,g64539dfbff+9f17e571f4,g67b6fd64d1+6dc8069a4c,g74acd417e5+ae494d68d9,g786e29fd12+af89c03590,g7ae74a0b1c+a25e60b391,g7aefaa3e3d+536efcc10a,g7cc15d900a+d121454f8d,g87389fa792+a4172ec7da,g89139ef638+6dc8069a4c,g8d7436a09f+28c28d8d6d,g8ea07a8fe4+db21c37724,g92c671f44c+9f17e571f4,g98df359435+b2e6376b13,g99af87f6a8+b0f4ad7b8d,gac66b60396+966efe6077,gb88ae4c679+7dec8f19df,gbaa8f7a6c5+38b34f4976,gbf99507273+edbf708997,gc24b5d6ed1+9f17e571f4,gca7fc764a6+6dc8069a4c,gcc769fe2a4+97d0256649,gd7ef33dd92+6dc8069a4c,gdab6d2f7ff+ae494d68d9,gdbb4c4dda9+9f17e571f4,ge410e46f29+6dc8069a4c,geaed405ab2+e194be0d2b,w.2025.47
LSST Data Management Base Package
Loading...
Searching...
No Matches
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
28namespace lsst {
29namespace meas {
30namespace astrom {
31namespace detail {
32
33void 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
40Eigen::VectorXd computePowers(double x, int n) {
41 Eigen::VectorXd r(n + 1);
42 computePowers(r, x);
43 return r;
44}
45
46void 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 }
61 old.swap(updated);
62}
63
64Eigen::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
void computePowers(Eigen::VectorXd &r, double x)
Fill an array with integer powers of x, so .