TrAnal::Solver Class Reference

Pure abstract base class for root-finding algorithms. More...

#include <Solver.h>

Inheritance diagram for TrAnal::Solver:

Public Member Functions
virtual double	operator() (const std::deque< double > &que) const =0
	The root-finding algorithm. More...
virtual unsigned int	npoints () const =0
	The minimum number of points required by the algorithm to define unique solution.

Detailed Description

Pure abstract base class for root-finding algorithms.

Solver objects fit a set of values with a function and then extracts the nearest zero crossing value. These are used by the CFD algorithms to locate zero crossings.

Member Function Documentation

virtual double TrAnal::Solver::operator() ( const std::deque< double > &  que ) const

pure virtual

The root-finding algorithm.

Locates the distance from the first element of the deque to a zero crossing point.

Implemented in TrAnal::LinearSolver.

---

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

• traiter/src/Solver.h