Locating multiple zeros interactively

DOI10.1016/0898-1221(85)90042-2MaRDI QIDQ1067359zbMATH OpenOpenAlexFDO

Authors 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

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials in real and complex fields: factorization (12D05) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 1929302
• On the Complexity of Polynomial Zeros
• scientific article; zbMATH DE number 3903860
• Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
• An algorithm for locating all zeros of a real polynomial

Cites work

• 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?)
• A Generalization of a Theorem of Bôcher
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• A Machine Method for Solving Polynomial Equations
• A Modified Bairstow Method for Multiple Zeros of a Polynomial
• A Theorem on Clusters of Roots of Polynomial Equations
• 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 graphical technique for nonlinear algebraic equations
• A new method for solving polynomial equations
• A parallel Wilf algorithm for complex zeros of a polynomial
• 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
• 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

Cited in

(12)

• Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
• 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 2047307 (Why is no real title available?)
• Iteration functions re-visited
• On the convergence of Wang-Zheng's method
• Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
• Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices
• scientific article; zbMATH DE number 3930240 (Why is no real title available?)
• Modified Newton method in circular interval arithmetic
• Newton-type iterative methods for finding zeros having higher multiplicity
• Computing multiple roots of inexact polynomials

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)