Fast Algorithms for Partial Fraction Decomposition.
CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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 On log n squared operations in the worst case. Previous algorithms require O x N cubed operations, and On log n squared operations for the special case where the factors appearing in the denominator are all linear.
- Theoretical Mathematics