root_finding.hh File Reference

#include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <limits>
#include <stdexcept>
#include <utility>
#include <vector>
#include <spdlog/spdlog.h>

Go to the source code of this file.

Classes
class	DiFfRG::AbstractRootFinder< dim >
class	DiFfRG::AbstractRootFinder< 1 >
class	DiFfRG::BisectionRootFinder
class	DiFfRG::BisectionRootFinderTarget
	Bisection search which converges a target value rather than the search variable. More...
struct	DiFfRG::detail::ScalingFit
	Result of a three-point power-law fit \( y = C (x - x_c)^\beta \). More...
class	DiFfRG::ScalingRootFinder
	Bracketed root find accelerated by the critical scaling of the observable. More...
struct	DiFfRG::ScalingRootFinder::Counts

Namespaces
namespace	DiFfRG
namespace	DiFfRG::detail

Functions
double	DiFfRG::detail::solve_scaling_shift (const double A, const double B, const double d1, const double d2)
	Solve the three-point power-law condition for the shift \( s \).
ScalingFit	DiFfRG::detail::fit_power_law_3 (std::array< double, 3 > x, std::array< double, 3 > y)
	Three-point power-law fit. Points need not be pre-sorted.