LSSTApplications  18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
LSSTDataManagementBasePackage
GaussHermiteEvaluator.h
Go to the documentation of this file.
1 // -*- LSST-C++ -*-
2 
3 /*
4  * LSST Data Management System
5  * Copyright 2008, 2009, 2010, 2011 LSST Corporation.
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 #ifndef LSST_AFW_MATH_SHAPELETS_HERMITEEVALUATOR_H
26 #define LSST_AFW_MATH_SHAPELETS_HERMITEEVALUATOR_H
27 
28 #include "ndarray.h"
29 #include "lsst/geom.h"
31 #include "Eigen/Core"
32 
33 namespace lsst { namespace shapelet {
34 
48 class PackedIndex {
49 public:
50 
51  static int const computeOffset(int order) { return order*(order+1)/2; }
52  static int const computeIndex(int x, int y) { return computeOffset(x+y) + x; }
53 
55  ++_i;
56  if (--_y < 0) {
57  _x = 0;
58  _y = ++_n;
59  } else {
60  ++_x;
61  }
62  return *this;
63  }
64 
65  int const getOrder() const { return _n; }
66  int const getX() const { return _x; }
67  int const getY() const { return _y; }
68 
69  int const getIndex() const { return _i; }
70 
71  PackedIndex() : _n(0), _i(0), _x(0), _y(0) {}
72  PackedIndex(int const x, int const y) : _n(x+y), _i(computeOffset(_n) + x), _x(x), _y(y) {}
73 
74 private:
75  int _n;
76  int _i;
77  int _x;
78  int _y;
79 };
80 
85 public:
86 
95  static Eigen::MatrixXd computeInnerProductMatrix(
96  int rowOrder, int colOrder, double a, double b
97  );
98 
99  int getOrder() const { return _xWorkspace.getSize<0>() - 1; }
100 
105  void fillEvaluation(
106  Array1d const & target, double x, double y,
107  Array1d const & dx = Array1d(),
108  Array1d const & dy = Array1d()
109  ) const;
110 
116  Array1d const & target, geom::Point2D const & point,
117  Array1d const & dx = Array1d(),
118  Array1d const & dy = Array1d()
119  ) const {
120  fillEvaluation(target, point.getX(), point.getY(), dx, dy);
121  }
122 
128  Array1d const & target, geom::Extent2D const & point,
129  Array1d const & dx = Array1d(),
130  Array1d const & dy = Array1d()
131  ) const {
132  fillEvaluation(target, point.getX(), point.getY(), dx, dy);
133  }
134 
139  void fillIntegration(Array1d const & target, int xMoment=0, int yMoment=0) const;
140 
144  double sumEvaluation(
145  ndarray::Array<double const,1> const & coeff, double x, double y,
146  double * dx = 0, double * dy = 0
147  ) const;
148 
153  ndarray::Array<double const,1> const & coeff, geom::Point2D const & point,
154  double * dx = 0, double * dy = 0
155  ) const {
156  return sumEvaluation(coeff, point.getX(), point.getY(), dx, dy);
157  }
158 
163  ndarray::Array<double const,1> const & coeff, geom::Extent2D const & point,
164  double * dx = 0, double * dy = 0
165  ) const {
166  return sumEvaluation(coeff, point.getX(), point.getY(), dx, dy);
167  }
168 
172  double sumIntegration(ndarray::Array<double const,1> const & coeff, int xMoment=0, int yMoment=0) const;
173 
174  explicit GaussHermiteEvaluator(int order);
175 
176 private:
177 
178  ndarray::Array<double,1,1> _xWorkspace;
179  ndarray::Array<double,1,1> _yWorkspace;
180  ndarray::Array<double,1,1> _dxWorkspace;
181  ndarray::Array<double,1,1> _dyWorkspace;
182 };
183 
184 }} // namespace lsst::shapelet
185 
186 #endif // !defined(LSST_AFW_MATH_SHAPELETS_HERMITEEVALUATOR_H)
ndarray::Array< double, 1 > Array1d
Typedef for a commonly-used array type.
Definition: constants.h:121
An iterator-like object to help in traversing "packed" shapelet or Hermite polynomial matrix or vecto...
static int const computeOffset(int order)
void fillEvaluation(Array1d const &target, geom::Point2D const &point, Array1d const &dx=Array1d(), Array1d const &dy=Array1d()) const
Fill a vector whose dot product with a HERMITE coefficient vector evaluates a simple unscaled shapele...
Key< Flag > const & target
table::Key< int > b
A class to evaluate HERMITE shapelet-related quantities.
int y
Definition: SpanSet.cc:49
table::Key< int > a
double sumEvaluation(ndarray::Array< double const, 1 > const &coeff, geom::Extent2D const &point, double *dx=0, double *dy=0) const
Evaluate a simple unscaled shapelet expansion at the given point.
PackedIndex(int const x, int const y)
A base class for image defects.
static int const computeIndex(int x, int y)
void fillEvaluation(Array1d const &target, geom::Extent2D const &point, Array1d const &dx=Array1d(), Array1d const &dy=Array1d()) const
Fill a vector whose dot product with a HERMITE coefficient vector evaluates a simple unscaled shapele...
double x
double sumEvaluation(ndarray::Array< double const, 1 > const &coeff, geom::Point2D const &point, double *dx=0, double *dy=0) const
Evaluate a simple unscaled shapelet expansion at the given point.
table::Key< table::Array< double > > coeff
Definition: PsfexPsf.cc:362
Constants, typedefs, and general-purpose functions for shapelets library.