TrAnal::LinearSolver Class Reference

Root finder based on linear interpolation. More...

#include <Solver.h>

Inheritance diagram for TrAnal::LinearSolver:

Public Member Functions
virtual double	operator() (const std::deque< double > &que) const
	Interpolates between two points linear to find a zero crossing. More...
virtual unsigned int	npoints () const
	Number of points required for a unique solution.

Detailed Description

Root finder based on linear interpolation.

Member Function Documentation

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

virtual

Interpolates between two points linear to find a zero crossing.

Locates the distance of the zero crossing from the first element in the que. The return value is to be interpreted as a fractional index. For example, if the argument contained two values, que[0]=0.75, que[1]=-0.25. The algorithm will treat this as two points (0,0.75) and (1,-0.25) and find the "x" value of the zero crossing.

Implements TrAnal::Solver.

---

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

• traiter/src/Solver.h
• traiter/src/Solver.cpp