From: "Alan Miller" Subject: Re: Jenkins-Traub root finding Date: Sat, 25 Mar 2000 05:20:54 GMT Newsgroups: sci.math.num-analysis Summary: [missing] The code is available from netlib (toms directory) or from my web site: http://users.bigpond.net.au/amiller/ -- Alan Miller, Retired Scientist (Statistician) CSIRO Mathematical & Information Sciences Alan.Miller -at- vic.cmis.csiro.au http://www.ozemail.com.au/~milleraj Dido Sevilla wrote in message <38DC4279.2742AB8B@pacific.net.ph>... > >Can anyone point me to *online* sources for the Jenkins-Traub >algorithm? I've looked in our library and our copies of SIAM J. Num. >Al. don't go that far back. I've written some code for Laguerre's >method but I have heard that JT is much more robust, despite Press et. >al.'s recommendations... Clean code in C++ or Fortran would be good. >Thanks in advance. > >-- >------------------------------------------------------------------------ >| Rafael R. Sevilla dido@pacific.net.ph | >| Instrumentation, Robotics, and Control Laboratory | >| College of Engineering, University of the Philippines, Diliman | >------------------------------------------------------------------------ ============================================================================== From: "Dann Corbit" Subject: Re: Jenkins-Traub root finding Date: Fri, 24 Mar 2000 21:40:13 -0800 Newsgroups: sci.math.num-analysis "Alan Miller" wrote in message news:W0YC4.3202$V56.11560@news-server.bigpond.net.au... > The code is available from netlib (toms directory) > or from my web site: > http://users.bigpond.net.au/amiller/ I've had a look at both of them, and I would *highly* recommend the version from his site. It looks like Mr. Miller has done a wonderful job cleaning up the ACM algorithm code. -- C-FAQ: http://www.eskimo.com/~scs/C-faq/top.html "The C-FAQ Book" ISBN 0-201-84519-9 C.A.P. Newsgroup http://www.dejanews.com/~c_a_p C.A.P. FAQ: ftp://38.168.214.175/pub/Chess%20Analysis%20Project%20FAQ.htm ============================================================================== From: "Dann Corbit" Subject: Re: Jenkins-Traub root finding Date: Fri, 24 Mar 2000 21:36:20 -0800 Newsgroups: sci.math.num-analysis Get the Jenkins-Traub program CPOLY, available from ACM TOMS via Netlib See also: http://www.elsevier.nl/homepage/sac/cam/mcnamee/09.htm IMSL is a commercial alternative. -- C-FAQ: http://www.eskimo.com/~scs/C-faq/top.html "The C-FAQ Book" ISBN 0-201-84519-9 C.A.P. Newsgroup http://www.dejanews.com/~c_a_p C.A.P. FAQ: ftp://38.168.214.175/pub/Chess%20Analysis%20Project%20FAQ.htm "Dido Sevilla" wrote in message news:38DC4279.2742AB8B@pacific.net.ph... > > Can anyone point me to *online* sources for the Jenkins-Traub > algorithm? I've looked in our library and our copies of SIAM J. Num. > Al. don't go that far back. I've written some code for Laguerre's > method but I have heard that JT is much more robust, despite Press et. > al.'s recommendations... Clean code in C++ or Fortran would be good. > Thanks in advance. > > -- > ------------------------------------------------------------------------ > | Rafael R. Sevilla dido@pacific.net.ph | > | Instrumentation, Robotics, and Control Laboratory | > | College of Engineering, University of the Philippines, Diliman | > ------------------------------------------------------------------------