LSSTApplications
17.0+11,17.0+34,17.0+56,17.0+57,17.0+59,17.0+7,17.0-1-g377950a+33,17.0.1-1-g114240f+2,17.0.1-1-g4d4fbc4+28,17.0.1-1-g55520dc+49,17.0.1-1-g5f4ed7e+52,17.0.1-1-g6dd7d69+17,17.0.1-1-g8de6c91+11,17.0.1-1-gb9095d2+7,17.0.1-1-ge9fec5e+5,17.0.1-1-gf4e0155+55,17.0.1-1-gfc65f5f+50,17.0.1-1-gfc6fb1f+20,17.0.1-10-g87f9f3f+1,17.0.1-11-ge9de802+16,17.0.1-16-ga14f7d5c+4,17.0.1-17-gc79d625+1,17.0.1-17-gdae4c4a+8,17.0.1-2-g26618f5+29,17.0.1-2-g54f2ebc+9,17.0.1-2-gf403422+1,17.0.1-20-g2ca2f74+6,17.0.1-23-gf3eadeb7+1,17.0.1-3-g7e86b59+39,17.0.1-3-gb5ca14a,17.0.1-3-gd08d533+40,17.0.1-30-g596af8797,17.0.1-4-g59d126d+4,17.0.1-4-gc69c472+5,17.0.1-6-g5afd9b9+4,17.0.1-7-g35889ee+1,17.0.1-7-gc7c8782+18,17.0.1-9-gc4bbfb2+3,w.2019.22
LSSTDataManagementBasePackage
|
A class that computes a matrix that applies a linear transform to a 2-d Hermite polynomial expansion. More...
#include <HermiteTransformMatrix.h>
Public Member Functions | |
Eigen::MatrixXd | compute (Eigen::Matrix2d const &transform) const |
Compute the matrix for a new linear transform. More... | |
Eigen::MatrixXd | compute (afw::geom::LinearTransform const &transform) const |
Compute the matrix for a new linear transform. More... | |
Eigen::MatrixXd | compute (Eigen::Matrix2d const &transform, int order) const |
Compute the matrix for a new linear transform at the given order (must be <= getOrder()). More... | |
Eigen::MatrixXd | compute (afw::geom::LinearTransform const &transform, int order) const |
Compute the matrix for a new linear transform at the given order (must be <= getOrder()). More... | |
Eigen::MatrixXd | getCoefficientMatrix () const |
Return the matrix that maps (1-d) regular polynomials to the alternate Hermite polynomials. More... | |
Eigen::MatrixXd | getInverseCoefficientMatrix () const |
Return the matrix that maps (1-d) alternate Hermite polynomials to regular polynomials. More... | |
int | getOrder () const |
Return the maximum order at which the matrix can be computed. More... | |
HermiteTransformMatrix (int order) | |
Construct an instance able to compute the transform matrix at up to the given order. More... | |
A class that computes a matrix that applies a linear transform to a 2-d Hermite polynomial expansion.
Let
\[ Z_{\boldsymbol{n}}\!(\boldsymbol{x}) \equiv \mathcal{H}_{n_0}\!(x_0)\;\mathcal{H}_{n_1}\!(x_1) \]
where
\[ \mathcal{H}_n(x)=(2^n \pi^{1/2} n!)^{-1/2}H_n(x) \]
is the \(i\)th "alternate" Hermite polynomial. This function computes the matrix \(\boldsymbol{Q}(\boldsymbol{U})\) given a linear transform \(\boldsymbol{U}\) such that
\[ Z_{\boldsymbol{m}}\!(\boldsymbol{U}\boldsymbol{x}) = \sum_{\boldsymbol{n}} Q_{\boldsymbol{m},\boldsymbol{n}}\!(\boldsymbol{U})\,Z_{\boldsymbol{n}}\!(\boldsymbol{x}) \]
Definition at line 54 of file HermiteTransformMatrix.h.
|
explicit |
Construct an instance able to compute the transform matrix at up to the given order.
|
inline |
Compute the matrix for a new linear transform.
Definition at line 58 of file HermiteTransformMatrix.h.
|
inline |
Compute the matrix for a new linear transform.
Definition at line 63 of file HermiteTransformMatrix.h.
Eigen::MatrixXd lsst::shapelet::HermiteTransformMatrix::compute | ( | Eigen::Matrix2d const & | transform, |
int | order | ||
) | const |
Compute the matrix for a new linear transform at the given order (must be <= getOrder()).
|
inline |
Compute the matrix for a new linear transform at the given order (must be <= getOrder()).
Definition at line 71 of file HermiteTransformMatrix.h.
|
inline |
Return the matrix that maps (1-d) regular polynomials to the alternate Hermite polynomials.
The matrix is always lower triangular, and has size equal to getOrder()+1.
Definition at line 80 of file HermiteTransformMatrix.h.
|
inline |
Return the matrix that maps (1-d) alternate Hermite polynomials to regular polynomials.
The matrix is always lower triangular, and has size equal to getOrder()+1.
Definition at line 87 of file HermiteTransformMatrix.h.
|
inline |
Return the maximum order at which the matrix can be computed.
Definition at line 90 of file HermiteTransformMatrix.h.