root_finder.hpp File Reference

#include "utils/defs.hpp"
#include <triqs/utility/streams.hpp>

Go to the source code of this file.

Namespaces
namespace	triqs

Functions
std::pair< double, double >	triqs::bisection (std::function< double(double)> f, double x_low, double x_high, double y_target, double precision, long max_loops, std::string x_name, std::string y_name, bool verbosity)
	bisection algorithm
std::pair< double, double >	triqs::dichotomy (std::function< double(double)> f, double x_low, double x_high, double y_target, double precision, long max_loops, std::string x_name, std::string y_name, bool verbosity)
	dichotomy algorithm
std::pair< double, double >	triqs::find_bounds (std::function< double(double)> f, double x_init, double y_value, double delta_x, double precision, long max_loops=1000, bool verbosity=false)
	find upper and lower bounds of f(x)
std::pair< double, double >	triqs::root_finder (std::string method, std::function< double(double)> f, double x_init, double y_value, double precision, double delta_x, long max_loops=1000, std::string x_name="", std::string y_name="", bool verbosity=false)
	Root finder \( f(x) = 0 \).