solver< C, M > Struct Template Reference

#include <solver.hpp>

List of all members.

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 >

Definition at line 67 of file solver.hpp.

---

Member Typedef Documentation

typedef MTH::Cell Cell

Definition at line 69 of file solver.hpp.

typedef solver_of<C,M> MTH

Definition at line 68 of file solver.hpp.

typedef MTH::Solutions Solutions

Definition at line 71 of file solver.hpp.

typedef MTH::Strategy Strategy

Definition at line 70 of file solver.hpp.

---

Member Function Documentation

Seq< std::vector<FT> > solve	(	Seq< POL > &	p,
		Seq< Interval< base_t > > &	dom
	)			[inline]

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 82 of file solver.hpp.

References subdivisor< CELL, V >::run(), and subdivisor< CELL, V >::solutions().

                                        {
      Cell* c = new Cell(p,dmn);
       subdivisor<Cell, Strategy> slv(c);
       slv.run();
       return slv.solutions();
    }

static Solutions solve

(

const POL &

p

)

[inline, static]

Definition at line 74 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().

                        {
       Cell* c = new Cell(p);
       subdivisor<Cell, Strategy> slv(c);
       slv.run();
       return slv.solutions();
    }

---

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

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