Re: numerical factorization of very high degree polynomial

Article View: sci.math.num-analysis

Article #786

Back to sci.math.num-analysis Previous Next

#786

From: nagrwb
Date: Tue, 06 Oct 1992 08:41

22 lines
1220 bytes

In article <9227919.6924@mulga.cs.mu.OZ.AU>, yzhu@nairana.ee.mu.oz.au (Yan ZHU (yhua)) writes:
> 
>  
>  I am trying to solve non-linear problem by LP method.
>  And I am looking for an algorithm for the numerical
>  factorization of very high degree (500th-800th) polynomials 
>  with complex coefficients.
> 
>  ...stuff deleted 

NAG Fortran Library routine C02AFF finds all the roots of a complex
polynomial equation, usinmg a variant of Laguerre's method. Any degree
can be specified.

But I think many would question the wisdom of trying to compute all the roots
of a very high degree polynomial. Anybody else out there doing anything
similar?

Richard.
-- 
** R.W. Brankin -- Numerical Algorithms Group Ltd. -- nagrwb@vax.ox.ac.uk **
**   suggestions for sig. welcome   --   will need   include<std.discl>   **

Technical Details

Message-ID: <1992Oct6.094142.9281@vax.oxford.ac.uk>

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!comlab.ox.ac.uk!oxuniv!nagrwb

References: <9227919.6924@mulga.cs.mu.OZ.AU>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!uknet!comlab.ox.ac.uk!oxuniv!nagrwb
From: nagrwb@vax.oxford.ac.uk
Newsgroups: sci.math.num-analysis
Subject: Re: numerical factorization of very high degree polynomial
Message-ID: <1992Oct6.094142.9281@vax.oxford.ac.uk>
Date: 6 Oct 92 08:41:42 GMT
References: <9227919.6924@mulga.cs.mu.OZ.AU>
Organization: Oxford University VAX 6620
Lines: 22

Reply to Parent Message