Locating multiple zeros interactively

DOI10.1016/0898-1221(85)90042-2zbMath0579.65038OpenAlexW2000379413MaRDI QIDQ1067359

B. George

Publication date: 1985

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(85)90042-2

zbMATH Keywords

convergenceiterationcircles containing zerosparallel search algorithmtotal or partial factorization of a polynomial

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) 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)

Related Items (10)

Modified Newton method in circular interval arithmetic ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices ⋮ Computer visualization and dynamic study of new families of root-solvers ⋮ Computing multiple roots of inexact polynomials ⋮ Iteration functions re-visited ⋮ Newton-type iterative methods for finding zeros having higher multiplicity ⋮ Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic ⋮ On the convergence of Wang-Zheng's method ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parallel Wilf algorithm for complex zeros of a polynomial
• Improving the Van de Vel root-finding method
• Simultaneous inclusion of the zeros of a polynomial
• A Modified Bairstow Method for Multiple Zeros of a Polynomial
• A Machine Method for Solving Polynomial Equations
• Computers and the Multiplicity of Polynomial Roots
• A graphical technique for nonlinear algebraic equations
• Multiple solutions of nonlinear equations: Roots of polynomials
• Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• A new method for solving polynomial equations
• An algorithm for the total, or partial, factorization of a polynomial
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• A combined graphical and iterative approach to the problem of finding zeros of functions in the complex plane
• Finding zeros of a polynomial by the Q-D algorithm
• Factorization of a polynomial into quadratic factors by Newton method
• A Generalization of a Theorem of Bôcher
• On Lehmer's Method for Finding the Zeros of a Polynomial
• A Theorem on Clusters of Roots of Polynomial Equations
• Optimal Covering Algorithms in Methods of Search for Solving Polynomial Equations

This page was built for publication: Locating multiple zeros interactively