Xref: utzoo comp.lang.pascal:5126 comp.sys.ibm.pc.misc:5456 comp.os.msdos.programmer:2796 sci.engr:509
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!wuarchive!rex!uflorida!mlb.semi.harris.com!trantor.harris-atd.com!x102c.ess.harris.com!blombardi
From: blombardi@x102c.ess.harris.com (Bob Lombardi 44139)
Newsgroups: comp.lang.pascal,comp.sys.ibm.pc.misc,comp.os.msdos.programmer,sci.engr
Subject: Numerical Methods for Poynomial Root Finding?
Message-ID: <5231@trantor.harris-atd.com>
Date: 12 Jan 91 02:18:59 GMT
Sender: news@trantor.harris-atd.com
Reply-To: blombardi@x102c.ess.harris.com (Bob Lombardi 44139)
Distribution: na
Organization: Harris Corporation GSS, Melbourne, Florida
Lines: 36



Greetings,

Now that I've decided to buy Borland's Turbo Pascal Numerical Methods
Toolbox, I find that they have discontinued the product.  (I have noticed
this phenomenon before, and it indeed is a law of nature, derived from 
electro-weak theory.) :):)

Does anyone have it that would like to sell it?

If not, can anyone point me to a reference that explains the Laguerre
algorithm that they use, so that I can write my own?  The Laguerre 
algorithm finds all roots of polynomials from entered coefficients.  
I have what I thought was a good collection of post-calculus math books,
but none have anything by this name.  

Lacking that (I get three strikes, don't I?) can anyone refer me to 
source code in Pascal, BASIC, or FORTRAN that finds the roots of 
polynomials?  I can usually translate the other two languages into TP
if I get code in them. 

Since I've posted this to several groups, I'd appreciate reply by email
to save net bandwidth. 



Thanks,
Bob



Bob Lombardi WB4EHS     >>>>>>> Internet: blombardi@x102c.ess.harris.com
M/S 102-4826, Harris Corp GASD, P.O. Box 94000, Melbourne, FL 32902   
Hobbies:  ********  on hold thanks to being a gradual student in EE ******
aspiring classical pianist.   Professional: electrical engineer, writer.