On rediscovered iteration methods for solving equations

DOI10.1016/S0377-0427(99)00105-3zbMath0940.65046OpenAlexW2002195613MaRDI QIDQ1300719

Miodrag S. Petković, Dragoslav Herceg

Publication date: 10 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-0427(99)00105-3

zbMATH Keywords

convergenceiteration method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (20)

A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros ⋮ Dynamic study of Schröder's families of first and second kind ⋮ On Schröder's families of root-finding methods ⋮ Schröder's processes and the best ways of increasing order of Newton's method ⋮ A note on some recent methods for solving nonlinear equations ⋮ Means based modifications of Newton's method for solving nonlinear equations ⋮ New simultaneous root-finding methods with accelerated convergence for analytic functions ⋮ The link on extraneous non-repelling cycles of Schröder's methods of the first and second kind ⋮ 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 ⋮ A non-iterative method for solving non-linear equations ⋮ On a family of symmetric polynomials ⋮ Accelerating generators of iterative methods for finding multiple roots of nonlinear equations ⋮ Fixed point and Newton's methods in the complex plane ⋮ Newton's method's basins of attraction revisited ⋮ On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity ⋮ Iterative methods based on the signum function approach for solving nonlinear equations ⋮ An iteration method with maximal order based on standard information ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods ⋮ Comments on some recent methods for the simultaneous determination of polynomial zeros

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A basic family of iteration functions for polynomial root finding and its characterizations
• Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
• High order iterative methods for approximating square roots
• 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
• 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

This page was built for publication: On rediscovered iteration methods for solving equations