fastest way of calculating the roots of a polynomium??

Thank you to you all :o)

Emile wrote:

(snip)

> I have had a course on computerarithmetics, there we used iterative 
> methods to gradually come closer to the root(s) up to some arbitrary 
> small error (by using the output of one iteration as input for the next, 
> and stop when 2 successive iterations differ very little (other stopping 
> conditions may be better but its usable), the fastest algorithm we've 
> seen was the Newton-Raphson method (maybe not the fastest that exists). 

For a simple root, that is fine.  For a multiple root the derivative 
goes to zero at the root, which is inconvenient for Newton's method.

-- glen

I should've gone. Cool stuff, venerable men.

--Randy

On Wed, 23 Nov 2005 20:43:09 +0000 (UTC), molnar@rtp.ericsson.se (Karl
Molnar) wrote:

>In article <1132777446.921670.252430@o13g2000cwo.googlegroups.com>,
> "Randy Yates" <yates@ieee.org> writes:
>>Karl,
>>
>>I'm sorry I missed him. Was it a good meeting?
>>
>>--Randy
>>
>
>Randy,
>
>It was interesting - he spoke about the history and application of the cepstrum.
>As an added bonus, we also met Jim Kaiser.
>
>Karl

Hi,

   meeting Schafer and Kaiser must have been like 
a baseball fan meeting Ted Williams & Mickey Mantle.

Neat.

[-Rick-]