A parallel algorithm for simple roots of polynomials

DOI10.1016/0898-1221(84)90042-7zbMath0558.65028OpenAlexW2015867405MaRDI QIDQ762886

Layne T. Watson, George F. R. Ellis

Publication date: 1984

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90042-7

zbMATH Keywords

comparison of methodsnumerical examplesparallel computationroots of polynomialsLaguerresimple rootsvector computerJenkins-TraubSIMD computer

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros, On a cubically convergent derivative-free root finding method, A posteriori error bound methods for the inclusion of polynomial zeros, On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros, A globally convergent parallel algorithm for zeros of polynomial systems, Construction of zero-finding methods by Weierstrass functions, A family of simultaneous zero-finding methods, On the fourth order methods of Weierstrass' type, On new higher order families of simultaneous methods for finding polynomial zeros, Point estimation of simultaneous methods for solving polynomial equations: A survey, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Point estimation of a family of simultaneous zero-finding methods, The granularity of parallel homotopy algorithms for polynomial systems of equations, On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of non-linear equation solvers
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Principles for Testing Polynomial Zerofinding Programs
• On Bairstow's Method for the Solution of Polynomial Equations
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Finding zeros of a polynomial by the Q-D algorithm
• Corrections to numerical data on Q-D algorithm
• Parallel Methods for Approximating the Root of a Function
• A Survey of Parallelism in Numerical Analysis
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• An Error Analysis for Numerical Differentiation