The LEDA number type real is extended by the diamond operator, which allows to compute exactly with real algebraic numbers given as roots of polynomials. The coefficients of these polynomials can be arbitrary real algebraic numbers. The two important steps of the implementation (isolating interval computation and approximation) are described. Experiments with two other existing implementations of real algebraic numbers (CORE, EXACUS) show that the implementation is comparable with CORE and is more general than CORE or EXACUS
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceWe describe here a representation of computable real numbers and a set of algo...
This paper describes a formalization of discrete real closed fields in theCoq proof assistant. This ...
The LEDA number type real is extended by the diamond operator, which allows to compute exactly with ...
Real algebraic numbers are real roots of polynomials with integral coefficients. They can be represe...
Abstract. Real algebraic numbers are the real numbers that are real roots of univariate polynomials ...
We describe the implementation of the LEDA data type {\bf real}. Every integer is a real and reals a...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and...
This paper presents a construction of the real algebraic numbers with executable arithmetic operatio...
AbstractIn this paper we present two methods of computing with complex algebraic numbers. The first ...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
AbstractWe describe here a representation of computable real numbers and a set of algorithms for the...
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, soun...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceWe describe here a representation of computable real numbers and a set of algo...
This paper describes a formalization of discrete real closed fields in theCoq proof assistant. This ...
The LEDA number type real is extended by the diamond operator, which allows to compute exactly with ...
Real algebraic numbers are real roots of polynomials with integral coefficients. They can be represe...
Abstract. Real algebraic numbers are the real numbers that are real roots of univariate polynomials ...
We describe the implementation of the LEDA data type {\bf real}. Every integer is a real and reals a...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and...
This paper presents a construction of the real algebraic numbers with executable arithmetic operatio...
AbstractIn this paper we present two methods of computing with complex algebraic numbers. The first ...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
AbstractWe describe here a representation of computable real numbers and a set of algorithms for the...
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, soun...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceWe describe here a representation of computable real numbers and a set of algo...
This paper describes a formalization of discrete real closed fields in theCoq proof assistant. This ...