Generic computation of the real closure of an ordered field

Mathematics and Computers in Simulation

Volumn 42, Issue 4-6, 1996, Pages 541-549

  Ligatsikas, Zenon ^a   Rioboo, Renaud ^b   Roy, Marie Françoise ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Axiom; Real algebraic numbers

Indexed keywords

ALGEBRA; NUMBER THEORY; POLYNOMIALS; ROOT LOCI; THEOREM PROVING;

AXIOM; GENERIC COMPUTATION; ORDERED FIELD; REAL ALGEBRAIC NUMBER; REAL CLOSURE;

COMPUTATION THEORY;

EID: 0030290694     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4754(96)00031-6     Document Type: Article

References (14)

1. M. Ben-Or, D. Kozen and J. Reif, The complexity of elementary algebra and geometry, J. Comput. System Sci. 32 (1986) 251-264.
2. G.E. Collins and R. Loos, Real zeros of polynomials, in: Computer Algebra (Springer, New York, 1982) 83-94.
3. M. Coste and M.F. Roy, Thom's Lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets, J. Symbolic Comput. 5 (1988) 121-129.
4. A. Frohlich and J.C. Shepherdson, Effective procedures in field theory, Phil. Trans. Roy. Soc. London (1956) 407-432.
5. A. Hollkott, Finite Konstruktion geordneter algebraischer Erweterungen von geordneten Grundkorpern, Dissertation, Hamburg, 1941.
6. R.D. Jenks, R.S. Sutor and S.M. Watt, Scratchpad II: An Abstract Datatype System for Mathematical Computation, Lecture Notes in Computer Science, 296 (12) (Springer, New York, 1988).
7. J.R. Johnson, Algorithms for polynomial real root isolation, Department of Computer and Information Science, The Ohio State University, 1991.
8. L. Langmyr, Algorithms for a multiple algebraic extension, in: Effective Methods in Algebraic Geometry, Progress in Mathematics, Vol. 94 (Birkhauser, Boston, 1990) 235-248.
9. H. Lombardi and M.F. Roy, Elementary constructive theory of ordered fields, in: EffectiveMethods in Algebraic Geometry, Progress in Mathematics, Vol. 109 (Birkhauser, Boston, 1992) 249-262.
10. R. Loos, Computing in algebraic extensions in: Computer Algebra (Springer, New York, 1982) 173-187.
11. R. Riboo, Quelques aspects du calcul exact avec les nombers réels, Institut Blaise Pascal, Paris, 1991.
12. R. Riboo, Real algebraic closure of an ordered field implementation in Axiom, in: Proc. ISSAC'92 Conf. (Berkeley, 1991) 206-215.
13. M.F. Roy and A. Szpirglas, Complexity of computation on real algebraic numbers, J. Symbolic Comput. 10 (1990) 39-51.
14. H. Zassenhaus, A real root calculus, in: Computational Aspects in Abstract Algebra (Pergamon, Oxford, 1967) 383-392.