Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 1990 Copyright 1990 University of Bonn, Department of Computer Science, Abt. V
896

Algorithms for Sparse Rational Interpolation
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF]

We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm in a sense of sparse partial fraction representation of rational functions. The second is the algorithm for computing 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 that the degree is known. The presented algorithms complement the sparse interpolation result of \cite{12}.

Last Change: 11/05/14 at 09:37:15
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V