31 virtual double operator()(
const std::deque<double>& que)
const =0;
34 virtual unsigned int npoints()
const = 0;
57 virtual double operator() (
const std::deque<double>& que)
const;
60 virtual unsigned int npoints()
const {
return 2;}
virtual double operator()(const std::deque< double > &que) const
Interpolates between two points linear to find a zero crossing.
Definition: Solver.cpp:11
Pure abstract base class for root-finding algorithms.
Definition: Solver.h:22
virtual unsigned int npoints() const =0
The minimum number of points required by the algorithm to define unique solution. ...
virtual double operator()(const std::deque< double > &que) const =0
The root-finding algorithm.
Definition: AlgoIterator.hpp:12
virtual unsigned int npoints() const
Number of points required for a unique solution.
Definition: Solver.h:60
Root finder based on linear interpolation.
Definition: Solver.h:45