A simple algorithm for high order Newton iteration formulae and some new variants
From MaRDI portal
Publication:5159558
DOI10.15672/hujms.459810zbMath1488.49053OpenAlexW2954194548WikidataQ127815016 ScholiaQ127815016MaRDI QIDQ5159558
Publication date: 28 October 2021
Published in: Hacettepe Journal of Mathematics and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15672/hujms.459810
Newton-type methods (49M15) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)
Related Items (4)
New optimal fourth-order iterative method based on linear combination technique ⋮ High order approach for solving chaotic and hyperchaotic problems ⋮ On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously ⋮ Numerical modelling of study the effect of the entrainment velocity, the number of Nusselt and the thickness of the non-convective zone on the stability of the pond solar
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in iterative methods for nonlinear equations
- Sixth-order modifications of Newton's method based on Stolarsky and Gini means
- Finding the solution of nonlinear equations by a class of optimal methods
- The application of Newton's method in vector form for solving nonlinear scalar equations where the classical Newton method fails
- Low-complexity root-finding iteration functions with no derivatives of any order of convergence
- Efficient high-order methods based on golden ratio for nonlinear systems
- Newton's method's basins of attraction revisited
- Generation of root finding algorithms via perturbation theory and some formulas
- Some numerical methods for solving nonlinear equations by using decomposition technique
- Some higher-order modifications of Newton's method for solving nonlinear equations
- Some derivative free quadratic and cubic convergence iterative formulas for solving nonlinear equations
- A geometric construction of iterative formulas of order three
- A new family of exponential iteration methods with quadratic convergence of both diameters and points for enclosing zeros of nonlinear equations
- A generalized Newton algorithm using higher-order derivatives
- Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
- A new third-order Newton-type iterative method for solving nonlinear equations
- A simple modification of Newton's method to achieve convergence of order \(1+\sqrt 2\)
- The improvements of modified Newton's method
- A one-parameter fourth-order family of iterative methods for nonlinear equations
- Some fourth-order modifications of Newton's method
- A new iteration method with cubic convergence to solve nonlinear algebraic equations
- On the Convergence of Halley's Method
- GENERALIZATIONS OF NEWTON'S METHOD
- Some efficient fourth order multipoint methods for solving equations
This page was built for publication: A simple algorithm for high order Newton iteration formulae and some new variants
