Lee E. Heindel
- 1 COLLINS, G.E. Computing time analyses for some arithmetic and algebraic algorithms. Proc. 1968 Summer Institute on Symbolic Mathematical Computation. R. G. Tobey, Ed., IBM Boston Programming Center (June 1969), pp. 195-231.Google Scholar
- 2 COLLINS, G.E. Algebraic Algorithms. Prentice-Hall, Englewood Cliffs, N.J. (to be published).Google Scholar
- 3 COLLINS, G.E. The calculation of multivariate polynomial resultants. Proc. 2nd Symposium on Symbolic and Algebraic Manipulation. ACM, New York, 1971, pp. 212-222; J. ACM 18, 4 (Oct. 1971), 515-532. Google Scholar
- 4 HEINDEL, L. E. Algorithms for Exact Polynomial Root Calculation. Ph.D. Diss., U. of Wisconsin, Madison, Wis. (1970). Google Scholar
- 5 HURWITZ, A. Uber den Satz von Budan-Fourier, Math. Ann. 71 (1912), 584-591.Google Scholar
- 6 KNUTH, D. E. The Art of Computer Programming, Vol. II: Seminumerical Algorithms. Addison-Wesley, Reading, Mass., 1968. Google Scholar
- 7 TARSKI, A. A Decision Method for Elementary Algebra and Geometry. U. of California Press, Berkeley, 1951.Google Scholar
- 8 WILF, H.S. Mathematics for the Physical Sciences. Wiley, New York, 1962.Google Scholar
Index Terms
- Integer Arithmetic Algorithms for Polynomial Real Zero Determination
Recommendations
Integer arithmetic algorithms for polynomial real zero determination
SYMSAC '71: Proceedings of the second ACM symposium on Symbolic and algebraic manipulationThis paper discusses a set of algorithms which given a univariate polynomial with integer coefficients (with possible multiple zeros) and a positive rational error bound, uses infinite-precision integer arithmetic and Sturm's Theorem to compute ...
Circular arithmetic and the determination of polynomial zeros
Suppose all zeros of a polynomial p but one are known to lie in specified circular regions, and the value of the logarithmic derivative p p 1 is known at a point. What can be said about the location of the remaining zero__ __ This question is ...
Comments