Efficient partial fraction decomposition techniques in Maple

Allan Wittkopf, CECM

Many algorithms implemented in Maple use partial fraction and full partial
fraction decompositions to compute solutions. Two examples include integration
(definite and indefinite), and computation of integral transforms.
I will talk about two implementations, one for regular partial fraction
decomposition (most useful for integration), and one for full partial fraction
decomposition (most useful for integral transforms), that vastly outperform the
existing implementations.
In many cases it will be possible to perform computations in almost negligible
time that previously exhausted the resources on many machines.