home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!usc!cs.utexas.edu!torn!watserv2.uwaterloo.ca!watmath!undergrad.math.waterloo.edu!zeno26.math.UWaterloo.ca!kekamins
- From: kekamins@zeno26.math.UWaterloo.ca (kekaminsky)
- Subject: Re: Square root
- Message-ID: <By1A7t.3o@undergrad.math.waterloo.edu>
- Summary: Analytical method for computing
- Sender: kekamins@descartes.uwaterloo
- Organization: University of Waterloo
- References: <n9146070.722056383@waldorf>
- Date: Fri, 20 Nov 1992 21:26:17 GMT
- Lines: 28
-
- In article <n9146070.722056383@waldorf> n9146070@waldorf.cc.wwu.edu (Jacob C Kesinger) writes:
- >There was a previous post about ways to find the square root of a number...
- >
- >Here's my contribution:
- >
- >Find the Taylor series about a (I used a=1, for simplicity)
- >
- >(x-1)^.5=1+ (x-1)/2- (x-1)^2/4 +3(x-1)^3/8 -......
- >
- >This is nasty, messy, ugly, and very likely wrong. However, it IS
- >a method (*grin*)
- >
- >Jake Kesinger
- >n9146070@henson.cc.wwu.edu
-
- This Taylor series is incredibly inefficient (I tried using it once
- in a numerical analysis program in BASIC because I wanted double precision
- and the version of BASIC I was using had only single precison accuracy on
- its square root fct.) so I sought out a better method.
-
- And yes there is an excellent algorithm for computing the square root that works
- similarily to long division. For square roots you take say 2.0000000 .... and taking
- two digits at a time, you perform a process like long division, which I can't remember
- right now. For cube roots you take 3 digits at a time, and so on. The method is
- elaborated upon in CRC Book of Mathematical Functions. It is a method that is
- not taught in schools anymore.
-
- Kirk
-