Traub's accelerating generator of iterative root-finding methods

DOI10.1016/j.aml.2011.03.027zbMath1291.65152OpenAlexW2073654278MaRDI QIDQ540311

Jovana Džunić, Mimica R. Milošević, Miodrag S. Petković

Publication date: 1 June 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.03.027

zbMATH Keywords

iterative methodsnonlinear equationsmultiple rootsacceleration of convergencesimultaneous methods

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

New families of third-order iterative methods for finding multiple roots

Cites Work

• Unnamed Item
• Improved methods for the simultaneous inclusion of multiple polynomial zeros
• On the new fourth-order methods for the simultaneous approximation of polynomial zeros
• Variants of a classic Traub's result
• Numerical methods for roots of polynomials. Part I
• Accelerating generators of iterative methods for finding multiple roots of nonlinear equations
• On some applications of circular complex functions
• A family of root finding methods
• A new continuation Newton-like method and its deformation
• Zur iterativen Auflösung algebraischer Gleichungen
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• On K nig's root-finding algorithms*
• A modified Newton method for polynomials