LSST Applications g0265f82a02+c6dfa2ddaf,g1162b98a3f+b2075782a9,g2079a07aa2+1b2e822518,g2bbee38e9b+c6dfa2ddaf,g337abbeb29+c6dfa2ddaf,g3ddfee87b4+a60788ef87,g50ff169b8f+2eb0e556e8,g52b1c1532d+90ebb246c7,g555ede804d+a60788ef87,g591dd9f2cf+ba8caea58f,g5ec818987f+864ee9cddb,g858d7b2824+9ee1ab4172,g876c692160+a40945ebb7,g8a8a8dda67+90ebb246c7,g8cdfe0ae6a+4fd9e222a8,g99cad8db69+5e309b7bc6,g9ddcbc5298+a1346535a5,ga1e77700b3+df8f93165b,ga8c6da7877+aa12a14d27,gae46bcf261+c6dfa2ddaf,gb0e22166c9+8634eb87fb,gb3f2274832+d0da15e3be,gba4ed39666+1ac82b564f,gbb8dafda3b+5dfd9c994b,gbeb006f7da+97157f9740,gc28159a63d+c6dfa2ddaf,gc86a011abf+9ee1ab4172,gcf0d15dbbd+a60788ef87,gdaeeff99f8+1cafcb7cd4,gdc0c513512+9ee1ab4172,ge79ae78c31+c6dfa2ddaf,geb67518f79+ba1859f325,geb961e4c1e+f9439d1e6f,gee10cc3b42+90ebb246c7,gf1cff7945b+9ee1ab4172,w.2024.12
LSST Data Management Base Package
|
Classes | |
class | BinomialMatrix |
A class that computes binomial coefficients up to a certain power. More... | |
Functions | |
int | computePackedOffset (int order) |
Compute the index of the first coefficient with the given order in a packed 2-d polynomial coefficient array. | |
int | computePackedSize (int order) |
Compute this size of a packed 2-d polynomial coefficient array. | |
void | computePowers (Eigen::VectorXd &r, double x) |
Fill an array with integer powers of x, so \($r[n] == r^n\). | |
Eigen::VectorXd | computePowers (double x, int n) |
Return an array with integer powers of x, so \($r[n] == r^n\). | |
|
inline |
Compute the index of the first coefficient with the given order in a packed 2-d polynomial coefficient array.
This defines the ordering as
(or the same with indices swapped).
Definition at line 45 of file polynomialUtils.h.
|
inline |
Compute this size of a packed 2-d polynomial coefficient array.
Definition at line 50 of file polynomialUtils.h.
Eigen::VectorXd lsst::meas::astrom::detail::computePowers | ( | double | x, |
int | n ) |
Return an array with integer powers of x, so \($r[n] == r^n\).
When multiple powers are needed, this should be signficantly faster than repeated calls to std::pow().
Definition at line 40 of file polynomialUtils.cc.
void lsst::meas::astrom::detail::computePowers | ( | Eigen::VectorXd & | r, |
double | x ) |
Fill an array with integer powers of x, so \($r[n] == r^n\).
When multiple powers are needed, this should be signficantly faster than repeated calls to std::pow().
Definition at line 33 of file polynomialUtils.cc.