Fast Algorithms for Partial Fraction Decomposition.
Abstract
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) squared) operations in the worst case. Previous algorithms require O x N cubed operations, and O(n (log n) squared) operations for the special case where the factors appearing in the denominator are all linear.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1976
- Accession Number
- ADA022807
Entities
People
- D. M. Tong
- H. T. Kung
Organizations
- Carnegie Mellon University