A parallel algorithm for finding roots of a complex polynomial

DOI10.1007/BF02946566MaRDI QIDQ805233zbMATH OpenFDO

Authors Jinsong Cheng

Publication date 1990

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

parallel algorithmroots of a complex polynomialWilf algorithm

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) Parallel numerical computation (65Y05) Distributed algorithms (68W15)

Recommendations

• A parallel algorithm for simple roots of polynomials
• On the parallel arithmetic complexity of the root-finding problem
• On the Complexity of Polynomial Zeros
• An efficient algorithm for the complex roots problem
• scientific article; zbMATH DE number 880381

Cites work

• A parallel Wilf algorithm for complex zeros of a polynomial
• scientific article; zbMATH DE number 3145583 (Why is no real title available?)

Cited in

(13)

• 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
• A parallel complex zero finder
• The properties of a new subclass of harmonic univalent mappings
• scientific article; zbMATH DE number 4176359 (Why is no real title available?)
• A parallel root-finding algorithm
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• scientific article; zbMATH DE number 4064369 (Why is no real title available?)
• Efficient parallel rooting of complex polynomials on the unit circle
• scientific article; zbMATH DE number 880381 (Why is no real title available?)
• scientific article; zbMATH DE number 2232802 (Why is no real title available?)
• Finding the roots of polynomial equations: An algorithm with linear command
• A parallel algorithm for simple roots of polynomials
• Finding the roots of a polynomial on an MIMD multicomputer

This page was built for publication: A parallel algorithm for finding roots of a complex polynomial

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