High order algorithms for approximatingnth roots

DOI10.1080/00207160410001714583zbMath1060.65050OpenAlexW1997101671MaRDI QIDQ4828667

No author found.

Publication date: 26 November 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160410001714583

zbMATH Keywords

convergencenumerical examplesNewton-type methodChebyshev's methodn-th root

Mathematics Subject Classification ID

Related Items (4)

Newton-type methods of high order and domains of semilocal and global convergence ⋮ Inverse function, Taylor's expansion and extended Schröder's processes ⋮ Dynamics of a higher-order family of iterative methods ⋮ Newton's method and high-order algorithms for the \(n\)th root computation

Cites Work

• Graphic and numerical comparison between iterative methods
• Indices of convexity and concavity. Application to Halley method
• \(n\)th root extraction: Double iteration process and Newton's method
• Calculus of \(n\)th roots and third order iterative methods.
• On Halley's Iteration Method
• Several new methods for solving equations
• A Modified Babylonian Algorithm
• Accelerated Convergence in Newton’s Method
• A family of Chebyshev-Halley type methods in Banach spaces
• Historical Development of the Newton–Raphson Method

This page was built for publication: High order algorithms for approximatingnth roots