|
static void | alloc (sz_t s, sz_t deep) |
|
static void | barre (char c, unsigned n) |
|
static void | writebounds (creal_t *pup, creal_t *pdw, unsigned s) |
|
static bool | glue (sz_t cup, sz_t cdw, int d) |
|
static void | mstore (sz_t cup, sz_t cdw, int d) |
|
static void | dwsplit (creal_t *r, creal_t *l, sz_t s) |
|
static void | upsplit (creal_t *r, creal_t *l, sz_t s) |
|
static void | Loop (bool isole=true) |
|
template<class input > |
static void | run_loop (const input &in, const creal_t &eps, const texp::true_t &) |
|
template<class output , class input > |
static void | solve_bernstein (output &out, const input &in) |
|
template<class VECT , class POL , class Q > |
static void | init_pol (VECT &ubp, VECT &dbp, const POL &r, unsigned sz, const Q &u, const Q &v) |
|
template<class input > |
static void | run (const input &in, const creal_t &eps) |
|
template<class C > |
static void | run (const sleeve_rep< C > &p) |
|
template<class input > |
static void | run (const input &up, const input &dw) |
|
template<typename output , typename POL , typename Q > |
static void | solve (output &sol, const POL &r, const Q &u, const Q &v) |
|
template<class output , class input , class real , class MTH > |
static void | solve_bernstein (output &sol, const input &up, const input &dw, const real &u, const real &v, const MTH &mth) |
|
template<typename output , typename POL , typename real , typename MTH > |
static void | solve_bernstein (output &sol, const POL &r, const real &u, const real &v, const MTH &mth) |
|
template<class K>
struct mmx::binary_sleeve_subdivision< K >
Solver class using sleeve approximation with coefficients of type C
.
template<class K >
template<typename output , typename POL , typename Q >
Compute the roots of the polynomial r
expressed in the monomial basis, in the interval [u,v]. If MTH=Isolate
, the ordered sequence of isolating intervals is stored in sol
. If MTH=Approx
, the ordered sequence of approximation of the roots is stored in sol
.
template<class K >
template<typename output , typename POL , typename real , typename MTH >
Compute the roots of the polynomial r
expressed in the bernstein basis, on the interval [u,v]. If MTH=Isolate
, the ordered sequence of isolating intervals is stored in sol
. If MTH=Approx
, the ordered sequence of approximation of the roots is stored in sol
.