home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #26 / NN_1992_26.iso / spool / sci / math / numanal / 3251 < prev    next >
Encoding:
Internet Message Format  |  1992-11-08  |  1.1 KB
  1. Path: sparky!uunet!dove!poly2.nist.gov!fred
  2. From: fred@poly2.nist.gov (Frederick R. Phelan Jr.)
  3. Newsgroups: sci.math.num-analysis
  4. Subject: Re: polynomial root finding
  5. Message-ID: <6757@dove.nist.gov>
  6. Date: 6 Nov 92 20:18:53 GMT
  7. References: <1992Nov5.175007.3406@news2.cis.umn.edu>
  8. Sender: news@dove.nist.gov
  9. Lines: 23
  10.  
  11. In article <1992Nov5.175007.3406@news2.cis.umn.edu>, jblee@giga.cs.umn.edu (Jaebum Lee) writes:
  12. |> Hi,
  13. |> I am looking for a subroutine to find all the roots(including complex) of
  14. |> a polynomial with real coefficients. Does anybody out there have such a
  15. |> subroutine? Any pointers wiil be appreciated.
  16. |> 
  17. |> Jaebum Lee
  18. |> jblee@tera.cs.umn.edu
  19. |>   
  20.  
  21. Look for the algorithm zroots in NUMERICAL RECIPES by Press, Flannery et al.
  22. Works very nicely.
  23.  
  24.  
  25. Fred
  26. ---
  27. Fred Phelan
  28. fred@poly2.nist.gov
  29. /*___________________________________________________
  30.    ____ __  ___  __    ___       ___        ___ 
  31.   /__  /_/ /__  / /   /__/ /__/ /__   /    /__/ /\  /  
  32.  /    / ( /__  /_/   /    /  / /___  /___ /  / /  \/
  33. ___________________________________________________*/
  34.