#include <cPolynomRange.h>
List of all members.
Detailed Description
template<class tX, class tY>
class fib::algorithms::nD1::cPolynomRange< tX, tY >
Definition at line 62 of file cPolynomRange.h.
Constructor & Destructor Documentation
template<class tX , class tY >
Member Function Documentation
template<class tX , class tY >
This methods creats the linear inequiations (
- See also:
- cLinearConstrainFix ) for the given datapoints. The i'th linear inequiations will have the form: vecData[i].minY * yu_i <= x_0 + vecData.x * x_1 + vecData.x^2 * x_2 + ... + vecData[uiMaxPolynomOrder - 1] * x_{uiMaxPolynomOrder - 1} <= vecData[i].maxY * yu_i
- Parameters:
-
vecData | the with the datapoints, for which to evalue the linear equiations should be evalued |
uiMaxPolynomOrder | the maximal order of the polynom to generate the factor ranges for |
- Returns:
- a vector with the linear equiations for the datapoints
template<class tX , class tY >
This functions evalues the ranges for the possible factors for a polynom which matches the given data vecData. The returned ranges don't have to include the factors for polynom which match the data, if ther isn't a possible polynome of the maximal range given for the data.
- See also:
- evalue()
- Parameters:
-
vecData | the data which the returend polynom should match |
uiMaxPolynomOrder | the maximal order of the polynom to generate the factor ranges for |
- Returns:
- ranges in which the factors of a polynom should lay, if possible (
- See also:
- evalue()) in this cOneAryRangeFunction
Implements fib::algorithms::nD1::cOneAryRangeFunction< tX, tY >.
template<class tX , class tY >
template<class tX , class tY >
template<class tX , class tY >
Member Data Documentation
template<class tX , class tY >
The documentation for this class was generated from the following file: