A simple algorithm for arbitrary polynomial transformation

Abstract

A very simple algorithm is developed for the arbitrary rational transformation of a polynomial. The fact that many of the multiplications performed involve one zero factor is not explicitly taken into account. If desired, this could be done, with some increase in the complexity of the algorithm itself. Finally, if roundoff error is expected to be a problem, double precision arithmetic could be used.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>