A Fast Algorithm for Partial Fraction Decompositions
Abstract
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the rational function. The new algorithms use less storage space, and are suitable for parallel programming. We also discuss full partial fraction decompositions.
 Publication:

arXiv Mathematics eprints
 Pub Date:
 August 2004
 arXiv:
 arXiv:math/0408189
 Bibcode:
 2004math......8189X
 Keywords:

 Combinatorics;
 Commutative Algebra;
 11Y16
 EPrint:
 17 pages