A parallel Wilf algorithm for complex zeros of a polynomial

DOI10.1007/BF01934075MaRDI QIDQ1156457zbMATH OpenOpenAlexFDO

Authors E. V. Krishnamurthy, H. Venkateswaran

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

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

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3279131 (Why is no real title available?)
• scientific article; zbMATH DE number 3300739 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3053340 (Why is no real title available?)
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• An Exact Method for Finding the Roots of a Complex Polynomial
• Some modifications of Laguerre's method
• The use of finite-segmentp-adic arithmetic for exact computation
• Upperbounds for roots of polynomials

Cited in

(5)

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

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

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