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

numerical examplesparallel computationLaguerresimple rootscomparison of methodsroots of polynomialsvector 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) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

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

• 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?)
• A Survey of Parallelism in Numerical Analysis
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• A comparison of non-linear equation solvers
• 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
• 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

(25)

• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• scientific article; zbMATH DE number 4064369 (Why is no real title available?)
• Parallel algorithms for some algebraic operations on polynomial equations
• A parallel root-finding algorithm
• 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
• Construction of zero-finding methods by Weierstrass functions
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• Locating and computing in parallel all the simple roots of special functions using PVM
• On new higher order families of simultaneous methods for finding polynomial zeros
• scientific article; zbMATH DE number 1206074 (Why is no real title available?)
• scientific article; zbMATH DE number 4176359 (Why is no real title available?)
• On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
• Point estimation of a family of simultaneous zero-finding methods
• A globally convergent parallel algorithm for zeros of polynomial systems
• On a cubically convergent derivative-free root finding method
• The use of the CESTAC method in the parallel computation of roots of polynomials
• Two Strategies for Root Finding on Multiprocessor Systems
• On the fourth order methods of Weierstrass' type
• On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
• Efficient parallel rooting of complex polynomials on the unit circle
• A posteriori error bound methods for the inclusion of polynomial zeros
• Computing roots of polynomials on vector processing machines
• A family of simultaneous zero-finding methods
• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• The granularity of parallel homotopy algorithms for polynomial systems of equations

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)