MathRoot_Bisection.hxx File Reference

#include <MathUtils_Types.hxx>
#include <MathUtils_Config.hxx>
#include <MathUtils_Core.hxx>
#include <cmath>
#include <utility>

Namespaces
namespace	MathRoot
	Root finding algorithms for scalar functions.

Functions
template<typename Function >
MathUtils::ScalarResult	MathRoot::Bisection (Function &theFunc, double theLower, double theUpper, const MathUtils::Config &theConfig=MathUtils::Config())
	Bisection method for root finding. Simple and robust, guaranteed to converge if a valid bracket is provided. Converges linearly, halving the interval at each step.
template<typename Function >
MathUtils::ScalarResult	MathRoot::BisectionNewton (Function &theFunc, double theLower, double theUpper, const MathUtils::Config &theConfig=MathUtils::Config())
	Hybrid bisection-Newton method. Combines the robustness of bisection with the speed of Newton's method. Uses Newton step when it stays within bracket, otherwise bisects.