\(n\)th root extraction: Double iteration process and Newton's method

DOI10.1016/S0377-0427(98)00033-8zbMath0935.65048MaRDI QIDQ1298613

François Dubeau

Publication date: 22 August 1999

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergenceNewton's method\(n\)th rootdouble iteration process

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Elementary functions (26A09)

Related Items (5)

New methods for approximating square roots ⋮ High order algorithms for approximatingnth roots ⋮ Unnamed Item ⋮ Some variants of the Chebyshev–Halley family of methods with fifth order of convergence ⋮ Accelerated convergence in Newton's method for approximating square roots

Cites Work

• Unnamed Item
• Unnamed Item
• On two sequences of algorithms for approximating square roots
• High order iterative methods for approximating square roots
• The calculation of cubic roots after Héron
• Algorithms for \(n\)-th root approximation.
• Numerical Mathematics
• A Note on an Iterative Method for Root Extraction
• A Modified Babylonian Algorithm
• A Historical Survey of Solution by Functional Iteration
• Accelerated Convergence in Newton’s Method
• Accelerated Convergence in Newton’s Method

This page was built for publication: \(n\)th root extraction: Double iteration process and Newton's method