A family of one-point iteration formulae for finding roots
From MaRDI portal
Publication:3857667
DOI10.1080/00207168008803193zbMath0423.65028OpenAlexW2083442831MaRDI QIDQ3857667
Publication date: 1980
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168008803193
Newton's formulaapproximation to the root an equationHalley's, Chebyshev's and Cauchy's formulaeone-point iteration formulae
Related Items
Semilocal convergence of Modified Chebyshev-Halley method for nonlinear operators in case of unbounded third derivative ⋮ Improved Chebyshev-Halley methods with sixth and eighth order convergence ⋮ Comparative study of methods of various orders for finding repeated roots of nonlinear equations ⋮ A basic family of iteration functions for polynomial root finding and its characterizations ⋮ Some modification of Newton's method by the method of undetermined coefficients ⋮ Newton-type methods of high order and domains of semilocal and global convergence ⋮ Basin attractors for various methods ⋮ Basin attractors for various methods for multiple roots ⋮ Sixth order methods for solving equations ⋮ On a family of Halley-like methods to find simple roots of nonlinear equations ⋮ Several new methods for solving equations ⋮ Computer visualization and dynamic study of new families of root-solvers ⋮ A new family of optimal eighth order methods with dynamics for nonlinear equations ⋮ New third order nonlinear solvers for multiple roots ⋮ On Popovski's method for nonlinear equations ⋮ New iterative method for solving non-linear equations with fourth-order convergence ⋮ Comparing the geometry of the basins of attraction, the speed and the efficiency of several numerical methods ⋮ COMPARATIVE STUDY OF METHODS OF VARIOUS ORDERS FOR FINDING SIMPLE ROOTS OF NONLINEAR EQUATIONS
Cites Work
