Xref: utzoo comp.graphics:7615 sci.math:7948 Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!image.soe.clarkson.edu!news From: stadnism@image.soe!clutx.clarkson.edu (Steven Stadnicki,212 Reynolds,2684079,5186432664) Newsgroups: comp.graphics,sci.math Subject: Iterative square root function? Message-ID: <1989Sep25.022915.5886@sun.soe.clarkson.edu> Date: 25 Sep 89 02:29:15 GMT Sender: news@sun.soe.clarkson.edu Reply-To: stadnism@image.soe!clutx.clarkson.edu Distribution: usa Organization: Clarkson University, Potsdam, NY Lines: 13 In the Ray Tracing News, vol. 2 # 4 (I think), someone mentioned a cubically convergent method for doing Pythagorean sums and square roots. Does anyone have info on this method, and any methods for computing quick trig and inverse trig functions? It would be much appreciated. Steven Stadnicki stadnism@{clutx,sandbox}.clarkson.edu "Neil and Buzz had been prepared for monsters and disruptions in reality and space paradoxes and time paradoxes and death by evanescence. They hadn't been prepared for New Jersey."