On the convergence condition of generalized root iterations for the inclusion of polynomial zeros

DOI10.1016/J.MATCOM.2007.05.002zbMATH Open1146.65044OpenAlexW2005454998MaRDI QIDQ929751FDOQ929751

D. M. Milošević, M. S. Petković

Publication date: 18 June 2008

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2007.05.002

Recommendations

• The convergence of a family of parallel zero-finding methods
• On the Newton-like method for the inclusion of a polynomial zero
• Improved methods for the simultaneous inclusion of multiple polynomial zeros
• On the simultaneous improving k inclusion disks for polynomial zeros
• scientific article

zbMATH Keywords

algebraic polynomialspolynomial zeroscircular interval arithmeticconvergence conditionsinclusion methodsinterval methodscomplex zeroscircular complex arithmeticsimultaneous inclusion

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) 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) Interval and finite arithmetic (65G30)

Cites Work

• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Title not available (Why is that?)
• Title not available (Why is that?)
• Iterative methods for simultaneous inclusion of polynomial zeros
• Parallel Laguerre iterations: The complex case
• Circular arithmetic and the determination of polynomial zeros
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Note on the Evaluation in Circular Arithmetics
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Approximate Zeros of Quadratically Convergent Algorithms
• Ten methods to bound multiple roots of polynomials
• The theory of Smale's point estimation and its applications
• Weierstrass formula and zero-finding methods
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• On zero finding methods of higher order from data at one point
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
• A higher order family for the simultaneous inclusion of multiple zeros of polynomials
• Title not available (Why is that?)
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
• An Existence Test for Root Clusters and Multiple Roots
• Ostrowski-like method with corrections for the inclusion of polynomial zeros
• A computational test for the existence of a polynomial zero
• On an iterative method for simultaneous inclusion of polynomial complex zeros
• On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial. II

Cited In (3)

• On initial conditions for the convergence of simultaneous root finding methods
• Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
• On the Newton-like method for the inclusion of a polynomial zero

Uses Software

• na20

This page was built for publication: On the convergence condition of generalized root iterations for the inclusion of polynomial zeros

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q929751)