GiNaCRA
0.6.4
|
Go to the source code of this file.
Data Structures | |
struct | GiNaCRA::plus_second |
Namespaces | |
namespace | GiNaC |
namespace | GiNaCRA |
Implementation of the class Constraint. | |
Functions | |
const ex | GiNaC::prod (const lst &l) throw ( invalid_argument ) |
Computes the product of a list of expressions. | |
const ex | GiNaC::lcm (const lst &l) throw ( invalid_argument ) |
Computes the least common multiple of a list of expressions. | |
long | GiNaC::lcm (long a, long b) |
Computes the least common multiple of two machine integers a and b. | |
long | GiNaC::gcd (long a, long b) |
Computes the greatest common divisor of two integers a and b. | |
long | GiNaC::numerator (long a, long b) |
Computes the numerator q such that b / a = q / r and q and r are coprime. | |
long | GiNaC::denominator (long a, long b) |
Computes the numerator r such that b / a = q / r and q and r are coprime. | |
bool | GiNaC::is_constant (const ex &polynomial, const vector< symbol > &symbolLst) |
Determines whether the given polynomial expression is constant in the given list of variables. | |
bool | GiNaC::is_rational_polynomial (const ex &p, const symbol &x) |
Tests whether the given expression p is a rational polynomial in x. | |
bool | GiNaC::is_realalgebraic_polynomial (const ex &p, const symbol &x) |
Tests whether the given expression p is a polynomial in x with real algebraic coefficients, i.e. | |
bool | GiNaC::is_realalgebraic_term (const ex &p) |
Tests whether the given expression p is a term only containing only numbers returning true on info(info_flags::numeric) && (info(info_flags::rational) || (info(info_flags::real) && info_flags::algebraic)) . | |
sign | GiNaC::sgn (const numeric &n) |
Determines the sign of the given numeric. | |
const ex | GiNaC::monpart (const ex &polynomial, const vector< symbol > &symbolLst) |
For internal use only! Computes the monomial underlying the given polynomial in case the polynomial is a single term. | |
const ex | GiNaC::coeffpart (const ex &polynomial, const vector< symbol > &symbolLst) |
For internal use only! Computes the polynomial coefficient underlying the given polynomial in case the polynomial is a single term. | |
void | GiNaC::isolateByVariables (const ex &polynomial, const vector< symbol > &symbolLst, ex &coefficient, ex &monomial) |
For internal use only! Determins the monomial and its coefficient of the given polynomial w.r.t. | |
const GiNaC::ex | GiNaC::rationalize (const GiNaC::ex &p, const vector< GiNaC::symbol > &symbolLst) |
Converts all coefficients of the given rational polynomial in the variables symbolLst to an exact rational numeric, so that is_rational_polynomial returns true. | |
const GiNaC::ex | GiNaC::rationalize (const GiNaC::ex &p, const GiNaC::symbol &s) |
Converts all coefficients of the given rational polynomial in the variable s to an exact rational numeric, so that is_rational_polynomial returns true. | |
const GiNaC::numeric | GiNaC::rationalize (const GiNaC::numeric &n) |
Converts the given numeric value to an exact numeric one. | |
const vector< symbol > | GiNaC::sortVariables (const vector< symbol > &l) |
Sorts the given list of symbols lexicographicly. | |
bool | GiNaC::symbol_is_lesseq_lex (const symbol &a, const symbol &b) |
Compares two expressions lexicographically by their string representations. | |
bool | GiNaC::symbol_is_less_lex (const symbol &a, const symbol &b) |
Compares two expressions lexicographically by their string representations. | |
const map< int, ex > | GiNaC::signedSubresultants (const ex &A, const ex &B, const symbol &sym) |
Returns the signed Subresultant sequence. | |
const vector< ex > | GiNaC::signedSubresultantsCoefficients (const ex &A, const ex &B, const symbol &sym) throw ( invalid_argument ) |
Returns the Signed Subresultant Coefficient sequence. |