On the global convergence of Halley's iteration formula
From MaRDI portal
Publication:1220355
DOI10.1007/BF01400962zbMath0313.65037OpenAlexW2041886034MaRDI QIDQ1220355
Publication date: 1975
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132333
General theory of numerical analysis in abstract spaces (65J05) Numerical computation of solutions to single equations (65H05)
Related Items
A basic family of iteration functions for polynomial root finding and its characterizations, Iterative solution of systems of nonlinear equations based upon quadratic approximations, A class of root finding methods, Comments on the Basto-Semiao-Calheiros root finding method, A family of third-order methods to solve nonlinear equations by quadratic curves approximation, On generalized Halley-like methods for solving nonlinear equations, Sulla convergenza del metodo delle approssimazioni successive in \(R^ 1\)., Recurrence relations for rational cubic methods. I: The Halley method, On the iterative process \(x_{n+1}=f(x_ n,x_{n-1})\), Several new methods for solving equations, An iterative method of global convergence without derivatives in the class of smooth functions, On the global convergence of Schröder's iteration formula for real zeros of entire functions, Solving systems of nonlinear equations when the nonlinearity is expensive, A family of one-point iteration formulae for finding roots, A family of root finding methods, On the global convergence of Schröder's iterative formulae for real roots of algebraic equations, Una variazione del metodo di Halley, A note on Halley's method, An algorithm for the computation of zeros of a special class of entire functions, Rectified approximations for the solution of nonlinear equations, Computer tools for the construction and analysis of some efficient root-finding simultaneous methods, Generalized newton multi-step iterative methods GMNp,m for solving system of nonlinear equations
Cites Work
