Towards Faster Real Algebraic Numbers - Archive ouverte HAL
Article Dans Une Revue Journal of Symbolic Computation Année : 2003

Towards Faster Real Algebraic Numbers

Renaud Rioboo
  • Fonction : Auteur
  • PersonId : 966166

Résumé

This paper presents a new encoding scheme for real algebraic number manipulations which enhances current Axiom’s real closure. Algebraic manipulations are performed using different instantiations of sub-resultant-like algorithms instead of Euclidean-like algorithms. We use these algorithms to compute polynomial gcds and Bezout relations, to compute the roots and the signs of algebraic numbers. This allows us to work in the ring of real algebraic integers instead of the field of real algebraic numbers avoiding many denominators.

Dates et versions

hal-01199502 , version 1 (15-09-2015)

Identifiants

Citer

Renaud Rioboo. Towards Faster Real Algebraic Numbers. Journal of Symbolic Computation, 2003, 36 (3-4), pp.513-533. ⟨10.1016/S0747-7171(03)00093-2⟩. ⟨hal-01199502⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

More