Mpsolve

Jul 20, 2023

Multiprecision rootfinder for complex roots of univariate polynomials

MPSolve stands for Multiprecision Polynomial SOLVEr. It is a software that aims to provide an easy to use hopefully universal blackbox for solving polynomials and secular equations.

Among its features you can find

  • Arbitrary precision approximation.
  • Guaranteed inclusion radii for the results.
  • Exploiting of polynomial structures it can take advantage of sparsity as well as coefficients in a particular domain i.e. integers or rationals.
  • It can be specialized for specific classes of polynomials. As an example, see the roots of the Mandelbrot polynomial of degree 2.097.151 computed in about 10 days on a dual Xeon server.


Checkout these related ports:
  • Zn_poly - C library for polynomial arithmetic
  • Zimpl - Language to translate the LP models into .lp or .mps
  • Zegrapher - Software for plotting mathematical objects
  • Zarray - Dynamically typed N-D expression system based on xtensor
  • Z3 - Z3 Theorem Prover
  • Yices - SMT solver
  • Yacas - Yet Another Computer Algebra System
  • Xtensor - Multi-dimensional arrays with broadcasting and lazy computing
  • Xtensor-python - Python bindings for xtensor
  • Xtensor-io - Xtensor plugin to read/write images, audio files, numpy npz and HDF5
  • Xtensor-blas - BLAS extension to xtensor
  • Xspread - Spreadsheet program for X and terminals
  • Xppaut - Graphical tool for solving differential equations, etc
  • Xplot - X11 plotting package
  • Xlife++ - XLiFE++ eXtended Library of Finite Elements in C++