Calculating the square root with arbitrary order of convergence

DOI10.1080/00207160008804985zbMath0961.65043OpenAlexW2136220046WikidataQ126244838 ScholiaQ126244838MaRDI QIDQ4518240

Mohammad Kaykobad, Rezaul Alam Chowdhury

Publication date: 20 November 2000

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

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

zbMATH Keywords

convergenceiterative algorithmerror boundspolynomialsdivisionsquare rootsBelaga parameters

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Elementary functions (26A09)

Cites Work

• Unnamed Item
• Unnamed Item
• An acceleration technique for the Newton solution of quadratic equations
• Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication

This page was built for publication: Calculating the square root with arbitrary order of convergence