A parallel algorithm for simple roots of polynomials

DOI10.1016/0898-1221(84)90042-7MaRDI QIDQ762886zbMATH OpenOpenAlexFDO

Authors 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 methodsJenkins-TraubLaguerrenumerical examplesparallel computationroots of polynomialsSIMD computersimple rootsvector computer

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) 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)

Review text

An algorithm for the simultaneous finding of simple roots is presented. It is based on the theory of divided differences. The most time-consuming parts can run in parallel on a SIMD computer (and thus also on a vector computer). The method compares favorably to Laguerre's and to Jenkins- Traub's method.

Recommendations

• A parallel algorithm for finding roots of a complex polynomial
• Some parallel methods for polynomial root-finding
• A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
• scientific article; zbMATH DE number 880381
• A Simple Parallel Algorithm for Polynomial Evaluation
• A parallel root-finding algorithm
• scientific article; zbMATH DE number 4064369
• Efficient parallel rooting of complex polynomials on the unit circle
• Publication:4503867
• On a family of parallel root-finding methods for generalized polynomials

Cites work

• A comparison of non-linear equation solvers
• A Survey of Parallelism in Numerical Analysis
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• An Error Analysis for Numerical Differentiation
• Corrections to numerical data on Q-D algorithm
• Finding zeros of a polynomial by the Q-D algorithm
• scientific article; zbMATH DE number 3504426 (Why is no real title available?)
• scientific article; zbMATH DE number 3439855 (Why is no real title available?)
• scientific article; zbMATH DE number 862514 (Why is no real title available?)
• scientific article; zbMATH DE number 3240705 (Why is no real title available?)
• scientific article; zbMATH DE number 3269388 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• scientific article; zbMATH DE number 3420157 (Why is no real title available?)
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On Bairstow's Method for the Solution of Polynomial Equations
• Parallel Methods for Approximating the Root of a Function
• Principles for Testing Polynomial Zerofinding Programs

Cited in

(31)

• On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
• Computing roots of polynomials on vector processing machines
• On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
• Fast parallel algorithms for Graeffe's root squaring technique
• A family of simultaneous zero-finding methods
• Polynomial root computation by means of the LR algorithm
• Point estimation of a family of simultaneous zero-finding methods
• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• A posteriori error bound methods for the inclusion of polynomial zeros
• scientific article; zbMATH DE number 4176359 (Why is no real title available?)
• A parallel root-finding algorithm
• A globally convergent parallel algorithm for zeros of polynomial systems
• The use of the CESTAC method in the parallel computation of roots of polynomials
• Two Strategies for Root Finding on Multiprocessor Systems
• scientific article; zbMATH DE number 4064369 (Why is no real title available?)
• Efficient parallel rooting of complex polynomials on the unit circle
• scientific article; zbMATH DE number 1206074 (Why is no real title available?)
• On the fourth order methods of Weierstrass' type
• The granularity of parallel homotopy algorithms for polynomial systems of equations
• On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
• scientific article; zbMATH DE number 880381 (Why is no real title available?)
• On a cubically convergent derivative-free root finding method
• Locating and computing in parallel all the simple roots of special functions using PVM
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• A parallel algorithm for finding roots of a complex polynomial
• Finding the roots of a polynomial on an MIMD multicomputer
• Construction of zero-finding methods by Weierstrass functions
• Parallel algorithms for some algebraic operations on polynomial equations
• On new higher order families of simultaneous methods for finding polynomial zeros

This page was built for publication: A parallel algorithm for simple roots of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762886)