On Schröder's families of root-finding methods
From MaRDI portal
Publication:2654184
DOI10.1016/j.cam.2009.09.012zbMath1184.65052MaRDI QIDQ2654184
Ljiljana D. Petković, Đorđe D. Herceg, Miodrag S. Petković
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
65H05: Numerical computation of solutions to single equations
Related Items
A first overview on the real dynamics of Chebyshev's method, On the global convergence of Schröder's iterative formulae for real roots of algebraic equations, A complex dynamical approach of Chebyshev's method, New simultaneous root-finding methods with accelerated convergence for analytic functions, On a family of symmetric polynomials, Accelerating generators of iterative methods for finding multiple roots of nonlinear equations, A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros, Dynamics and limiting behavior of Julia sets of König's method for multiple roots, Polynomial and rational approximations and the link between Schröder's processes of the first and second kind, On the rediscovery of Halley's iterative method for computing the zero of an analytic function, On the global convergence of Schröder's iteration formula for real zeros of entire functions, Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots, Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary, A NOTE ON THE SEMILOCAL CONVERGENCE OF CHEBYSHEV’S METHOD, Iterative methods for simultaneous computing arbitrary number of multiple zeros of nonlinear equations, Unnamed Item
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