|
#include <CGAL/Algebraic_kernel_d_1.h>
The class represents an algebraic real root by a square free polynomial and an isolating interval that uniquely defines the root. The template argument Coeff determines the coefficient type of the kernel, which is also the coefficient type of the supported polynomials.
Currently, the following coefficient types are supported:
- Gmpz, Gmpq, (requires configuration with external libraries GMP, MPFR and MPFI)
- CORE::BigInt, CORE::BigRat, (requires configuration with external library GMP)
- leda_integer, leda_rational. (requires configuration with external library LEDA)
The current method to isolate roots is the bitstream Descartes method presented in [Eig08]. The used method to refine the approximation of an algebraic real root is a slightly modified (filtered) version of the one presented in [Abb]. The method has quadratic convergence.
|
| |
|
Same type as the template argument Coeff.
| |
|
| |
|
A model of AlgebraicKernel_d_1::Polynomial_1.
| |
|
| |
|
A model of AlgebraicKernel_d_1::AlgebraicReal_1.
| |
|
| |
|
The choice of Coeff also determines the provided bound, type.
In case of Coeff is: - Gmpz or Gmpq this is Gmpq, - CORE::BigInt or CORE::BigInt this is CORE::BigRat, - leda_integer or leda_integer this is leda_rational.
| |
|
| |
|
The multiplicity type is int.
| |