home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.arch
- Path: sparky!uunet!ornl!rsg1.er.usgs.gov!darwin.sura.net!convex!bcm!rice!cliffc
- From: cliffc@rice.edu (Cliff Click)
- Subject: Re: integer distance or sqrt
- In-Reply-To: bbs.dennis@tsoft.sf-bay.org's message of Sun, 15 Nov 1992 03:13:27 GMT
- Message-ID: <CLIFFC.92Nov15184340@miranda.rice.edu>
- Sender: news@rice.edu (News)
- Organization: Center for Research on Parallel Computations
- References: <55F0TB1w165w@tsoft.sf-bay.org>
- Date: Mon, 16 Nov 1992 00:43:40 GMT
- Lines: 21
-
- bbs.dennis@tsoft.sf-bay.org (Dennis Yelle) writes:
- > because of the interest in Herman Rubin's optimization problems
- > some people here might be interested in this.
- > It is a real problem. That is, I have a program that spends quite a
- > lot of time here, and I would like to change this if I could.
-
- > I first considered asking for a integer sqrt, but maybe if the context is
- > known a better answer can be given. This program is normally run on a
- > machine with no floating point hardware so I would like to get rid of
- > floats entirely.
-
- I sent him an integer square root code using Newton's Method. I've done
- this problem before and I'm sure there are better methods out there. Does
- somebody want to post/email something better than Newton's?
-
- Thanx,
- Cliff
-
- --
- Through a gentle rain / the moon throws silver shadows /
- and tears fall like pearls. Cliff Click (cliffc@cs.rice.edu)
-