Article View: sci.math.num-analysis
Article #850Re: polynomial root finding
From: Pattalachinti
Date: Wed, 18 Nov 1992 02:01
Date: Wed, 18 Nov 1992 02:01
25 lines
1232 bytes
1232 bytes
In article <6757@dove.nist.gov> fred@poly2.nist.gov (Frederick R. Phelan Jr.) writes: >In article <1992Nov5.175007.3406@news2.cis.umn.edu>, jblee@giga.cs.umn.edu (Jaebum Lee) writes: >|> Hi, >|> I am looking for a subroutine to find all the roots(including complex) of >|> a polynomial with real coefficients. Does anybody out there have such a >|> subroutine? Any pointers wiil be appreciated. >|> >|> Jaebum Lee >|> jblee@tera.cs.umn.edu >|> > >Look for the algorithm zroots in NUMERICAL RECIPES by Press, Flannery et al. >Works very nicely. Refer to: Solving polynomial systems using continuation for Engineering and Scientific problems by Alexander Morgan ravi
Technical Details
Message-ID:
<1992Nov18.020117.14292@oucsace.cs.ohiou.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!att-out!oucsboss!oucsace!bobcat!raviReferences:
<1992Nov5.175007.3406@news2.cis.umn.edu> <6757@dove.nist.gov>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!att-out!oucsboss!oucsace!bobcat!ravi From: ravi@bobcat.ent.ohiou.edu (Pattalachinti) Newsgroups: sci.math.num-analysis Subject: Re: polynomial root finding Message-ID: <1992Nov18.020117.14292@oucsace.cs.ohiou.edu> Date: 18 Nov 92 02:01:17 GMT References: <1992Nov5.175007.3406@news2.cis.umn.edu> <6757@dove.nist.gov> Sender: usenet@oucsace.cs.ohiou.edu (Network News Poster) Organization: College of Engg. & Tech., Ohio University, Athens, Ohio Lines: 25