Accession Number:

ADA022807

Title:

Fast Algorithms for Partial Fraction Decomposition.

Descriptive Note:

Interim rept.,

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1976-01-01

Pagination or Media Count:

27.0

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 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.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE