A simple algorithm for high order Newton iteration formulae and some new variants
From MaRDI portal
Publication:5159558
DOI10.15672/HUJMS.459810zbMATH Open1488.49053OpenAlexW2954194548WikidataQ127815016 ScholiaQ127815016MaRDI QIDQ5159558FDOQ5159558
Authors: Mustafa Turkyilmazoglu 
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
Recommendations
- Some variant of Newton's method with third-order convergence.
- scientific article; zbMATH DE number 6129896
- Newton's method and high-order algorithms for the \(n\)th root computation
- Some higher-order modifications of Newton's method for solving nonlinear equations
- Fixed point and Newton's methods for solving a nonlinear equation: from linear to high-order convergence
Newton-type methods (49M15) Algorithms for approximation of functions (65D15) Rate of convergence, degree of approximation (41A25)
Cites Work
- A one-parameter fourth-order family of iterative methods for nonlinear equations
- Finding the solution of nonlinear equations by a class of optimal methods
- Multipoint methods 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
- Advances in iterative methods for nonlinear equations
- Some efficient fourth order multipoint methods for solving equations
- Generation of root finding algorithms via perturbation theory and some formulas
- Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
- Some fourth-order modifications of Newton's method
- On the Convergence of Halley's Method
- Newton's method's basins of attraction revisited
- Some derivative free quadratic and cubic convergence iterative formulas for solving nonlinear equations
- Sixth-order modifications of Newton's method based on Stolarsky and Gini means
- GENERALIZATIONS OF NEWTON'S METHOD
- Efficient high-order methods based on golden ratio for nonlinear systems
- A third-order family of Newton-like iteration methods for solving nonlinear equations
- A new iteration method with cubic convergence to solve nonlinear algebraic equations
- 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
- Some higher-order modifications of Newton's method for solving nonlinear equations
- A new third-order Newton-type iterative method for solving nonlinear equations
- A geometric construction of iterative formulas of order three
- Some numerical methods for solving nonlinear equations by using decomposition technique
- A generalized Newton algorithm using higher-order derivatives
- A new family of exponential iteration methods with quadratic convergence of both diameters and points for enclosing zeros of nonlinear equations
- Title not available (Why is that?)
- On extensions of the Newton-Raphson iterative scheme to arbitrary orders
Cited In (7)
- Effective high-order iterative methods via the asymptotic form of the Taylor-Lagrange remainder
- New optimal fourth-order iterative method based on linear combination technique
- 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
- High order approach for solving chaotic and hyperchaotic problems
- Implementation issues for high-order algorithms
- On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously
- Newton's method and high-order algorithms for the \(n\)th root computation
This page was built for publication: A simple algorithm for high order Newton iteration formulae and some new variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159558)
