On Schröder's families of root-finding methods

DOI10.1016/j.cam.2009.09.012zbMath1184.65052MaRDI QIDQ2654184

Miodrag S. Petković, Ljiljana D. Petković, Đorđe D. Herceg

Publication date: 15 January 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2009.09.012

zbMATH Keywords

convergence rate; nonlinear equations; root-finding methods; iteration methods

Mathematics Subject Classification ID

65H05: Numerical computation of solutions to single equations

Related Items

On a family of symmetric polynomials, Accelerating generators of iterative methods for finding multiple roots of nonlinear equations, A NOTE ON THE SEMILOCAL CONVERGENCE OF CHEBYSHEV’S METHOD, Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
• On rediscovered iteration methods for solving equations
• A basic family of iteration functions for polynomial root finding and its characterizations
• Newton's method and generation of a determinantal family of iteration functions
• Roots of equations by functional iteration
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• Accelerated Convergence in Newton’s Method
• On K nig's root-finding algorithms*
• Accelerated Convergence in Newton’s Method
• On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
• Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens