Modular polynomial arithmetic in partial fraction decomposition
S. Kamal Abdali, Bob F. Caviness, A. Pridor · NASA Technical Reports Server (NASA) · 1977
Algorithms for general partial fraction decomposition are obtained by using modular polynomial arithmetic. An algorithm is presented to compute inverses modulo a power of a polynomial in terms of inverses modulo that polynomial. This algorithm is used to make an improvement in the Kung-Tong partial fraction decomposition algorithm.