home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #27 / NN_1992_27.iso / spool / sci / math / numanal / 3335 < prev    next >
Encoding:
Internet Message Format  |  1992-11-17  |  1.2 KB
  1. Path: sparky!uunet!charon.amdahl.com!pacbell.com!att-out!oucsboss!oucsace!bobcat!ravi
  2. From: ravi@bobcat.ent.ohiou.edu (Pattalachinti)
  3. Newsgroups: sci.math.num-analysis
  4. Subject: Re: polynomial root finding
  5. Message-ID: <1992Nov18.020117.14292@oucsace.cs.ohiou.edu>
  6. Date: 18 Nov 92 02:01:17 GMT
  7. References: <1992Nov5.175007.3406@news2.cis.umn.edu> <6757@dove.nist.gov>
  8. Sender: usenet@oucsace.cs.ohiou.edu (Network News Poster)
  9. Organization: College of Engg. & Tech., Ohio University, Athens, Ohio
  10. Lines: 25
  11.  
  12. In article <6757@dove.nist.gov> fred@poly2.nist.gov (Frederick R. Phelan Jr.) writes:
  13. >In article <1992Nov5.175007.3406@news2.cis.umn.edu>, jblee@giga.cs.umn.edu (Jaebum Lee) writes:
  14. >|> Hi,
  15. >|> I am looking for a subroutine to find all the roots(including complex) of
  16. >|> a polynomial with real coefficients. Does anybody out there have such a
  17. >|> subroutine? Any pointers wiil be appreciated.
  18. >|> 
  19. >|> Jaebum Lee
  20. >|> jblee@tera.cs.umn.edu
  21. >|>   
  22. >
  23. >Look for the algorithm zroots in NUMERICAL RECIPES by Press, Flannery et al.
  24. >Works very nicely.
  25.  
  26.  
  27.  
  28.  
  29. Refer to: Solving polynomial systems
  30.       using continuation
  31.       for Engineering and
  32.       Scientific problems
  33.  
  34.         by Alexander Morgan
  35.  
  36. ravi                    
  37.