MPSolve
From Wikipedia, the free encyclopedia
| This article is orphaned as few or no other articles link to it. Please help introduce links in articles on related topics. (November 2007) |
| This article may require cleanup to meet Wikipedia's quality standards. Please improve this article if you can. (November 2007) |
| MPSolve | |
|---|---|
| Design by | Dario Bini and Giuseppe Fiorentino |
| Latest release | Version 2.2 / May 2001 |
| Written in | C console program |
| OS | linux |
| Platform | PC |
| Available in | english |
| Genre | mathemathical software |
| License | custom free licence |
| Website | home page |
MPSolve (Multiprecision Polynomial Solver) is a package for the approximation of the roots of a univariate polynomial. It uses the Aberth method[1].
"Mpsolve takes advantage of sparsity, and has special hooks for polynomials that can be evaluated efficiently by straight-line programs"[2]
Contents |
[edit] Implementation
The program is written in ANSI C and makes use of the GNU Multi-Precision Library.
It uses command line interface (CLI).
[edit] Usage
The executable program of the package is called unisolve (univariate polynomial solver). It can be run from command line in console.
[edit] Output
Typically output will be on the screen.
It may also be saved the to the text file (with res extension) and plotted in gnuplot.
This image shows centers of hyperbolic components of mandelbrot set for period 10 ( and its divisors). There are also drawn boundaries of period 1 and 2 hyperbolic components.
It is made with gnuplot. Centers are computed with MPSolve.
[edit] External links
[edit] References
- ^ "Design, Analysis, and Implementation of a Multiprecision Polynomial Rootfinder" by D. A. Bini and G. Fiorentino published in Numerical Algorithms, Volume 23 (2000), pages 127-173
- ^ Comparison of performance of MPSolve and Eigensolve by Steven Fortune


