Article View: sci.math.num-analysis
Article #697Re: polynomial root finding
From: Frederick R. Phelan Jr.
Date: Fri, 06 Nov 1992 20:18
Date: Fri, 06 Nov 1992 20:18
23 lines
1111 bytes
1111 bytes
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. Fred --- Fred Phelan fred@poly2.nist.gov /*___________________________________________________ ____ __ ___ __ ___ ___ ___ /__ /_/ /__ / / /__/ /__/ /__ / /__/ /\ / / / ( /__ /_/ / / / /___ /___ / / / \/ ___________________________________________________*/
Technical Details
Message-ID:
<6757@dove.nist.gov>Path:
arc1-ca.pugleaf.net!sparky!uunet!dove!poly2.nist.gov!fredReferences:
<1992Nov5.175007.3406@news2.cis.umn.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!dove!poly2.nist.gov!fred From: fred@poly2.nist.gov (Frederick R. Phelan Jr.) Newsgroups: sci.math.num-analysis Subject: Re: polynomial root finding Message-ID: <6757@dove.nist.gov> Date: 6 Nov 92 20:18:53 GMT References: <1992Nov5.175007.3406@news2.cis.umn.edu> Sender: news@dove.nist.gov Lines: 23