Re: All Roots to any Polynomial

From: Proginoskes (proginoskes_at_email.msn.com)
Date: 08/03/04 

Date: 3 Aug 2004 00:23:59 -0700

RMoebs1@compuserve.de (Peter Pan) wrote in message news:<3cc72195.0408021117.1c65bf67@posting.google.com>...
> Jon <jon8338@peoplepc.com> wrote in message news:<410E45F8.3090004@peoplepc.com>...
> > In this development all roots to any degree polynomial are found to any
> > desired degree of precision.
> >
> > http://www.geocities.com/jongiff2000/a7_polynomial_roots_bingo.html
> >
> > Jon Giffen
>
> WARNING !!! WARNING !!! WARNING !!! WARNING !!!
>
> Folks, this is plain nonsense. He can't even find roots for a simple
> polynomial of fifth degree: t^5 + t^2 + 1 = 0.

Forget polynomials of the fifth degree, his method couldn't even find roots
of a cubic which factors. (He gave one as HIS OWN EXAMPLE of his method
at work. I would have thought he'd post a polynomial where his method
worked.)
     Checking the link, I see he's changed a few things. He doesn't explain
why you can't choose s = 1 and s = 2 as well. (Probably just because they
don't give valid answers, I bet. And he's doing his old "rounding off"
trick again, claiming it gives exact answers.)
     -- Christopher Heckman

Relevant Pages

  • Re: Maxima - precision
    ... You are computing the roots of a polynomial in machine precision. ... But maybe your polynomials are not nasty. ...
    (sci.math.symbolic)
  • Re: Maxima - precision
    ... I'm computing complex roots of polynomial: ... How can I set precision? ... Changing fpprec seems to have no effect. ... But maybe your polynomials are not nasty. ...
    (sci.math.symbolic)
  • Re: Maxima - precision
    ... You are computing the roots of a polynomial in machine precision. ... But maybe your polynomials are not nasty. ...
    (sci.math.symbolic)
  • Re: Public Key, Symbolic Calculation
    ... >> precision or you will have a lot of messages you can't decrypt. ... The roots won't always be nice numbers. ... This scheme isn't well thought out because it involves rather ... inefficient storage or generation of polynomials... ...
    (sci.crypt)
  • Re: JSH: Keep it simple
    ... arbitrary rule that you take roots of monic polynomials with integer coefficients. ... integral root is divisible by something that is coprime to ... Your claim regarding rational roots of this polynomial cannot do that, since the standard theory makes no claims regarding common factors among such roots. ...
    (sci.math)