A tight bound for approximating the square root

DOI10.1016/S0020-0190(97)00126-9zbMATH Open1336.68095OpenAlexW2025228722MaRDI QIDQ287183FDOQ287183

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

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

Mathematics Subject Classification ID

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

Cites Work

• On the computational power of pushdown automata
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Fast exponentiation using the truncation operation
• Berechnung und Programm. I
• Lower Bounds for Computations with the Floor Operation
• The Computational Complexity of Continued Fractions
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Tighter bounds of errors of numerical roots
• Title not available (Why is that?)
• A proof of GMP square root
• On solving univariate sparse polynomials in logarithmic time

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)