izzo.h

Go to the documentation of this file.

/* Conquer Space
 * Copyright (C) 2021-2025 Conquer Space
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
#pragma once
 
#include <cmath>
#include <vector>
 
#include <glm/glm.hpp>
 
namespace cqsp::common::systems::lambert {
class Izzo {
 public:
    Izzo(const glm::dvec3 &r1, const glm::dvec3 &r2, const double &tof = 3.1415926535 / 2, const double &mu = 1.,
         const bool cw = false, const int &multi_revs = 5);
    const std::vector<glm::dvec3> &get_v1() const;
    const std::vector<glm::dvec3> &get_v2() const;
    const glm::dvec3 &get_r1() const;
    const glm::dvec3 &get_r2() const;
    const double &get_tof() const;
    const double &get_mu() const;
    const std::vector<double> &get_x() const;
    const std::vector<int> &get_iters() const;
    int get_Nmax() const;
    void solve();
 
 private:
    int householder(const double T, double &x0, const int N, const double eps, const int iter_max);
    void dTdx(double &DT, double &DDT, double &DDDT, const double x0, const double tof);
    void x2tof(double &tof, const double x0, const int N);
    void x2tof2(double &tof, const double x0, const int N);
    double hypergeometricF(double z, double tol);
 
    const glm::dvec3 r1, r2;
    const double tof;
    const double mu;
    std::vector<glm::dvec3> m_v1;
    std::vector<glm::dvec3> m_v2;
    std::vector<int> m_iters;
    std::vector<double> m_x;
    double m_s, m_c, m_lambda;
    int m_Nmax;
    bool m_has_converged;
    int m_multi_revs;
    bool cw;
};
}  // namespace cqsp::common::systems::lambert