Opm::RegulaFalsiBisection< ErrorPolicy > Class Template Reference

#include <RootFinders.hpp>

Static Public Member Functions

static std::string name ()
 
template<class Functor >
static double solve (const Functor &f, const double a, const double b, const int max_iter, const double tolerance, int &iterations_used)
 

Member Function Documentation

◆ name()

template<class ErrorPolicy = ThrowOnError>
static std::string Opm::RegulaFalsiBisection< ErrorPolicy >::name ( )
inlinestatic

◆ solve()

template<class ErrorPolicy = ThrowOnError>
template<class Functor >
static double Opm::RegulaFalsiBisection< ErrorPolicy >::solve ( const Functor &  f,
const double  a,
const double  b,
const int  max_iter,
const double  tolerance,
int &  iterations_used 
)
inlinestatic

Implements a modified regula falsi method as described in "Improved algorithms of Illinois-type for the numerical solution of nonlinear equations" by J. A. Ford. Current variant is the 'Pegasus' method. Combines this method with the bisection method, inspired by http://phillipmfeldman.org/Python/roots/find_roots.html

References b, and exprtk::details::numeric::max().


The documentation for this class was generated from the following file: