On zeros of a complex polynomial

MaRDI QIDQ1891444zbMATH OpenFDO

Authors Ritu Agarwal, R. C. Mittal

Publication date 18 October 1995

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Bareiss's algorithmEuclidean algorithmRouth Array-type algorithmzeros of complex polynomials

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) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Review text

In this paper the authors develop an algorithm to find the zeros of polynomials having complex coefficients. The procedure is based upon a technique that combines integer preserving Bareiss's algorithm or Euclidean algorithm, iterative division using Newton's method for solving system of equations, argument-principle and deflated polynomial approximations. It is observed that the method works well and produces accurate zeros within a specified accuracy.

Recommendations

• An algorithm for locating all zeros of a real polynomial
• A hybrid method for polynomial complex zero
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• On the Complexity of Polynomial Zeros
• A fixed-point approach to locating polynomial zeros

Cited in

(21)

• A computational test for the existence of a polynomial zero
• A complete discrimination system for polynomials with complex coefficients and its automatic generation
• Polynomial root finding by means of continuation
• An algebraic algorithm to isolate complex polynomial zeros using Sturm sequences
• The derivation method to calculate the zeros of polynomials
• Exact computation of polynomial zeros expressible by square roots
• Generalizations of an algorithm of Sebastião e Silva
• Identification of the domain, ranges, and values of complex roots of a polynomial with complex coefficients based on stable address sorting
• A new description of the complex roots using zeros of some polynomials
• Comment on ``Nonlinear differential algorithm to compute all the zeros of a generic polynomial [J. Math. Phys. 57, 083508 (2016)]
• scientific article; zbMATH DE number 3958577 (Why is no real title available?)
• scientific article; zbMATH DE number 4078649 (Why is no real title available?)
• scientific article; zbMATH DE number 4084864 (Why is no real title available?)
• An algorithm for computing the roots of a complex polynomial
• scientific article; zbMATH DE number 2098030 (Why is no real title available?)
• A fixed-point approach to locating polynomial zeros
• scientific article; zbMATH DE number 4184938 (Why is no real title available?)
• Finding the roots of polynomial equations: An algorithm with linear command
• Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation
• A hybrid method for polynomial complex zero
• A quasi-shrinking rectangle algorithm for complex zeros of a function

This page was built for publication: On zeros of a complex polynomial

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