A parallel Wilf algorithm for complex zeros of a polynomial

DOI10.1007/BF01934075zbMath0468.65027OpenAlexW4246707649MaRDI QIDQ1156457

H. Venkateswaran, E. V. Krishnamurthy

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934075

zbMATH Keywords

complex zeros of a polynomial21, 104-111 (1981)parallel Wilf algorithmrecursive bisection algorithmreduction in complexity

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) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items (5)

Some parallel methods for polynomial root-finding ⋮ Modified Newton method in circular interval arithmetic ⋮ On the parallel arithmetic complexity of the root-finding problem ⋮ A parallel algorithm for finding roots of a complex polynomial ⋮ Locating multiple zeros interactively

Cites Work

• Upperbounds for roots of polynomials
• 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
• The use of finite-segmentp-adic arithmetic for exact computation
• Some modifications of Laguerre's method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parallel Wilf algorithm for complex zeros of a polynomial