- Improved detection of numeric values for linear polynomials in interval-represented numbers.
- Fixed some marginal cases in the sample construction in
`CAD`

. - Improvements in the elimination phase in
`CAD`

.

- Improvements in the
`CAD`

data structures. - Bugfixes in
`RealAlgebraicNumberFactory`

resolving some problems in the CAD sample construction.

- Improvements in
`CAD::liftCheck`

implementing several heuristics, e.g., preference of root/non-root samples. - Extended
`CADSettings`

. - Fixed some bugs in the lifting phase of
`CAD`

. - Bugfixes in
`CAD::addPolynomial`

and`CAD::eliminationSets`

. - Improvements in
`RationalUnivariatePolynomial::evaluateAt`

. - Improvements in
`RealAlgebraicNumberFactory`

and`CAD::samples`

resulting in a better detection and choice of numeric sample points. - Revised CAD-related examples regarding the new heuristics.

- Fixed bug in
`CAD::samples`

which lead to incomplete sample construction in some cases. - Added further settings to
`CADSettings`

. - Improved evaluation of polynomials in a numeric value.
- Added real root finding heuristics utilizing Newton's method for real root finding.

- Important improvements to
`RealAlgebraicNumberIR`

and`RealAlgebraicNumberFactory`

, in particular: - Removed auxiliary data type
`RealalgebraicUnivariatePolynomial`

for the benefit of more sophisticated methods for the substitution of interval-represented numbers in coefficients of parameterized univariate polynomials in`RealAlgebraicNumberFactory`

. - Re-implemented
`RealAlgebraicNumberFactory::evaluateIR`

. - Added method
`RealAlgebraicNumberFactory::realRootsEval`

for the computation of real roots of parameterized univariate polynomials. - Improvements to
`OpenInterval::sample`

improving`RealAlgebraicNumberIR::refine`

. Now the sample search algorithm uses machine arithmetic in reasonable cases. - Improvements to
`CAD`

, for example: - Easy adjustable heuristics via the class
`CADSettings`

. - Pruning of useless polynomials in elimination sets by real root counting.

- Interface change in
`Groebner`

. - Small fixes.

- License changed from LGPLv3 to GPLv3.
- Project moved to powerful build system CMake.
- Class
`CAD`

providing basic functionality in order to compute a cylindrical algebraic decomposition (CAD). - New data type for real roots abstracting also numeric roots:
`RealAlgebraicNumber`

. - More efficient implementation of the interval representation of real roots in
`RealAlgebraicNumberIR`

. - Data structure for real roots in multi dimensions:
`RealAlgebraicPoint`

. - Preliminary data structure for polynomials with real algebraic numbers in their coefficients.
- Computation of a Gröbner basis by Buchberger′s algorithm.
- New and very efficient design of the data types for multivariate polynomials.
- Complete re-implementation of
`MultivariatePolynomial`

in an efficient monomial-based representation`MultivariatePolynomialMR`

. - Stand-alone implementation of resultant and subresultant computations.
- Many bugs fixed.

- Added real roots computation feature to
`ginacraconsole`

. - Added readline support for
`ginacraconsole`

. - Several bugfixes and improvements in
`MultivariatePolynomial`

. - Added factory class for
`MultivariatePolynomial`

now containing all relevant methods generating`MultivariatePolynomial`

objects. - Improvements to
`IntervalRepresentationFactory`

; in particular, stability and efficiency of real root isolation.

- Bugfixes and new test cases.
- Added factory class for
`IntervalRepresentation`

now containing all relevant methods generating`IntervalRepresentation`

objects. - Removed files
`algorithms.h`

and`algorithms.cpp`

while moving their methods to other files.

- Bugfixes and new test cases.
- Added files
`algorithms.h`

and`algorithms.cpp`

containing methods based on all GiNaCRA classes.

- Bugfixes and new test cases.
- Added method to compute (common) real roots of a (set of) univariate polynomials.