A modified iterative method for finding the real roots of a polynomial

DOI10.20454/JMMNM.2012.128MaRDI QIDQ5744964zbMATH OpenOpenAlexFDO

Authors

Publication date 10 February 2016

Published in Journal of Modern Methods in Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20454/jmmnm.2012.128

zbMATH Keywords

contractive functionconvergencefixed point functionpolynomial rootssuccessive iteration

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• scientific article; zbMATH DE number 1921312
• The exact root algorithm for computing the real roots of an nth degree polynomial
• scientific article; zbMATH DE number 2097281
• Polynomial root finding by means of continuation
• A novel cubically convergent iterative method for computing complex roots of nonlinear equations

Cited in

(6)

• A combined method for polynomial roots using modified Newton-Raphson with minimum searching
• The polynomial pivots as initial values for a new root-finding iterative method
• Newton, Chebyshev, and Halley basins of attraction; a complete geometric approach
• The exact root algorithm for computing the real roots of an nth degree polynomial
• Scaled parallel iterative method for finding real roots of nonlinear equations
• A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography

This page was built for publication: A modified iterative method for finding the real roots of a polynomial

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