Publication Details
Title: Algorithms for Sparse Rational Interpolation
Author: D. Grigoriev and M. Karpinski
Group: ICSI Technical Reports
Date: January 1991
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1991/tr-91-011.pdf
Overview:
We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm in a sense of the sparse partial fraction representation of rational functions. The second is the algorithm for computing the entier and the remainder of a rational function. The first algorithm works without apriori known bound on the degree of a rational function, the second one is in the class NC provided the degree is known. The presented algorithms complement the sparse interpolation results of [Grigoriev, Karpinski, and Singer (1990)].
Author: D. Grigoriev and M. Karpinski
Group: ICSI Technical Reports
Date: January 1991
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1991/tr-91-011.pdf
Overview:
We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm in a sense of the sparse partial fraction representation of rational functions. The second is the algorithm for computing the entier and the remainder of a rational function. The first algorithm works without apriori known bound on the degree of a rational function, the second one is in the class NC provided the degree is known. The presented algorithms complement the sparse interpolation results of [Grigoriev, Karpinski, and Singer (1990)].
Keywords: Algorithms, NC-Class, Sparse Rational Interpolation, Fraction Representation.
Bibliographic Information:
ICSI Technical Report TR-91-011
Bibliographic Reference:
D. Grigoriev and M. Karpinski. Algorithms for Sparse Rational Interpolation. ICSI Technical Report TR-91-011, January 1991