#include <realroot/ring.hpp>
#include <realroot/polynomial_tensor.hpp>
#include <realroot/polynomial.hpp>
#include <realroot/homography.hpp>
#include <realroot/sign_variation.hpp>
#include <realroot/Interval.hpp>
#include <stack>
#include <realroot/solver_ucf.hpp>
#include <realroot/solver_uv_bspline.hpp>

Namespaces

namespace mmx
namespace mmx::realroot

Defines

#define TMPL template<class POL>
#define DPOL polynomial<double,with<MonomialTensor> >
#define BOX box_rep<POL>
#define INFO 1
#define TODOUBLE as<double>

Functions

template<class POL , class FT > int topological_degree_2d (box_rep< POL > *b)
template<class POL > polynomial< double, with
< MonomialTensor > > * jacobian (Seq< POL * > &S0)
template<class T > void precondition (Seq< T > val, polynomial< double, with< MonomialTensor > > *mat, int n)
template<class T > T * eval_poly_matrix (Seq< T > val, polynomial< double, with< MonomialTensor > > *mat, int n)
template<class T > int signof_det (T *mat, const int &n)
template<class T > T * submatrix (T *matrix, int order, int i, int j)
template<class T > T det (T *mat, int order)
template<class FT > int signof (polynomial< double, with< MonomialTensor > > *p, Seq< FT > t)
template<class POL > bool miranda_test (Seq< POL > &S, const int i, const int j)
template<class POL > bool include1 (box_rep< POL > *b, polynomial< double, with< MonomialTensor > > *J)
Inclusion criteria (Miranda Test)
template<class POL > bool include2 (box_rep< POL > *b, polynomial< double, with< MonomialTensor > > *J)
Inclusion criteria (Jacobian+Topological Degree)
template<class POL > bool include3 (box_rep< POL > *b, polynomial< double, with< MonomialTensor > > *J, Seq< POL * > &S0)
Inclusion criteria based on Rump's test.
template<class POL > bool exclude1 (box_rep< POL > *b, Seq< POL * > &S0)
Exclusion criteria (inteval arithmetic)
template<class POL > bool exclude2 (box_rep< POL > *b, polynomial< double, with< MonomialTensor > > *J)
Exclusion criteria (topological degree)
template<class POL > bool exclude3 (box_rep< POL > *b)
template<class POL > bool no_variation (POL &p)
True iff all coefficients of p have the same sign.
template<class FT > int sgn (FT a)
Sign of a.
template<class POL , class FT > int sgn (POL &f, FT a)
Sign of f at point a>=0 (-1=inf)

Define Documentation

#define BOX box_rep<POL>

Definition at line 26 of file solver_mv_monomial_tests.hpp.

#define DPOL polynomial<double,with<MonomialTensor> >

Definition at line 25 of file solver_mv_monomial_tests.hpp.

Referenced by mmx::realroot::exclude1(), mmx::realroot::include3(), and mmx::realroot::jacobian().

#define INFO 1

Definition at line 28 of file solver_mv_monomial_tests.hpp.

#define TMPL template<class POL>

Definition at line 24 of file solver_mv_monomial_tests.hpp.

#define TODOUBLE as<double>

Definition at line 29 of file solver_mv_monomial_tests.hpp.