Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials

This publication has 6 references indexed in Scilit:

• An Exact Method for Finding the Roots of a Complex Polynomial
  ACM Transactions on Mathematical Software, 1976
• Parallel square root iterations
  Lecture Notes in Computer Science, 1975
• A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros
  Communications of the ACM, 1972
• Circular arithmetic and the determination of polynomial zeros
  Numerische Mathematik, 1971
• The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial
  SIAM Journal on Numerical Analysis, 1971
• Parallel Methods for Approximating the Root of a Function
  IBM Journal of Research and Development, 1969