Finding a cluster of zeros of univariate polynomials
From MaRDI portal
Publication:1594831
DOI10.1006/jcom.2000.0555zbMath0974.65045OpenAlexW2055700385MaRDI QIDQ1594831
Publication date: 5 July 2001
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2000.0555
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
Related Items
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, Numerical factorization of multivariate complex polynomials, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, A certified iterative method for isolated singular roots, Computing real roots of real polynomials, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Relations between roots and coefficients, interpolation and application to system solving, A higher order family for the simultaneous inclusion of multiple zeros of polynomials, General local convergence theory for a class of iterative processes and its applications to Newton's method, General convergence theorems for iterative processes and applications to the Weierstrass root-finding method, On isolation of simple multiple zeros and clusters of zeros of polynomial systems, Sigmoid-like functions and root finding methods, Nearest multivariate system with given root multiplicities, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Localization of an algebraic hypersurface by the exclusion algorithm
- A convergent process of price adjustment and global Newton methods
- Iterative methods for simultaneous inclusion of polynomial zeros
- Contraction, robustness, and numerical path-following using secant maps.
- Convergence of the Newton process to multiple solutions
- Computing singular solutions to nonlinear analytic systems
- Analysis of Newton’s Method at Irregular Singularities
- On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions
- Newton’s Method at Singular Points. I
- Newton’s Method at Singular Points. II
- On Algorithms for Solvingf(x)=0
- Polynomial Root-Finding Algorithms and Branched Covers
- Condition Number Analysis for Sparse Polynomial Systems
- Solving a Polynomial Equation: Some History and Recent Progress
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- A Generalization of a Theorem of Bôcher
- How to find all roots of complex polynomials by Newton's method.
