A parallel algorithm for finding roots of a complex polynomial

DOI10.1007/BF02946566zbMATH Open0728.68065MaRDI QIDQ805233FDOQ805233

Authors: Jinsong Cheng 

Publication date: 1990

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

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

zbMATH Keywords

parallel algorithmroots of a complex polynomialWilf algorithm

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Parallel numerical computation (65Y05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• A parallel Wilf algorithm for complex zeros of a polynomial

Cited In (11)

• The properties of a new subclass of harmonic univalent mappings
• 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?)
• A parallel root-finding algorithm
• Efficient parallel rooting of complex polynomials on the unit circle
• A parallel complex zero finder
• Title not available (Why is that?)
• A parallel algorithm for simple roots of polynomials
• Finding the roots of polynomial equations: An algorithm with linear command
• Title not available (Why is that?)
• Finding polynomial roots: A fast algorithm convergent on the complex plane

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)