LSST Applications 30.0.7,g0e76e35be5+e8e946ae08,g19811a7679+138f7293ba,g199a45376c+5e234f8357,g1fd858c14a+2f48dbc4c4,g262e1987ae+fb36cac54d,g29ae962dfc+d9108a0941,g2c21b0017a+4f59a27f16,g31e44d4a5c+b0138be388,g33ac35c1f1+28b9f72785,g35bb328faa+b0138be388,g40c9b15c53+823ad735c1,g47891489e3+bcc48a0b46,g53246c7159+b0138be388,g64539dfbff+e8e946ae08,g67b6fd64d1+bcc48a0b46,g74acd417e5+422380537a,g76965917b2+a5ca99c4d9,g786e29fd12+796b79145d,g7aefaa3e3d+dc0c200193,g86b635cae8+734fe384f0,g87389fa792+d8b5378923,g89139ef638+bcc48a0b46,g8bbb235e95+3f4f7f9447,g8ea07a8fe4+78a4c88802,g9290983e33+ffdc83c6f7,g92c671f44c+e8e946ae08,gaa753fd333+03f406da14,gbf99507273+b0138be388,gc49b57b85e+8df26ee1f0,gca7fc764a6+bcc48a0b46,gd7ef33dd92+bcc48a0b46,gdab6d2f7ff+422380537a,ge1c02a5578+b0138be388,ge410e46f29+bcc48a0b46,ge80df9fc40+e6db5413d1,geaed405ab2+1de65a85c6,gf5dcc679e7+35a0ce2edd,gf5f1c85443+e8e946ae08
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 .