A double iteration process already used to find the nth root of a positive real number is analysed and showed to be equivalent to the Newton's method. These methods are of order two and three. Higher-order methods for finding the nth root are also mentioned. (~) 1998 Elsevier Science B.V. All rights
Calculus of nth roots and third order iterative methods
✍ Scribed by J.M. Gutiérrez; M.A. Hernández; M.A. Salanova
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 187 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
✦ Synopsis
We apply a family of iterative methods to the problem of extracting the (n)th root of a positive number (R), that is, to solve the nonlinear equation (t^{n}-R=0). For each value of (n) we obtain the method in the family for which the highest order of convergence is reached.
📜 SIMILAR VOLUMES
Two modifications of Newton's method to accelerate the convergence of the nth root computation of a strictly positive real number are revisited. Both modifications lead to methods with prefixed order of convergence p ∈ N, p ≥ 2. We consider affine combinations of the two modified pth-order methods w
A uniparametric family of three-step eighth-order multipoint iterative methods requiring only a first derivative are proposed in this paper to find simple roots of nonlinear equations. Development and convergence analysis on the proposed methods is described along with numerical experiments includin
Algebraic and differential equations generally co-build mathematical models. Either lack or intractability of their analytical solution often forces workers to resort to an iterative method and face the likely challenges of slow convergence, non-convergence or even divergence. This manuscript presen