#include <basix/vector.hpp>#include <basix/vector_sort.hpp>#include <numerix/kernel.hpp>#include <realroot/Seq.hpp>#include <realroot/Interval_glue.hpp>#include <realroot/polynomial_tensor.hpp>#include <realroot/solver_uv_sleeve.hpp>#include <realroot/solver_uv_continued_fraction.hpp>#include <realroot/solver_uv_interval_newton.hpp>Go to the source code of this file.
Classes | |
| struct | mmx::as_helper< interval< FT >, IntervalData< RT, Poly > > |
Namespaces | |
| mmx | |
Macros | |
| #define | TMPL template<class C> |
| #define | RING ring<C,MonomialTensor> |
| #define | POLYNOMIAL polynomial< C, with<MonomialTensor> > |
Functions | |
| TMPL vector< generic > | mmx::solver_univariate_contfrac_prec (const POLYNOMIAL &p, const int &prec) |
| TMPL vector< generic > | mmx::solver_univariate_contfrac (const POLYNOMIAL &p) |
| TMPL vector< generic > | mmx::solver_univariate_contfrac (const POLYNOMIAL &p, const interval< rational > &D) |
| TMPL vector< generic > | mmx::solver_univariate_contfrac_approx_prec (const POLYNOMIAL &p, const int &prec) |
| TMPL vector< generic > | mmx::solver_univariate_contfrac_approx (const POLYNOMIAL &p) |
| TMPL vector< generic > | mmx::solver_univariate_sleeve (const POLYNOMIAL &p) |
| TMPL interval< floating<> > | mmx::solver_univariate_newton (const POLYNOMIAL &p, const interval< floating<> > &I) |
| #define POLYNOMIAL polynomial< C, with<MonomialTensor> > |
| #define RING ring<C,MonomialTensor> |
| #define TMPL template<class C> |