A parallel algorithm for simple roots of polynomials
DOI10.1016/0898-1221(84)90042-7zbMATH Open0558.65028OpenAlexW2015867405MaRDI QIDQ762886FDOQ762886
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
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
- Efficient parallel rooting of complex polynomials on the unit circle
- Publication:4503867
- On a family of parallel root-finding methods for generalized polynomials
numerical examplesparallel computationLaguerresimple rootscomparison of methodsroots of polynomialsvector computerJenkins-TraubSIMD computer
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)
Cites Work
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Error Analysis for Numerical Differentiation
- A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
- Title not available (Why is that?)
- Title not available (Why is that?)
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- A comparison of non-linear equation solvers
- Principles for Testing Polynomial Zerofinding Programs
- Title not available (Why is that?)
- On Bairstow's Method for the Solution of Polynomial Equations
- 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
- Title not available (Why is that?)
Cited In (23)
- On the fourth order methods of Weierstrass' type
- Computing roots of polynomials on vector processing machines
- The granularity of parallel homotopy algorithms for polynomial systems of equations
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Locating and computing in parallel all the simple roots of special functions using PVM
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- Efficient parallel rooting of complex polynomials on the unit circle
- On a cubically convergent derivative-free root finding method
- Two Strategies for Root Finding on Multiprocessor Systems
- A family of simultaneous zero-finding methods
- A globally convergent parallel algorithm for zeros of polynomial systems
- Construction of zero-finding methods by Weierstrass functions
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
- Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
- Title not available (Why is that?)
- On new higher order families of simultaneous methods for finding polynomial zeros
- A posteriori error bound methods for the inclusion of polynomial zeros
- Point estimation of a family of simultaneous zero-finding methods
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- Parallel algorithms for some algebraic operations on polynomial 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)
