A Fast Algorithm for Partial Fraction Decompositions

Simple item page
dc.creatorXin, Guoce
dc.date2004-08-14
dc.date.accessioned2026-07-07T05:11:17Z
dc.date.available2026-07-07T05:11:17Z
dc.descriptionWe 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.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/math/0408189
dc.identifierhttp://arxiv.org/abs/math/0408189
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72187
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subject11Y16
dc.titleA Fast Algorithm for Partial Fraction Decompositions
dc.typetext

Files

Collections

arXiv