Real algebraic number computation using interval arithmetic

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn Part F129620, Issue , 1992, Pages 195-205

  Johnson, J R ^a  

^a DREXEL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974685232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/143242.143311     Document Type: Conference Paper

References (24)

1. [AC76] A. Akritas and G. E. Collins. Polynomial real root isolation using Descartes' rule of signs. In Proceedings of SYMSAC 76, pages 272-275. ACM, New York, 1976.
2. [AH83] G. Alefeld and J. Herzberger. Introduction to Interval Computations. Academic Press, New York, 1983.
3. [CH74] G. E. Collins and E. Horowitz. The minimum root separation of a polynomial. Math. Comp., 28(126):589-597, April 1974.
4. [CJ89] G. E. Collins and J. R. Johnson. Quantifier elimination and the sign variation method for real root isolation. In Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, pages 264-271. ACM, 1989.
5. [CL76] G. E. Collins and R. Loos. Polynomial real root isolation by differentiation. In Proceedings of SYMSAC 76, pages 15-25, New York, 1976. ACM.
6. [Col77] G. E. Collins. Infallible calculation of polynomial zeros to specified precision. In Mathematical Software III. Academic Press, Inc., New York, San Francisco and London, 1977.
7. [Col91] George E. Collins. Announcement of SAC2-C system. Rutgers workshop on symbolic software for mathematical research, March 1991.
8. [CR88] M. Coste and M. F. Roy. Thorn's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets. Journal of Symbolic Computation, 5(1, 2):121-129, 1988.
9. [DDD85] J. Delia Dora, C. Dicrescenzo, and D. Duval. About a new method for computing in algebraic number fields. In Proc. EUROCAL 85, volume 204 of Springer Lecture Notes in Computer Science, pages 289-290, Berlin, Heidelberg, New York, Tokyo, 1985. Springer-Verlag.
10. [Dem87] James W. Demmel. On Condition Numbers and the Distance to the Nearest Ill-posed Problem. Numerische Mathematik, 51:251-289, 1987.
11. [Han78] Eldon Hansen. A globally convergent interval method for computing and bounding real roots. BIT, 18:415-424, 1978.
12. [Hou77] D. Hough. A study of El-Conditioned Polynomials. PhD thesis, University of California-Berkeley, 1977.
13. [Joh91] J. R. Johnson. Algorithms for polynomial real root isolation. Technical Report OSU-CISRC-8/91-TR21, Department of Computer and Information Science, The Ohio State University, August 1991. Ph. D. Thesis.
14. [Mah64] K. Mahler. An inequality for the discriminant of a polynomial. Michigan Mathematics Journal, 11(3):257-262, September 1964.
15. [Mar49] M. Marden. The Geometry of Zeros of a Polynomial in a Complex Variable, volume 3 of Mathematics Surveys. American Mathematics Society, Providence Rhode Island, 1949.
16. [m0066] R. E. Moore. Interval Analysis. Series in Automatic Computation. Prentice-Hall, Inc., Engle-wood Cliffs, N. J., 1966.
17. [Moo79] R. E. Moore. Methods and Applications of Interval Arithmetic. Studies in Applied Mathematics. SIAM, 1979.
18. [Pin76] J. R. Pinkert. Interval arithmetic applied to polynomial remainder sequences. In Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, pages 214-218, 1976.
19. [RS90] M.-F. Roy and A. Szpirglas. Complexity of computation of real algebraic numbers. Journal of Symbolic Computation, 10:39-51, 1990.
20. [Rub73] C. M. Rubald. Algorithms for Polynomials over a Real Algebraic Number Field. PhD thesis, University of Wisconsin, 1973.
21. [Rum76] S. M. Rump. On the sign of a real algebraic number. In Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, pages 238-241, New York, 1976. ACM.
22. [Rum88] S. M. Rump. Algebraic computation, numerical computation and verified inclusions. In R. Janssen, editor, Trends in Computer Algebra, volume 296 of Lecture Notes in Computer Science, pages 177-197, Berlin-Heidelberg-New York, 1988. Springer-Verlag.
23. [Sch85] Arnold Schönhage. Quasi-GCD computations. Journal of Complexity, 1. 118-137, 1985.
24. [Wil59] J. H. Wilkinson. The evaluation of the zeros of ill-conditioned polynomials, parts i and ii. Numerische Mathematik, 1:150-166, 167-180, 1959.