realroot_doc 0.1.1
solver< C, M > Struct Template Reference

#include <solver.hpp>

List of all members.

Public Types

Public Member Functions

Static Public Member Functions


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, and solver_uv_test.cpp.

Definition at line 69 of file solver.hpp.


Member Typedef Documentation

typedef MTH::Cell Cell

Definition at line 71 of file solver.hpp.

typedef solver_of<C,M> MTH

Definition at line 70 of file solver.hpp.

Definition at line 73 of file solver.hpp.

Definition at line 72 of file solver.hpp.


Member Function Documentation

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().

                        {
       Cell* c = new Cell(p);
       subdivisor<Cell, Strategy> slv(c);
       slv.run();
       return slv.solutions();
    }
Seq< std::vector<FT> > solve ( Seq< POL > &  p,
Seq< Interval< base_t > > &  dom 
)

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().

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

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