Loading [MathJax]/extensions/tex2jax.js
LSST Applications g0fba68d861+83433b07ee,g16d25e1f1b+23bc9e47ac,g1ec0fe41b4+3ea9d11450,g1fd858c14a+9be2b0f3b9,g2440f9efcc+8c5ae1fdc5,g35bb328faa+8c5ae1fdc5,g4a4af6cd76+d25431c27e,g4d2262a081+c74e83464e,g53246c7159+8c5ae1fdc5,g55585698de+1e04e59700,g56a49b3a55+92a7603e7a,g60b5630c4e+1e04e59700,g67b6fd64d1+3fc8cb0b9e,g78460c75b0+7e33a9eb6d,g786e29fd12+668abc6043,g8352419a5c+8c5ae1fdc5,g8852436030+60e38ee5ff,g89139ef638+3fc8cb0b9e,g94187f82dc+1e04e59700,g989de1cb63+3fc8cb0b9e,g9d31334357+1e04e59700,g9f33ca652e+0a83e03614,gabe3b4be73+8856018cbb,gabf8522325+977d9fabaf,gb1101e3267+8b4b9c8ed7,gb89ab40317+3fc8cb0b9e,gc0af124501+57ccba3ad1,gcf25f946ba+60e38ee5ff,gd6cbbdb0b4+1cc2750d2e,gd794735e4e+7be992507c,gdb1c4ca869+be65c9c1d7,gde0f65d7ad+c7f52e58fe,ge278dab8ac+6b863515ed,ge410e46f29+3fc8cb0b9e,gf35d7ec915+97dd712d81,gf5e32f922b+8c5ae1fdc5,gf618743f1b+747388abfa,gf67bdafdda+3fc8cb0b9e,w.2025.18
LSST Data Management Base Package
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
_leastSquares.cc
Go to the documentation of this file.
1/*
2 * LSST Data Management System
3 * Copyright 2008-2016 AURA/LSST.
4 *
5 * This product includes software developed by the
6 * LSST Project (http://www.lsst.org/).
7 *
8 * This program is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the LSST License Statement and
19 * the GNU General Public License along with this program. If not,
20 * see <https://www.lsstcorp.org/LegalNotices/>.
21 */
22
23#include <pybind11/pybind11.h>
25
26#include "ndarray/pybind11.h"
27
29
30namespace py = pybind11;
31using namespace pybind11::literals;
32
33using namespace lsst::afw::math;
34namespace lsst {
35namespace afw {
36namespace math {
37namespace {
38template <typename T1, typename T2, int C1, int C2>
39void declareLeastSquares(lsst::cpputils::python::WrapperCollection &wrappers) {
40 auto clsLeastSquares = wrappers.wrapType(
41 py::class_<LeastSquares>(wrappers.module, "LeastSquares"), [](auto &mod, auto &cls) {
42 cls.def_static(
43 "fromDesignMatrix",
44 (LeastSquares(*)(ndarray::Array<T1, 2, C1> const &, ndarray::Array<T2, 1, C2> const &,
45 LeastSquares::Factorization)) &
46 LeastSquares::fromDesignMatrix<T1, T2, C1, C2>,
47 "design"_a, "data"_a, "factorization"_a = LeastSquares::NORMAL_EIGENSYSTEM);
48 cls.def_static(
49 "fromNormalEquations",
50 (LeastSquares(*)(ndarray::Array<T1, 2, C1> const &, ndarray::Array<T2, 1, C2> const &,
51 LeastSquares::Factorization)) &
52 LeastSquares::fromNormalEquations<T1, T2, C1, C2>,
53 "fisher"_a, "rhs"_a, "factorization"_a = LeastSquares::NORMAL_EIGENSYSTEM);
54 cls.def("getRank", &LeastSquares::getRank);
55 cls.def("setDesignMatrix", (void (LeastSquares::*)(ndarray::Array<T1, 2, C1> const &,
56 ndarray::Array<T2, 1, C2> const &)) &
57 LeastSquares::setDesignMatrix<T1, T2, C1, C2>);
58 cls.def("getDimension", &LeastSquares::getDimension);
59 cls.def("setNormalEquations", (void (LeastSquares::*)(ndarray::Array<T1, 2, C1> const &,
60 ndarray::Array<T2, 1, C2> const &)) &
61 LeastSquares::setNormalEquations<T1, T2, C1, C2>);
62 cls.def("getSolution", &LeastSquares::getSolution);
63 cls.def("getFisherMatrix", &LeastSquares::getFisherMatrix);
64 cls.def("getCovariance", &LeastSquares::getCovariance);
65 cls.def("getFactorization", &LeastSquares::getFactorization);
66 cls.def("getDiagnostic", &LeastSquares::getDiagnostic);
67 cls.def("getThreshold", &LeastSquares::getThreshold);
68 cls.def("setThreshold", &LeastSquares::setThreshold);
69 });
70 wrappers.wrapType(py::enum_<LeastSquares::Factorization>(clsLeastSquares, "Factorization"),
71 [](auto &mod, auto &enm) {
72 enm.value("NORMAL_EIGENSYSTEM", LeastSquares::Factorization::NORMAL_EIGENSYSTEM);
73 enm.value("NORMAL_CHOLESKY", LeastSquares::Factorization::NORMAL_CHOLESKY);
74 enm.value("DIRECT_SVD", LeastSquares::Factorization::DIRECT_SVD);
75 enm.export_values();
76 });
77};
78} // namespace
79
81 declareLeastSquares<double, double, 0, 0>(wrappers);
82}
83} // namespace math
84} // namespace afw
85} // namespace lsst
@ NORMAL_EIGENSYSTEM
Use the normal equations with a symmetric Eigensystem decomposition.
@ NORMAL_CHOLESKY
Use the normal equations with a Cholesky decomposition.
@ DIRECT_SVD
Use a thin singular value decomposition of the design matrix.
A helper class for subdividing pybind11 module across multiple translation units (i....
Definition python.h:242
PyType wrapType(PyType cls, ClassWrapperCallback function, bool setModuleName=true)
Add a type (class or enum) wrapper, deferring method and other attribute definitions until finish() i...
Definition python.h:391
pybind11::module module
The module object passed to the PYBIND11_MODULE block that contains this WrapperCollection.
Definition python.h:448
void wrapLeastSquares(lsst::cpputils::python::WrapperCollection &wrappers)