Algorithms for \(n\)-th root approximation.

DOI10.1007/BF02252255zbMath1044.65508OpenAlexW1548844130MaRDI QIDQ2564995

François Dubeau

Publication date: 1996

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02252255

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (6)

New methods for approximating square roots ⋮ Inverse function, Taylor's expansion and extended Schröder's processes ⋮ Accelerated convergence in Newton's method for approximating square roots ⋮ Methods with prefixed order for approximating square roots with global and general convergence ⋮ Newton's method and high-order algorithms for the \(n\)th root computation ⋮ \(n\)th root extraction: Double iteration process and Newton's method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two sequences of algorithms for approximating square roots
• An Iterative Method for Approximating Square Roots
• Accelerated Convergence in Newton’s Method

This page was built for publication: Algorithms for \(n\)-th root approximation.