mmx::solver< C, M > Struct Template Reference

#include <solver.hpp>

Public Types
typedef solver_of< C, M >	MTH
typedef MTH::Cell	Cell
typedef MTH::Strategy	Strategy
typedef MTH::Solutions	Solutions

Public Member Functions
template<class FT , class POL >
Seq< std::vector< FT > >	solve (Seq< POL > &p, Seq< Interval< base_t > > &dom)

Static Public Member Functions
template<class POL >
static Solutions	solve (const POL &p)
template<class POL , class DOM >
static Solutions	solve (const POL &p, const DOM &dmn)

Detailed Description

template<class C, class M>
struct mmx::solver< C, M >

Examples:

solver_mv_bernstein_binary_test.cpp, solver_mv_bernstein_proj_test.cpp, solver_uv_all_test.cpp, solver_uv_bernstein_binary_test.cpp, solver_uv_contfrac_extended_test.cpp, and solver_uv_test.cpp.

Member Typedef Documentation

template<class C, class M>

typedef MTH::Cell mmx::solver< C, M >::Cell

template<class C, class M>

typedef solver_of<C,M> mmx::solver< C, M >::MTH

template<class C, class M>

typedef MTH::Solutions mmx::solver< C, M >::Solutions

template<class C, class M>

typedef MTH::Strategy mmx::solver< C, M >::Strategy

Member Function Documentation

template<class C, class M>

template<class POL >

static Solutions mmx::solver< C, M >::solve ( const POL &  p )

inlinestatic

template<class C, class M>

template<class POL , class DOM >

static Solutions mmx::solver< C, M >::solve ( const POL &  p, const DOM &  dmn  )

inlinestatic

template<class C, class M>

template<class FT , class POL >

Seq< std::vector<FT> > mmx::solver< C, M >::solve	(	Seq< POL > &	p,
		Seq< Interval< base_t > > &	dom
	)

Approximates the first positive root of the polynomial p in the interval (u,v).

---

The documentation for this struct was generated from the following files:

• include/realroot/solver.hpp
• include/realroot/solver_mv_monomial.hpp