A polynomial rootfinder that can determine arbitrary precision approximations with guaranteed inclusion radii. It supports exploiting of polynomial structures such as sparsisty and allows for polynomial implicitly defined or in some non standard basis.
This package contains the graphical version of MPSolve.
Unknown
Versions3.2.1-10.1+b2 (landing)
3.2.1-10.1+b2 (dawn)
3.2.1-7 (crimson)
3.2.1-2+b1 (byzantium)
CategoryUtility