32 const long _maxdeg, number *_p,
const bool _homog =
true );
68 enum rootType { none, cspecial, cspecialmu, det, onepoly };
73 void fillContainer( number *_coeffs, number *_ievpoint,
74 const int _var,
const int _tdg,
75 const rootType _rt,
const int _anz );
77 bool solver(
const int polishmode=
PM_NONE );
93 bool swapRoots(
const int from,
const int to );
114 void sortroots(
gmp_complex **roots,
int r,
int c,
bool isf);
181 #define SIMPLEX_EPS 1.0e-12 221 void simp1(
mprfloat **
a,
int mm,
int ll[],
int nll,
int iabf,
int *kp,
mprfloat *bmax );
222 void simp2(
mprfloat **
a,
int n,
int l2[],
int nl2,
int *ip,
int kp,
mprfloat *q1 );
223 void simp3(
mprfloat **
a,
int i1,
int k1,
int ip,
int kp );
complex root finder for univariate polynomials based on laguers algorithm
number * interpolateDense(const number *q)
Solves the Vandermode linear system {i=1}^{n} x_i^k-1 w_i = q_k, k=1,..,n.
vandermonde system solver for interpolating polynomials from their values
Linear Programming / Linear Optimization using Simplex - Algorithm.
gmp_complex numbers based on
poly numvec2poly(const number *q)
gmp_complex * getRoot(const int i)
const Variable & v
< [in] a sqrfree bivariate poly
lists listOfRoots(rootArranger *self, const unsigned int oprec)
vandermonde(const long _cn, const long _n, const long _maxdeg, number *_p, const bool _homog=true)