How to increase convergence order of the Newton method to 2 m?
From MaRDI portal
(Redirected from Publication:742896)
How to increase convergence order of the Newton method to \(2\times m\)?
How to increase convergence order of the Newton method to \(2\times m\)?
Abstract: We present a simple yet powerful technique for forming iterative methods of various convergence orders. Methods of various convergence orders (four, six, eight and ten) are formed through a modest modification of the classical Newton method. The technique can be easily implemented in existing software packages as suggested by the presented C algorithm. Finally some problems are solved through the proposed algorithm.
Recommendations
- How to improve the domain of parameters for Newton's method
- A simple modification of Newton's method to achieve convergence of order \(1+\sqrt 2\)
- A modification of Newton method with convergence of order \(2 + \sqrt{6}\)
- The convergency order of some methods generalized from Newton method
- Optimization of the convergence order for a modification of Newton's method
- Enlarging the radius of convergence for Newton's method
- scientific article; zbMATH DE number 1525354
- scientific article; zbMATH DE number 59979
- Newton type iterative methods with higher order of convergence
- On a two-point Newton-like method of convergent order two
Cites work
- scientific article; zbMATH DE number 5991610 (Why is no real title available?)
- scientific article; zbMATH DE number 3875911 (Why is no real title available?)
- scientific article; zbMATH DE number 3740677 (Why is no real title available?)
- scientific article; zbMATH DE number 5198140 (Why is no real title available?)
- scientific article; zbMATH DE number 3187178 (Why is no real title available?)
- A Family of Fourth Order Methods for Nonlinear Equations
- A composite fourth-order iterative method for solving nonlinear equations
- A family of modified Ostrowski methods with accelerated sixth order convergence
- A geometric construction of iterative functions of order three to solve nonlinear equations
- A modification of Newton method with third-order convergence
- A one-parameter fourth-order family of iterative methods for nonlinear equations
- A variant of Newton's method with accelerated third-order convergence
- Computational pitfalls of high-order methods for nonlinear equations
- Constructing third-order derivative-free iterative methods
- Construction of Newton-like iteration methods for solving nonlinear equations
- Derivative free algorithm for solving nonlinear equations
- Fourth-order derivative-free methods for solving non-linear equations
- Fourth-order iterative methods free from second derivative
- New variants of Jarratt's method with sixth-order convergence
- On Newton-type methods with cubic convergence
- Optimal eighth order iterative methods
- Sixth order derivative free family of iterative methods
- Some fourth-order iterative methods for solving nonlinear equations
- Some fourth-order modifications of Newton's method
- Some new variants of Newton's method.
- Some sixth-order variants of Ostrowski root-finding methods
- Some variant of Newton's method with third-order convergence.
- The Jarratt method in Banach space setting
- Two new classes of optimal Jarratt-type fourth-order methods
- Two optimal families of iterative methods for solving nonlinear equations
- Unifying fourth-order family of iterative methods
This page was built for publication: How to increase convergence order of the Newton method to \(2\times m\)?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742896)
