MPSolve documentation

Algorithm

The main theoretical results behind MPSolve can be found in the paper "Design, Analysis, and Implementation of a Multiprecision Polynomial Rootfinder" by D. A. Bini and G. Fiorentino to appear in Numerical Algorithms.

Install

MPSolve requires that the GMP multiprecision package has been correctly installed and that both the header file "gmp.h" and the library file "libgmp.a" can be accessed by GCC. These files can also be copied to the directory MPSolve once the GMP package has been successfully configured and compiled.

MPSolve does not include the GMP package that can be downloaded by anonymous ftp from the site ftp://ftp.gnu.org/pub/gnu/gmp-2.0.2.tar.gz
At the time of version 2.0.2, some well known bugs in GMP lead to slow and inaccurate outputs in MPSolve. These errors are fixed by applying some patches which can be downloaded directly from the GMP home page at the URL: http://www.swox.com/gmp/

In order to create the executable file (unisolve) simply type:

make

in the MPSolve directory.

Usage

MPSolve takes all of its input from the command line and the standard input, to run the program, type:

unisolve options input_file

where input_file is the name of the file holding the input polynomial (see the input format page) and options is the list of options and directives such as the goal of the computation, the requested output precision, the subset of the complex plane where the roots are sought and many others (see the options page).

If the input_file is missing then unisolve will read from the standard input stream (typically the keyboard).

The output format is ruled by some command line options and follows some conventions (see the output conventions page).

Further documentation

The file mpsolve.tex contains further information on the package and on the test suite.

Download

The latest MPSolve package can be downloaded from here.

home