A tight bound for approximating the square root

DOI10.1016/S0020-0190(97)00126-9MaRDI QIDQ287183zbMATH OpenOpenAlexFDO

Authors Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00126-9

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Square roots with many good approximants
• On Rational Function Approximations to Square Roots
• New methods for approximating square roots
• On two sequences of algorithms for approximating square roots
• An Iterative Method for Approximating Square Roots
• scientific article; zbMATH DE number 3945240

Cites work

• scientific article; zbMATH DE number 3637287 (Why is no real title available?)
• Berechnung und Programm. I
• Fast exponentiation using the truncation operation
• Lower Bounds for Computations with the Floor Operation
• On the computational power of pushdown automata
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• The Computational Complexity of Continued Fractions

Cited in

(5)

• A proof of GMP square root
• Tighter bounds of errors of numerical roots
• On solving univariate sparse polynomials in logarithmic time
• scientific article; zbMATH DE number 3945240 (Why is no real title available?)
• scientific article; zbMATH DE number 4117838 (Why is no real title available?)

This page was built for publication: A tight bound for approximating the square root

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287183)