The general recurrence relation for arbitrary rational transformation of polynomials
Shervin Erfani, Majid Ahmadi, V. Ramachandran · IEEE Transactions on Circuits and Systems · 1989
A recurrence relation is developed that allows the coefficients of a transformed polynomial under common rational function transformations to be readily computed from the original coefficients. The recursive algorithm is quite general and prescribes a simple scheme for machine implementation as well as manual calculation.>