ACM Home Page
Please provide us with feedback. Feedback
Real algebraic number computation using interval arithmetic
Full text PdfPdf (1.12 MB)
Source International Conference on Symbolic and Algebraic Computation archive
Papers from the international symposium on Symbolic and algebraic computation table of contents
Berkeley, California, United States
Pages: 195 - 205  
Year of Publication: 1992
ISBN:0-89791-489-9
Author
Sponsors
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/143242.143311
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

AC76
 
AH83
G. Alefeld and J. Herzberger. Introduction to In. terval Computations. Academic Press, New York, 1983.
 
CH74
G. E. Collins and E. Horowitz. The minimum root separation of a polynomial. Math. Comp., 28(126):589-597, April 1974.
CJ89
CL76
 
Col77
G. E. Collins. Infallible calculation of polynomial zeros to specified precision. In Mathematical Software 111. Academic Press, Inc., New York, San Francisco and London, 1977.
 
Col91
George E. Collins. Announcement of SAC2-C system. Rutgers workshop on symbolic software for mathematical research, March 1991.
 
CR88
 
DDD85
 
Dem87
 
Han78
Eldon Hansen. A globally convergent interval method for computing and bounding real roots. BIT, 18:415-424, 1978.
 
Hou77
D. Hough. A study of Bl-Conditioned Polynomials. PhD thesis, University of California-Berkeley, 1977.
 
Joh91
 
Mah64
K. Mahler. An inequality for the discriminant of a polynomial. Michigan Mathematics Journal, 11(3):257-262, September 1964.
 
Mar49
M. Marden. The Geometry o} Zeros o} a Polynomial in a Complex Variable, volume 3 of Mathematics Surveys. American Mathematics Society, Providence Rhode island, 1949.
 
Moo66
R. E. Moore. Interval Analysis. Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1966.
 
Moo79
Pin76
 
RS90
 
Rub73
Rum76
 
Rum88
 
Sch85
Arnold SchSnhage. Quasi-GCD computations. Journal of Complexity, 1:118-137, 1985.
 
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.



Peer to Peer - Readers of this Article have also read: