nth root extraction: Double iteration process and Newton's method

DOI10.1016/S0377-0427(98)00033-8zbMATH Open0935.65048MaRDI QIDQ1298613FDOQ1298613

Authors F. 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) Elementary functions (26A09) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 2053005
• Newton's method and high-order algorithms for the \(n\)th root computation
• Resolution on positive terms and Newton's method for equations of higher order
• scientific article; zbMATH DE number 3913555
• Remarks on Heron's cubic root iteration formula

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• A Historical Survey of Solution by Functional Iteration
• A Modified Babylonian Algorithm
• A Note on an Iterative Method for Root Extraction
• Accelerated Convergence in Newton’s Method
• Accelerated Convergence in Newton’s Method
• Algorithms for \(n\)-th root approximation.
• High order iterative methods for approximating square roots
• Numerical Mathematics
• On two sequences of algorithms for approximating square roots
• The calculation of cubic roots after Héron

Cited in

(12)

• Remarks on Heron's cubic root iteration formula
• Accelerated convergence in Newton's method for approximating square roots
• Choosing starting values for certain Newton-Raphson iterations
• scientific article; zbMATH DE number 2077526 (Why is no real title available?)
• Some variants of the Chebyshev-Halley family of methods with fifth order of convergence
• Matrix methods for finding \(\root n \of {m^u}\)
• An non-effective existence proof that helps to construct an effective algorithm to find \(n\)-th roots
• High order algorithms for approximatingnth roots
• A further investigation of using Theon's ladder to find roots of quadratic equations
• A note on machine method for root extraction
• New methods for approximating square roots
• Experimentation with Newton's extension to solve nonlinear algebraic equations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298613)