LSSTApplications
20.0.0
LSSTDataManagementBasePackage
|
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. More... | |
int | computePackedSize (int order) |
Compute this size of a packed 2-d polynomial coefficient array. More... | |
void | computePowers (Eigen::VectorXd &r, double x) |
Fill an array with integer powers of x, so \($r[n] == r^n\). More... | |
Eigen::VectorXd | computePowers (double x, int n) |
Return an array with integer powers of x, so \($r[n] == r^n\). More... | |
|
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.