JJL101@psuvm.psu.edu (J.J. Lehett) (02/06/90)
Well, to save a bunch of time, space, etc....
First of all, the artical posted concerning how the HP 'actually' does
its root finding was very interesting, and if anyone has the algorithm itself
handy, I would appreciate seeing a copy! Thanks!
Secondly, I have uploaded 4 progs to gmu's archive - 3 deal with root
finding - (Secant method, Steffensen's method, and the Newton-Raphson method),
and a small prog that will return the sphere - packing or Hamming bound used
in coding theory.....if anyone doesn't have access to gmu and wants these,
just drop me a line - I'll get back to you.
********************************************************************
* J.J. * JJL101@psuvm.bitnet *
* * Penn State Center for Academic Computing *
* John Lehett * Computational Mathematics *
********************************************************************