Numerical Methods at work

Disclaimer:
Permission to use, copy, and distribute this software, and It’s documentation for any non-commercial purpose is hereby granted without fee, provided: THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND, EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL Henrik Vestermark, BE LIABLE FOR ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER ADVISED OF THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

Various Scientific Software Application

The different ports of various algorithm or applications. Here is just a few that I have come across and that I believe would be of interest for this web sites visitors.

Newton's method by Madsen C++

Probably the most instructive and efficient implementation of Newton method for finding all roots of polynomials with real coefficients. This is a C++ port of Madsen algorithm from Bit 13 (1973) pp 71-75.
To download the real coefficients version click download now: Download Now!

Jenkins-Traub C++
The famous Jenkins-Traub algorithm for finding all roots of polynomials. This is a C++ version for complex coefficients. A real coefficients version can be found on www.crbond.com. To download the complex coefficients version click download now: Download Now!

Renormalized Graeffe Iteration by Malajovich
The new 'reborn' Graeffe iteration for finding roots of univariate polynomials (See Malajovich paper On The Geometry of Graeffe Iteration, together with Jorge P. Zubelli). It is distributed under GNU Public License Agreement version 2.

http://www.dma.im.ufrj.br/~gregorio/software.php
This is a C(Linux) version for complex coefficients as a standalone C program.