Computing real zeros of polynomials with SAC-1

ABSTRACT

SAC-1 contains a subsystem for computing real zeros of univariate polynomials over the integers. Here we present an engineering approach to the improvement of this subsystem. We will show that a considerable amount of computing time can be saved by replacing just one subroutine.

REFERENCES

• 1: Collins G. E., The SAC-1 list processing System, University of Wisconsin Computing Center, Technical Report No 129, July 1971.
• 2: Collins G. E., The SAC-1 Integer arithmetic system - Version III, University of Wisconsin Computing Center, Technical Report No 156, March 1973.
• 3: Collins G. E., High precision calculation of Real Algebraic Numbers, abstract in Sigsam vol. 8, No 4, November 1974.
• 4: Collins G. E. and Heindel L. E., The SAC-1 polynomial real zero system, University of Wisconsin Computing Center, Technical Report No. 18, August 1970.
• 5: Dekker J. C., Zeroin, Constructive aspects of the fundamental theorem of algebra.
• 6: Ralston A. and Wilf H., Mathematical methods for digital computers, John Wiley New York.