A parallel algorithm for finding roots of a complex polynomial
From MaRDI portal
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)
Recommendations
Cites work
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
- scientific article; zbMATH DE number 4176359 (Why is no real title available?)
- A parallel root-finding algorithm
- Efficient parallel rooting of complex polynomials on the unit circle
- A parallel complex zero finder
- scientific article; zbMATH DE number 4064369 (Why is no real title available?)
- A parallel algorithm for simple roots of polynomials
- Finding the roots of polynomial equations: An algorithm with linear command
- scientific article; zbMATH DE number 2232802 (Why is no real title available?)
- 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)