| _conv_criterion_residual | MultiGridSolver< 3, T > | protected |
| _eps_converge | MultiGridSolver< 3, T > | protected |
| _istep_vcycle | MultiGridSolver< 3, T > | protected |
| _maxsteps | MultiGridSolver< 3, T > | protected |
| _res_domain_array | MultiGridSolver< 3, T > | |
| _rms_res | MultiGridSolver< 3, T > | protected |
| _rms_res_i | MultiGridSolver< 3, T > | protected |
| _rms_res_old | MultiGridSolver< 3, T > | protected |
| _store_all_residual | MultiGridSolver< 3, T > | |
| _verbose | MultiGridSolver< 3, T > | protected |
| add_external_grid(MultiGrid< NDIM, T > *field) | MultiGridSolver< 3, T > | |
| beta | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| bisection(T f1, T l1, const T df, const size_t level, const std::vector< size_t > &index_list, const T h) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| bisection_step(T &f1, T &l1, T &f2, T &l2, const size_t level, const std::vector< size_t > &index_list, const T h) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| check_bisection_convergence(const T df_new, const T l_new) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| check_convergence() override | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inlinevirtual |
| check_solution(size_t level, Grid< 3, T > &chi) override | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| MultiGridSolver< 3, T >::check_solution(size_t level, Grid< NDIM, T > &sol) | MultiGridSolver< 3, T > | virtual |
| MultiGridSolver< 3, T >::check_solution(size_t level) | MultiGridSolver< 3, T > | |
| check_surr_dens(T const *const rho_grid, std::vector< size_t > index_list, size_t i, size_t N) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| chi_0 | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| chi_a(T a) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| chi_force_units(T a) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| chi_min(T delta) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| chi_prefactor | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| chi_prefactor_0 | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| ChiSolver(size_t N, unsigned int Nmin, const Sim_Param &sim, bool verbose=true) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| ChiSolver(size_t N, const Sim_Param &sim, bool verbose=true) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| clear() | MultiGridSolver< 3, T > | |
| correct_sol(Grid< 3, T > &f, const Grid< 3, T > &corr, const size_t level) override | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| MultiGridSolver< 3, T >::correct_sol(Grid< NDIM, T > &f, const Grid< NDIM, T > &corr, const size_t level) | MultiGridSolver< 3, T > | virtual |
| dl_operator(const size_t level, const std::vector< size_t > &index_list, const T h) const override | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inlinevirtual |
| Exit_Status enum name | MultiGridSolver< 3, T > | |
| find_opposite_l_sign(const T f1, const T l1, T df, T &f2, T &l2, const size_t level, const std::vector< size_t > &index_list, const T h) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| fix_vals | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| get_chi_k(Mesh &rho_k) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| get_chi_prefactor() const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| get_external_field(size_t level, size_t field) | MultiGridSolver< 3, T > | inline |
| get_external_field(size_t level, size_t field) const | MultiGridSolver< 3, T > | inline |
| get_external_field_size() const | MultiGridSolver< 3, T > | inline |
| get_external_grid(size_t level, size_t field) | MultiGridSolver< 3, T > | inline |
| get_external_grid(size_t level, size_t field) const | MultiGridSolver< 3, T > | inline |
| get_grid(size_t level=0) | MultiGridSolver< 3, T > | inline |
| get_grid(size_t level=0) const | MultiGridSolver< 3, T > | inline |
| get_istep() const | MultiGridSolver< 3, T > | inline |
| get_mlt_grid(size_t level=0) | MultiGridSolver< 3, T > | inline |
| get_mlt_grid(size_t level=0) const | MultiGridSolver< 3, T > | inline |
| get_multigrid_source(size_t level, size_t i) const | MultiGridSolver< 3, T > | inline |
| get_N(size_t level=0) const | MultiGridSolver< 3, T > | |
| get_neighbor_gridindex(std::vector< size_t > &index_list, size_t i, size_t ngrid) | MultiGridSolver< 3, T > | protected |
| get_Nlevel() const | MultiGridSolver< 3, T > | |
| get_Ntot(size_t level=0) const | MultiGridSolver< 3, T > | |
| get_phi_prefactor() const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| get_y(size_t level=0) | MultiGridSolver< 3, T > | |
| get_y(size_t level=0) const | MultiGridSolver< 3, T > | |
| l_operator(const T chi_i, const size_t level, const std::vector< size_t > &index_list, const bool addsource, const T h) const | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| l_operator(const size_t level, const std::vector< size_t > &index_list, const bool addsource, const T h) const override | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inlinevirtual |
| m_conv_stop | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| m_dchi_stop | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| m_err_stop | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| m_err_stop_min | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| m_l_stop | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| m_max_bisection_steps | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| m_num_fail | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| m_rms_stop_min | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| MultiGridSolver() | MultiGridSolver< 3, T > | inline |
| MultiGridSolver(size_t N) | MultiGridSolver< 3, T > | inline |
| MultiGridSolver(size_t N, bool verbose) | MultiGridSolver< 3, T > | inline |
| MultiGridSolver(size_t N, size_t Nmin, bool verbose) | MultiGridSolver< 3, T > | |
| n | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| phi_prefactor | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | |
| set_bisection_convergence(size_t max_bi_step, T dchi_stop, T l_stop) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_bulk_field() | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_convergence(double eps, double err_stop, double err_stop_min, double rms_stop_min, size_t num_fail) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_convergence_criterion_residual(bool use_residual) | MultiGridSolver< 3, T > | |
| set_def_convergence() | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_epsilon(double eps_converge) | MultiGridSolver< 3, T > | |
| set_initial_guess(T guess) | MultiGridSolver< 3, T > | |
| set_initial_guess(T *guess) | MultiGridSolver< 3, T > | |
| set_initial_guess(Grid< NDIM, T > &guess) | MultiGridSolver< 3, T > | |
| set_linear(Mesh &rho, const FFTW_PLAN_TYPE &p_F, const FFTW_PLAN_TYPE &p_B) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_linear_recursively(size_t level) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_linear_sol_at_level(Mesh &rho, const FFTW_PLAN_TYPE &p_F, const FFTW_PLAN_TYPE &p_B, size_t level) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_maxsteps(size_t maxsteps) | MultiGridSolver< 3, T > | |
| set_ngs_sweeps(size_t ngs_fine, size_t ngs_coarse) | MultiGridSolver< 3, T > | |
| set_Nlevel(size_t N) | MultiGridSolver< 3, T > | |
| set_screened(size_t level=0) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| set_time(T a, const Cosmo_Param &cosmo) | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inline |
| solve() | MultiGridSolver< 3, T > | |
| upd_operator(const T f, const size_t level, const std::vector< size_t > &index_list, const T h) const override | anonymous_namespace{chameleon.cpp}::ChiSolver< T > | inlinevirtual |
1.8.11 
