nth root extraction: Double iteration process and Newton's method
From MaRDI portal
Publication:1298613
DOI10.1016/S0377-0427(98)00033-8zbMATH Open0935.65048MaRDI QIDQ1298613FDOQ1298613
Publication date: 22 August 1999
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accelerated Convergence in Newton’s Method
- Accelerated Convergence in Newton’s Method
- On two sequences of algorithms for approximating square roots
- High order iterative methods for approximating square roots
- Algorithms for \(n\)-th root approximation.
- Numerical Mathematics
- The calculation of cubic roots after Héron
- A Note on an Iterative Method for Root Extraction
- A Modified Babylonian Algorithm
- A Historical Survey of Solution by Functional Iteration
Cited In (8)
- Accelerated convergence in Newton's method for approximating square roots
- Title not available (Why is that?)
- High order algorithms for approximatingnth roots
- Experimentation with Newton's extension to solve nonlinear algebraic equations
- Some variants of the Chebyshev–Halley family of methods with fifth order of convergence
- Title not available (Why is that?)
- New methods for approximating square roots
- Choosing starting values for certain Newton-Raphson iterations
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)
