File polynomialUtils.h¶
-
namespace
lsst Class for a simple mapping implementing a generic AstrometryTransform.
Remove all non-astronomical counts from the Chunk Exposure’s pixels.
Forward declarations for lsst::utils::Cache
For details on the Cache class, see the Cache.h file.
It uses a template rather than a pointer so that the derived classes can use the specifics of the transform. The class simplePolyMapping overloads a few routines.
A base class for image defects
Numeric constants used by the Integrate.h integrator routines.
Compute Image Statistics
- Note
Gauss-Kronrod-Patterson quadrature coefficients for use in quadpack routine qng. These coefficients were calculated with 101 decimal digit arithmetic by L. W. Fullerton, Bell Labs, Nov 1981.
- Note
The Statistics class itself can only handle lsst::afw::image::MaskedImage() types. The philosophy has been to handle other types by making them look like lsst::afw::image::MaskedImage() and reusing that code. Users should have no need to instantiate a Statistics object directly, but should use the overloaded makeStatistics() factory functions.
-
namespace
meas -
namespace
astrom -
namespace
detail¶ Functions
-
int
computePackedOffset(int order)¶ 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).[(0,0), (0,1), (1,0), (0,2), (1,1), (2,0), ...]
-
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\).
When multiple powers are needed, this should be signficantly faster than repeated calls to std::pow().
-
Eigen::VectorXd
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().
-
class
BinomialMatrix - #include <polynomialUtils.h>
A class that computes binomial coefficients up to a certain power.
The binomial coefficient is defined as:
\[ \left(\begin{array}{ c } n k \end{array}right\) = \frac{n!}{k!(n-k)!} \]with both \(n\) and \(k\) nonnegative integers and \(k \le n\)This class uses recurrence relations to avoid computing factorials directly, making it both more efficient and numerically stable.
Public Functions
-
BinomialMatrix(int const nMax) Construct an object that can compute binomial coefficients with \(n\) up to and including the given value.
-
double
operator()(int n, int k) const Return the binomial coefficient.
No error checking is performed; the behavior of this method is is undefined if the given values do not satisfy
n <= nMax && k <= n && n >=0 && k >= 0
-
-
int
-
namespace
-
namespace