On the guaranteed convergence of new two-point root-finding methods for polynomial zeros

DOI10.1007/S11075-013-9782-ZMaRDI QIDQ742856zbMATH OpenOpenAlexFDO

Authors M. S. Petković, Lidija Z. Rančić

Publication date 19 September 2014

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-013-9782-z

zbMATH Keywords

convergenceiterative methodsnumerical examplepolynomial zerosroot-finding methodsOstrowski two-point methodWeierstrass correction

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• Point estimation of root finding methods
• Convergence of the two-point Weierstrass root-finding method
• On the guaranteed convergence of Chebishev-like method for computing polynomial zeros

Cites work

• scientific article; zbMATH DE number 3116991 (Why is no real title available?)
• scientific article; zbMATH DE number 3875911 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 1194122 (Why is no real title available?)
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 3992817 (Why is no real title available?)
• scientific article; zbMATH DE number 3795285 (Why is no real title available?)
• scientific article; zbMATH DE number 930560 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• A derivative-free iterative method for simultaneously computing an arbitrary number of zeros of nonlinear equations
• A family of two-point methods with memory for solving nonlinear equations
• An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
• Approximate Zeros of Quadratically Convergent Algorithms
• Convergence conditions of some methods for the simultaneous computation of polynomial zero
• Families of optimal multipoint methods for solving nonlinear equations: a survey
• Higher-order iteration functions for simultaneously approximating polynomial zeros
• Improvement of a convergence condition for Durand-Kerner iteration
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Multipoint methods for solving nonlinear equations
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• Numerical methods for roots of polynomials. Part I
• On Q-order and R-order of convergence
• On a cubically convergent derivative-free root finding method
• On initial conditions for the convergence of simultaneous root finding methods
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• On the convergence order of accelerated root iterations
• Point estimation of root finding methods
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
• The theory of Smale's point estimation and its applications
• Weierstrass formula and zero-finding methods

Cited in

(1)

• On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials

This page was built for publication: On the guaranteed convergence of new two-point root-finding methods for polynomial zeros

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