A Fast Algorithm for Partial Fraction Decompositions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, Commutative Algebra, 11Y16

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/72187

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0408189
 http://arxiv.org/abs/math/0408189

Collections

arXiv