Roots of polynomials

[GORDON KEEGAN]

In article <4529 at idunno.Princeton.EDU>, subbarao at phoenix.Princeton.EDU (Kartik Subbarao) writes...
>In article <1990Dec5.175558.29859 at dg-rtp.dg.com> hagins at gamecock.rtp.dg.com (Jody Hagins) writes:
>>In article <2173 at mentor.cc.purdue.edu>, k3u at mentor.cc.purdue.edu (Barry Smith) writes:
>>|> Does anyone have the source code to routines that can extract
>>|> the complex roots of polynomials?  If there is a book that has
>>|> the source code that would be fine too.
>>
>>Yeh, I wrote one when I was in school too.
>>I didn't have any problems with it, and as I remember, even
>>the "slower" students seemed to provide a workable solution.
>>So, keep working (or should I say start working), and I'm
>>sure you'll be able to write one soon enough.
>>

	Finding roots for a quadratic was easy enough.  However,
	if you could give me pointers to finding roots to higher
	degree polynomials, I'd be interested in hearing from you.
	(no, this is not a lab assignment... :)

> 
>Anyway -- what does everyone else think about this? I've seen both sorts of
>attitudes on the subject. What do you guys think comp.lang.c should do?
> 

	I won't reply to what is (IMHO) a request for answers to
	homework.  I can't affect what others will do.  'Nuff said.

-----------------------------------------------------------------------------
|  Gordon Keegan                    ||   Bitnet  : c145gmk at utarlg           |
|  Systems Programmer               ||   THEnet  : UTARLG::C145GMK          |
|  Academic Computing Services      ||   Internet: c145gmk at utarlg.utarl.edu |
|  University of Texas, Arlington   ||   AT&TNet : 817-273-2208             |
-----------------------------------------------------------------------------
|  Beauty does what beauty does best: it's beautiful...                     |
-----------------------------------------------------------------------------