Some parallel methods for polynomial root-finding

DOI10.1016/0377-0427(87)90056-2zbMath0622.65034OpenAlexW1988566873MaRDI QIDQ1091080

A. J. Maeder, S. A. Wynton

Publication date: 1987

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(87)90056-2

zbMATH Keywords

zerosparallel algorithmspolynomial root-finding

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) Parallel numerical computation (65Y05) Real polynomials: location of zeros (26C10)

Uses Software

• CPOLY

Cites Work

• A parallel Wilf algorithm for complex zeros of a polynomial
• Parallel methods for solving equations
• Parallel numerical methods for the solution of equations
• Principles for Testing Polynomial Zerofinding Programs
• An Exact Method for Finding the Roots of a Complex Polynomial
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Generalizations of Horner's Rule for Polynomial Evaluation
• A modified Newton method for polynomials
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros
• The Parallel Evaluation of Arithmetic Expressions Without Division
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some parallel methods for polynomial root-finding