The base class for all Polynomials.
A clear and straight forward implementation of polynomial operations. Still very basic, but serves its purpose.
Definition at line 24 of file PolyMath.h.
|
| Polynomial2D () |
| Constructors. More...
|
|
virtual | ~Polynomial2D () |
| Destructor. No implementation. More...
|
|
Eigen::MatrixXd | convertCoefficients (const std::vector< double > &coefficients) |
|
Eigen::MatrixXd | convertCoefficients (const std::vector< std::vector< double >> &coefficients) |
|
bool | checkCoefficients (const Eigen::MatrixXd &coefficients, const unsigned int rows, const unsigned int columns) |
| Basic checks for coefficient vectors. More...
|
|
Eigen::MatrixXd | integrateCoeffs (const Eigen::MatrixXd &coefficients, const int &axis, const int ×) |
| Integration functions. More...
|
|
Eigen::MatrixXd | deriveCoeffs (const Eigen::MatrixXd &coefficients, const int &axis=-1, const int ×=1) |
| Derivative coefficients calculation. More...
|
|
double | evaluate (const Eigen::MatrixXd &coefficients, const double &x_in) |
| The core functions to evaluate the polynomial. More...
|
|
double | evaluate (const Eigen::MatrixXd &coefficients, const double &x_in, const double &y_in) |
|
double | derivative (const Eigen::MatrixXd &coefficients, const double &x_in, const double &y_in, const int &axis) |
|
double | integral (const Eigen::MatrixXd &coefficients, const double &x_in, const double &y_in, const int &axis) |
|
Eigen::VectorXd | solve (const Eigen::MatrixXd &coefficients, const double &in, const double &z_in, const int &axis) |
|
double | solve_limits (const Eigen::MatrixXd &coefficients, const double &in, const double &z_in, const double &min, const double &max, const int &axis) |
|
double | solve_guess (const Eigen::MatrixXd &coefficients, const double &in, const double &z_in, const double &guess, const int &axis) |
|
|
double | solve_limits (Poly2DResidual *res, const double &min, const double &max) |
|
double | solve_guess (Poly2DResidual *res, const double &guess) |
|
double | simplePolynomial (const std::vector< double > &coefficients, double x) |
| Simple polynomial function generator. <- Deprecated due to poor performance, use Horner-scheme instead. More...
|
|
| DEPRECATED (double simplePolynomial(const std::vector< std::vector< double >> &coefficients, double x, double y)) |
|
double | baseHorner (const std::vector< double > &coefficients, double x) |
| Horner function generator implementations. More...
|
|
| DEPRECATED (double baseHorner(const std::vector< std::vector< double >> &coefficients, double x, double y)) |
|
bool | do_debug (void) |
|
double CoolProp::Polynomial2D::baseHorner |
( |
const std::vector< double > & |
coefficients, |
|
|
double |
x |
|
) |
| |
|
protected |
Horner function generator implementations.
Represent polynomials according to Horner's scheme. This avoids unnecessary multiplication and thus speeds up calculation. Deprecated since we moved everything to the Eigen framework.
Represent polynomials according to Horner's scheme. This avoids unnecessary multiplication and thus speeds up calculation.
Definition at line 313 of file PolyMath.cpp.
Eigen::MatrixXd CoolProp::Polynomial2D::deriveCoeffs |
( |
const Eigen::MatrixXd & |
coefficients, |
|
|
const int & |
axis = -1 , |
|
|
const int & |
times = 1 |
|
) |
| |
Derivative coefficients calculation.
Deriving coefficients for polynomials is done by multiplying the original coefficients with i and lowering the order by 1.
- Parameters
-
coefficients | matrix containing the ordered coefficients |
axis | unsigned integer value that represents the desired direction of derivation |
times | integer value that represents the desired order of derivation |
Deriving coefficients for polynomials is done by multiplying the original coefficients with i and lowering the order by 1.
- Parameters
-
coefficients | matrix containing the ordered coefficients |
axis | integer value that represents the desired direction of derivation |
times | integer value that represents the desired order of integration |
Definition at line 109 of file PolyMath.cpp.
double CoolProp::Polynomial2D::evaluate |
( |
const Eigen::MatrixXd & |
coefficients, |
|
|
const double & |
x_in |
|
) |
| |
The core functions to evaluate the polynomial.
It is here we implement the different special functions that allow us to specify certain types of polynomials.
Try to avoid many calls to the derivative and integral functions. Both of them have to calculate the new coefficients internally, which slows things down. Instead, you should use the deriveCoeffs and integrateCoeffs functions and store the coefficient matrix you need for future calls to evaluate derivative and integral.
- Parameters
-
coefficients | vector containing the ordered coefficients |
x_in | double value that represents the current input in the 1st dimension |
It is here we implement the different special functions that allow us to specify certain types of polynomials. The derivative might bee needed during the solution process of the solver. It could also be a protected function...
- Parameters
-
coefficients | vector containing the ordered coefficients |
x_in | double value that represents the current input |
Definition at line 167 of file PolyMath.cpp.
Eigen::MatrixXd CoolProp::Polynomial2D::integrateCoeffs |
( |
const Eigen::MatrixXd & |
coefficients, |
|
|
const int & |
axis = -1 , |
|
|
const int & |
times = 1 |
|
) |
| |
Integration functions.
Integrating coefficients for polynomials is done by dividing the original coefficients by (i+1) and elevating the order by 1 through adding a zero as first coefficient. Some reslicing needs to be applied to integrate along the x-axis. In the brine/solution equations, reordering of the parameters avoids this expensive operation. However, it is included for the sake of completeness.
- Parameters
-
coefficients | matrix containing the ordered coefficients |
axis | unsigned integer value that represents the desired direction of integration |
times | integer value that represents the desired order of integration |
Integrating coefficients for polynomials is done by dividing the original coefficients by (i+1) and elevating the order by 1 through adding a zero as first coefficient. Some reslicing needs to be applied to integrate along the x-axis. In the brine/solution equations, reordering of the parameters avoids this expensive operation. However, it is included for the sake of completeness.
- Parameters
-
coefficients | matrix containing the ordered coefficients |
axis | integer value that represents the desired direction of integration |
times | integer value that represents the desired order of integration |
Definition at line 55 of file PolyMath.cpp.