Xref: utzoo comp.lang.pascal:5246 comp.sys.ibm.pc.misc:5903 comp.os.msdos.programmer:2973 sci.engr:552
Path: utzoo!attcan!uunet!maverick.ksu.ksu.edu!hoss!price
From: price@helios.unl.edu (Chad Price)
Newsgroups: comp.lang.pascal,comp.sys.ibm.pc.misc,comp.os.msdos.programmer,sci.engr
Subject: Re: Numerical Methods for Poynomial Root Finding?
Message-ID: <price.663718555@helios>
Date: 12 Jan 91 22:15:55 GMT
References: <5231@trantor.harris-atd.com>
Sender: news@hoss.unl.edu (Network News Administer)
Distribution: na
Organization: University of Nebraska - Lincoln
Lines: 15

blombardi@x102c.ess.harris.com (Bob Lombardi 44139) writes:


>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.  

See page 279 of Numerical Recipes in C by Press,Flannery,Teukolsky, and
Vetterlingg (1988, Cambridge Univ Press) for explanation and source
code. There is also a Fortran version of the book.

chad price
price@fergvax.unl.edu