Finding a cluster of zeros of univariate polynomials (Q1594831)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1558137
Language Label Description Also known as
default for all languages
No label defined
    English
    Finding a cluster of zeros of univariate polynomials
    scientific article; zbMATH DE number 1558137

      Statements

      Finding a cluster of zeros of univariate polynomials (English)
      0 references
      5 July 2001
      0 references
      A method to compute an accurate approximation for a zero cluster of a complex univariate polynomial is presented. The methodology is based on homotopy. Newton's method, and Rouché's theorem. The homotopy method provides a point close to the cluster. The Newton method in the neighborhood of a zero cluster gives the number of zeros in the cluster, where it is sufficient to know three points of the Newton sequence in order to generate an open disk susceptible to contain all zeros of the cluster. An inclusion test based on a punctual version of the Rouché theorem validates the previous step. Numerical examples illustrate the effectiveness of the algorithm.
      0 references
      polynomial roots
      0 references
      Newton's method
      0 references
      numerical examples
      0 references
      zero cluster
      0 references
      homotopy method
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references