Newton's method and high-order algorithms for the \(n\)th root computation
From MaRDI portal
Publication:2519695
DOI10.1016/j.cam.2008.04.014zbMath1170.65030OpenAlexW1979665897MaRDI QIDQ2519695
Publication date: 27 January 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.04.014
Related Items (2)
Inverse function, Taylor's expansion and extended Schröder's processes ⋮ On the semigroup property for some structured iterations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two sequences of algorithms for approximating square roots
- On the order of convergence of a determinantal family of root-finding methods
- Calculus of \(n\)th roots and third order iterative methods.
- High order iterative methods for approximating square roots
- New methods for approximating square roots
- Algorithms for \(n\)-th root approximation.
- A Modified Babylonian Algorithm
- A Historical Survey of Solution by Functional Iteration
- An Iterative Method for Approximating Square Roots
- Accelerated Convergence in Newton’s Method
- High order algorithms for approximatingnth roots
- Accelerated Convergence in Newton’s Method
This page was built for publication: Newton's method and high-order algorithms for the \(n\)th root computation