A parallel algorithm for simple roots for polynomials

This publication has 10 references indexed in Scilit:

• Performance Measures for Evaluating Algorithms for SIMD Machines
  IEEE Transactions on Software Engineering, 1982
• A comparison of non-linear equation solvers
  Journal of Computational and Applied Mathematics, 1976
• Principles for Testing Polynomial Zerofinding Programs
  ACM Transactions on Mathematical Software, 1975
• Iteration methods for finding all zeros of a polynomial simultaneously
  Mathematics of Computation, 1973
• A Survey of Parallelism in Numerical Analysis
  SIAM Review, 1971
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
  SIAM Journal on Numerical Analysis, 1970
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration
  Numerische Mathematik, 1970
• Parallel Methods for Approximating the Root of a Function
  IBM Journal of Research and Development, 1969
• Corrections to numerical data on Q-D algorithm
  Communications of the ACM, 1966
• Finding zeros of a polynomial by the Q-D algorithm
  Communications of the ACM, 1965