2004/08/14 by Guoce Xin, Xin, Guoce
Computer Science · Mathematics · #11Y16 #Coding theory and cryptography #Combinatorics (math.CO) #Commutative Algebra (math.AC) #Cryptography and Residue Arithmetic #FOS: Mathematics #Polynomial and algebraic computation #math.AC #math.CO #msc:11Y16
paper · pdf · doi:10.48550/arxiv.math/0408189
17 pages
arxiv created 2004/08/14 · openalex publication_date 2004/08/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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(M2) 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.