Mathematics – Combinatorics
Scientific paper
2004-08-14
Mathematics
Combinatorics
17 pages
Scientific paper
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the rational function. The new algorithms use less storage space, and are suitable for parallel programming. We also discuss full partial fraction decompositions.
No associations
LandOfFree
A Fast Algorithm for Partial Fraction Decompositions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Fast Algorithm for Partial Fraction Decompositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Algorithm for Partial Fraction Decompositions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696908