Finding a cluster of zeros of univariate polynomials
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.
- A convergent process of price adjustment and global Newton methods
- A Generalization of a Theorem of Bôcher
- A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
- Analysis of Newton’s Method at Irregular Singularities
- Computing singular solutions to nonlinear analytic systems
- Condition Number Analysis for Sparse Polynomial Systems
- Contraction, robustness, and numerical path-following using secant maps.
- Convergence of the Newton process to multiple solutions
- How to find all roots of complex polynomials by Newton's method.
- scientific article; zbMATH DE number 3970003 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 953018 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- Iterative methods for simultaneous inclusion of polynomial zeros
- Localization of an algebraic hypersurface by the exclusion algorithm
- Newton’s Method at Singular Points. I
- Newton’s Method at Singular Points. II
- On Algorithms for Solvingf(x)=0
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Polynomial Root-Finding Algorithms and Branched Covers
- Solving a Polynomial Equation: Some History and Recent Progress
- Nearest multivariate system with given root multiplicities
- Detection and validation of clusters of polynomial zeros
- Enclosing clusters of zeros of polynomials
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- On locating clusters of zeros of analytic functions
- Clustering complex zeros of triangular systems of polynomials
- A general approach to the study of the convergence of Picard iteration with an application to Halley's method for multiple zeros of analytic functions
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials
- Sigmoid-like functions and root finding methods
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- A certified iterative method for isolated singular roots
- Computing clustered close-roots of univariate polynomials
- scientific article; zbMATH DE number 1254284 (Why is no real title available?)
- scientific article; zbMATH DE number 1859224 (Why is no real title available?)
- Computing real roots of real polynomials
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- Numerical factorization of multivariate complex polynomials
- Relations between roots and coefficients, interpolation and application to system solving
- General local convergence theory for a class of iterative processes and its applications to Newton's method
This page was built for publication: Finding a cluster of zeros of univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594831)
