Locating multiple zeros interactively
The paper is concerned with an algorithm, which is implemented interactively, for the total or partial factorization of a polynomial. In the first phase, a parallel search algorithm is used to locate successively smaller circles containing zeros. This continues until a reliable estimation of the multiplicities of the zeros is possible. In the second phase, an iteration is applied which provides convergence of order 3 or 4. It is considered as important that in the second phase no deflation of the given polynomial is necessary because of the separation of the zeros. There are comments on various inclusion tests. The list of references contains 33 items.
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
- A combined graphical and iterative approach to the problem of finding zeros of functions in the complex plane
- A Generalization of a Theorem of Bôcher
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- A graphical technique for nonlinear algebraic equations
- A Machine Method for Solving Polynomial Equations
- A Modified Bairstow Method for Multiple Zeros of a Polynomial
- A new method for solving polynomial equations
- A parallel Wilf algorithm for complex zeros of a polynomial
- A Theorem on Clusters of Roots of Polynomial Equations
- An algorithm for the total, or partial, factorization of a polynomial
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
- Computers and the Multiplicity of Polynomial Roots
- Factorization of a polynomial into quadratic factors by Newton method
- Finding zeros of a polynomial by the Q-D algorithm
- scientific article; zbMATH DE number 3453038 (Why is no real title available?)
- scientific article; zbMATH DE number 3313124 (Why is no real title available?)
- scientific article; zbMATH DE number 3357943 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- scientific article; zbMATH DE number 3197530 (Why is no real title available?)
- Improving the Van de Vel root-finding method
- Multiple solutions of nonlinear equations: Roots of polynomials
- On Lehmer's Method for Finding the Zeros of a Polynomial
- Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations
- Simultaneous inclusion of the zeros of a polynomial
- On the convergence of Wang-Zheng's method
- Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices
- Modified Newton method in circular interval arithmetic
- Computer visualization and dynamic study of new families of root-solvers
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- scientific article; zbMATH DE number 3930240 (Why is no real title available?)
- scientific article; zbMATH DE number 2047307 (Why is no real title available?)
- Computing multiple roots of inexact polynomials
- Newton-type iterative methods for finding zeros having higher multiplicity
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
- Iteration functions re-visited
- Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
This page was built for publication: Locating multiple zeros interactively
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067359)
