This is the implementation of an algorithm described in a paper by Rob Corless, Erik Postma and David Stoutemyer, entitled ?Rounding coefficients and artificially underflowing terms in non-numeric expressions and ?currently submitted for publication.

The algorithm takes a uni- or multivariate polynomial p(z), typically with approximate coefficients, and returns a polynomial q(z) such that |p(z) - q(z)|/|p(z)| is very small for all complex z, yet q may have fewer digits in its coefficients than p and even fewer terms overall. This makes the polynomial easier to deal with and to gain insight into for humans, while not affecting the polynomial as a complex function.