LSST Applications g0b6bd0c080+a72a5dd7e6,g1182afd7b4+2a019aa3bb,g17e5ecfddb+2b8207f7de,g1d67935e3f+06cf436103,g38293774b4+ac198e9f13,g396055baef+6a2097e274,g3b44f30a73+6611e0205b,g480783c3b1+98f8679e14,g48ccf36440+89c08d0516,g4b93dc025c+98f8679e14,g5c4744a4d9+a302e8c7f0,g613e996a0d+e1c447f2e0,g6c8d09e9e7+25247a063c,g7271f0639c+98f8679e14,g7a9cd813b8+124095ede6,g9d27549199+a302e8c7f0,ga1cf026fa3+ac198e9f13,ga32aa97882+7403ac30ac,ga786bb30fb+7a139211af,gaa63f70f4e+9994eb9896,gabf319e997+ade567573c,gba47b54d5d+94dc90c3ea,gbec6a3398f+06cf436103,gc6308e37c7+07dd123edb,gc655b1545f+ade567573c,gcc9029db3c+ab229f5caf,gd01420fc67+06cf436103,gd877ba84e5+06cf436103,gdb4cecd868+6f279b5b48,ge2d134c3d5+cc4dbb2e3f,ge448b5faa6+86d1ceac1d,gecc7e12556+98f8679e14,gf3ee170dca+25247a063c,gf4ac96e456+ade567573c,gf9f5ea5b4d+ac198e9f13,gff490e6085+8c2580be5c,w.2022.27
LSST Data Management Base Package
Distortion.cc
Go to the documentation of this file.
1// -*- lsst-c++ -*-
2
3/*
4 * LSST Data Management System
5 * Copyright 2008, 2009, 2010 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 */
28
29namespace lsst {
30namespace afw {
31namespace geom {
32namespace ellipses {
33
35 double e = getE();
36 return std::sqrt((1.0 - e) / (1.0 + e));
37}
38
40 double eta = other.getE();
41 if (eta < 1E-8) {
42 _complex = other.getComplex() * (1.0 - eta * eta / 3.0);
43 } else {
44 double delta = std::tanh(eta);
45 _complex = other.getComplex() * delta / eta;
46 }
47 return *this;
48}
49
51 double g = other.getE();
52 _complex = other.getComplex() * 2.0 / (1 + g * g);
53 return *this;
54}
55
57 Jacobian result = Jacobian::Zero();
58 double eta = other.getE();
59 double alpha, beta;
60 if (eta < 1E-8) {
61 alpha = (1.0 - eta * eta / 3.0);
62 beta = -2.0 / 3.0;
63 } else {
64 double delta = std::tanh(eta);
65 alpha = delta / eta;
66 beta = (1.0 - delta * delta - alpha) / (eta * eta);
67 }
68 _complex = other.getComplex() * alpha;
69 result(0, 0) = alpha + other.getE1() * other.getE1() * beta;
70 result(1, 1) = alpha + other.getE2() * other.getE2() * beta;
71 result(1, 0) = result(0, 1) = other.getE1() * other.getE2() * beta;
72 return result;
73}
74
76 Jacobian result = Jacobian::Zero();
77 double g = other.getE();
78 double alpha = 2.0 / (1 + g * g);
79 double beta = -alpha * alpha;
80 _complex = other.getComplex() * alpha;
81 result(0, 0) = alpha + other.getE1() * other.getE1() * beta;
82 result(1, 1) = alpha + other.getE2() * other.getE2() * beta;
83 result(1, 0) = result(0, 1) = other.getE1() * other.getE2() * beta;
84 return result;
85}
86
88 if (getE() > 1.0) {
90 "Distortion magnitude cannot be greater than one.");
91 }
92}
93} // namespace ellipses
94} // namespace geom
95} // namespace afw
96} // namespace lsst
py::object result
Definition: _schema.cc:429
#define LSST_EXCEPT(type,...)
Create an exception with a given type.
Definition: Exception.h:48
A logarithmic complex ellipticity with magnitude .
A complex ellipticity with magnitude .
Definition: Distortion.h:44
Jacobian dAssign(Distortion const &other)
Definition: Distortion.h:70
Distortion & operator=(Distortion const &other)
Definition: Distortion.h:59
A complex ellipticity with magnitude .
Definition: ReducedShear.h:45
Reports invalid arguments.
Definition: Runtime.h:66
A base class for image defects.
T sqrt(T... args)
T tanh(T... args)