On Halley's Iteration Method
From MaRDI portal
Publication:3692716
DOI10.2307/2322644zbMath0574.65041OpenAlexW4239096436MaRDI QIDQ3692716
Publication date: 1985
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2322644
Related Items (71)
On the method of tangent hyperbolas in Banach spaces ⋮ A modified Chebyshev's iterative method with at least sixth order of convergence ⋮ Dynamics of a new family of iterative processes for quadratic polynomials ⋮ A basic family of iteration functions for polynomial root finding and its characterizations ⋮ An analysis of the properties of the variants of Newton's method with third order convergence ⋮ High order algorithms for approximatingnth roots ⋮ Third-order iterative methods for operators with bounded second derivative ⋮ Effective numerical methods for non-linear equations ⋮ Iterative solution of systems of nonlinear equations based upon quadratic approximations ⋮ Means based modifications of Newton's method for solving nonlinear equations ⋮ A family of newton type iterative processes ⋮ A Poisson process reparameterisation for Bayesian inference for extremes ⋮ On generalized Halley-like methods for solving nonlinear equations ⋮ A parabolic extension of Newton's method ⋮ A family of chebyshev-halley type methods ⋮ Third Order Root-Finding Methods based on a Generalization of Gander's Result ⋮ Geometric constructions of iterative functions to solve nonlinear equations ⋮ On optimal fourth-order iterative methods free from second derivative and their dynamics ⋮ On using symmetric polynomials for constructing root finding methods ⋮ A note on machine method for root extraction ⋮ A new class of Halley's method with third-order convergence for solving nonlinear equations ⋮ A note on the modified super-Halley method ⋮ Recurrence relations for rational cubic methods. I: The Halley method ⋮ A family of Chebyshev-Halley type methods in Banach spaces ⋮ Unnamed Item ⋮ A novel iterative method for polar decomposition and matrix sign function ⋮ A numerical method for computing the principal square root of a matrix ⋮ Polynomial and rational approximations and the link between Schröder's processes of the first and second kind ⋮ Dynamics of a family of Chebyshev-Halley type methods ⋮ A class of iterative methods with third-order convergence to solve nonlinear equations ⋮ Simple geometry facilitates iterative solution of a nonlinear equation via a special transformation to accelerate convergence to third order ⋮ Symbolic computation and computer graphics as tools for developing and studying new root-finding methods ⋮ Numerical properties of different root-finding algorithms obtained for approximating continuous Newton's method ⋮ Generalized Fibonacci and Lucas Sequences and Rootfinding Methods ⋮ A modification of Cauchy's method for quadratic equations ⋮ On the rediscovery of Halley's iterative method for computing the zero of an analytic function ⋮ A method for obtaining iterative formulas of order three ⋮ New iterative method for solving non-linear equations with fourth-order convergence ⋮ Simple geometric constructions of quadratically and cubically convergent iterative functions to solve nonlinear equations ⋮ A new zero-finder for Tikhonov regularization ⋮ Modification of the Kantorovich assumptions for semilocal convergence of the Chebyshev method ⋮ Solving a nonlinear equation by a uniparametric family of iterative processes ⋮ An acceleration of Newton's method: Super-Halley method ⋮ Graphic and numerical comparison between iterative methods ⋮ Accelerated convergence in Newton's method for approximating square roots ⋮ A family of methods for solving nonlinear equations ⋮ An extension of Gander's result for quadratic equations ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros ⋮ On a characterization of some Newton-like methods of \(R\)-order at least three ⋮ On method of osculating circle for solving nonlinear equations ⋮ Convergence analysis of a variant of the Newton method for solving nonlinear equations ⋮ On a new multiparametric family of Newton-like methods ⋮ Asymptotic error constants of cubically convergent zero finding methods ⋮ On a third order family of methods for solving nonlinear equations ⋮ Methods with prefixed order for approximating square roots with global and general convergence ⋮ Steffensen type methods for solving non-linear equations ⋮ New eighth and sixteenth order iterative methods to solve nonlinear equations ⋮ New algorithms for solving nonlinear eigenvalue problems ⋮ The billiard problem ⋮ Model-free stochastic collocation for an arbitrage-free implied volatility. I. ⋮ Newton-type iterative methods for finding zeros having higher multiplicity ⋮ A note on Halley's method ⋮ Recurrence relations for rational cubic methods. II: The Chebyshev method ⋮ On the semigroup property for some structured iterations ⋮ Two-point generalized Hermite interpolation: double-weight function and functional recursion methods for solving nonlinear equations ⋮ A Qualitative Analysis of a Family of Newton-Like Iterative Process with R-Order of Convergence At Least Three ⋮ A NOTE ON THE SEMILOCAL CONVERGENCE OF CHEBYSHEV’S METHOD ⋮ Historical developments in convergence analysis for Newton's and Newton-like methods ⋮ On a fourth-order matrix method for computing polar decomposition ⋮ Solving nonlinear eigenvalue problems by algorithmic differentiation ⋮ A note on the convergence of the irrational Halley’s iterative algorithm for solving nonlinear equations
This page was built for publication: On Halley's Iteration Method
