realroot_doc 0.1.1
|
#include <solver.hpp>
solver_mv_bernstein_binary_test.cpp, solver_mv_bernstein_proj_test.cpp, solver_uv_all_test.cpp, solver_uv_bernstein_binary_test.cpp, and solver_uv_test.cpp.
Definition at line 69 of file solver.hpp.
Definition at line 71 of file solver.hpp.
Definition at line 70 of file solver.hpp.
typedef MTH::Solutions Solutions |
Definition at line 73 of file solver.hpp.
typedef MTH::Strategy Strategy |
Definition at line 72 of file solver.hpp.
static Solutions solve | ( | const POL & | p | ) | [inline, static] |
Definition at line 76 of file solver.hpp.
References subdivisor< CELL, V >::run(), and subdivisor< CELL, V >::solutions().
Referenced by solver< C, ContFrac< Isolate > >::solve(), and solver< C, ContFrac< Approximate > >::solve().
Approximates the first positive root of the polynomial p in the interval (u,v).
Definition at line 484 of file solver_mv_monomial.hpp.
References solver_mv_monomial< FT, POL >::approximate().
{
realroot::solver_mv_monomial<FT,POL> slv(1e-3);
return slv.approximate(p, dom );
}
static Solutions solve | ( | const POL & | p, |
const DOM & | dmn | ||
) | [inline, static] |
Definition at line 84 of file solver.hpp.
References subdivisor< CELL, V >::run(), and subdivisor< CELL, V >::solutions().