LSST Applications g013ef56533+7c9321ec0f,g042eb84c57+c6cfa41bc3,g199a45376c+0ba108daf9,g1fd858c14a+fcad0d0313,g210f2d0738+c0f94c6586,g262e1987ae+a7e710680e,g29ae962dfc+fb55f2edb0,g2ac17093b6+61d6563b1e,g2b1d02342f+df6f932764,g2cef7863aa+aef1011c0b,g2f7ad74990+c0f94c6586,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+53cf87ae69,g47891489e3+4316d04fff,g511e8cfd20+baa56acf6c,g53246c7159+8c5ae1fdc5,g54cd7ddccb+fd7ad03fde,g64539dfbff+c0f94c6586,g67b6fd64d1+4316d04fff,g67fd3c3899+c0f94c6586,g6985122a63+4316d04fff,g74acd417e5+ca833bee28,g786e29fd12+668abc6043,g81db2e9a8d+b2ec8e584f,g87389fa792+8856018cbb,g89139ef638+4316d04fff,g8d7436a09f+0a24083b20,g8ea07a8fe4+760ca7c3fc,g90f42f885a+033b1d468d,g97be763408+11eb8fd5b8,gbf99507273+8c5ae1fdc5,gcdda8b9158+e4c84c9d5c,gce8aa8abaa+8c5ae1fdc5,gd7ef33dd92+4316d04fff,gdab6d2f7ff+ca833bee28,ge410e46f29+4316d04fff,geaed405ab2+c4bbc419c6,gf9a733ac38+8c5ae1fdc5,w.2025.40
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 .