The partial fraction decomposition of a proper rational function whose denominator has degree n and is given in general factored form can be done in O(n log²n) operations in the worst case. Previous algorithms require O(n³) operations, and O(n log²n) operations for the special case where the factors appearing in the denominator are all linear.
No takes yet. Share an insight, caveat, or question.
Kung et al. (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: