#include <IbexBisector.h>

Public Member Functions | |
| SmearFunction (const System &sys, REAL w=Bisector::default_prec, REAL ratio=Bisector::default_ratio) | |
| SmearFunction (const SmearFunction &smf) | |
| virtual SmearFunction * | copy () const |
| virtual void | accept_printer (const OperatorPrinter &p) const |
| Bisection | bisect (int last_var) const |
| Bisection | bisect () |
updated: September 2009 (B Neveu)
| ibex::SmearFunction::SmearFunction | ( | const System & | sys, | |
| REAL | w = Bisector::default_prec, |
|||
| REAL | ratio = Bisector::default_ratio | |||
| ) | [inline] |
Create a bisector with Smear function heuristic.
| sys | - The system of equations. | |
| w | (optional) - - the minimum width (diameter) an interval must have to be bisected (see w). | |
| ratio | (optional) - the ratio between the diameters of the left and the right parts of the bisected interval. Default value is 0.5, i.e. the interval is bisected at the midpoint. |
| ibex::SmearFunction::SmearFunction | ( | const SmearFunction & | smf | ) | [inline] |
Duplicate this instance (space is passed by reference).
| virtual SmearFunction* ibex::SmearFunction::copy | ( | ) | const [inline, virtual] |
implement the contractor abstract copy.
Reimplemented from ibex::RoundRobin.
| virtual void ibex::SmearFunction::accept_printer | ( | const OperatorPrinter & | p | ) | const [inline, virtual] |
Accept the pretty printer.
Reimplemented from ibex::RoundRobin.
| Bisection ibex::SmearFunction::bisect | ( | int | last_var | ) | const |
Bisect the box.
| last_var | - the last component that has been bisected. In case the jacobian matrix could not be computed correctly, the box is split with the round-robin strategy . |
Reimplemented from ibex::RoundRobin.
| Bisection ibex::SmearFunction::bisect | ( | ) | [inline, virtual] |
Bisect the current box
Reimplemented from ibex::RoundRobin.
1.5.5