Xref: utzoo comp.theory.dynamic-sys:191 sci.math:15798 sci.physics:17528
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!ncar!gatech!udel!rochester!uhura.cc.rochester.edu!rbr4
From: rbr4@uhura.cc.rochester.edu (Roland Roberts)
Newsgroups: comp.theory.dynamic-sys,sci.math,sci.physics
Subject: Re: square roots by hand or computer
Message-ID: <12791@ur-cc.UUCP>
Date: 15 Mar 91 21:31:10 GMT
References: <1991Mar15.063023.6605@dsd.es.com> <1991Mar15.202738.9606@jato.jpl.nasa.gov> <1991Mar15.203346.9770@jato.jpl.nasa.gov>
Organization: University of Rochester, Rochester NY
Lines: 24

In article <1991Mar15.203346.9770@jato.jpl.nasa.gov>
vsnyder@jato.Jpl.Nasa.Gov (Van Snyder) writes: 

    But the one-bit-at-a time algorithms that are similar to
    division algorithms (but a little simpler) are what are used
    inside co-processor chips: You get a square root for the cost
    of one division (approximately), instead of 3 divisions, some
    multiplications, some adds (all floating point), and some
    jerking around of the floating point representation.

    vsnyder@jato.Jpl.Nasa.Gov
    ames!elroy!jato!vsnyder
    vsnyder@jato.uucp

If anyone is interested in looking over a piece of code that does this,
I have a routine in C that I wrote to be able to take square roots of
64- and 128-bit integers.

roland

-- 
Roland Roberts,  University of Rochester   BITNET: roberts@uornsrl
  Nuclear Structure Research Lab         INTERNET: rbr4@uhura.cc.rochester.edu
  271 East River Road                        UUCP: rochester!ur-cc!rbr4
  Rochester, NY  14267                       AT&T: (716) 275-8962