On exact and approximate interpolation of sparse rational functions

  • Authors:

  • Erich Kaltofen;Zhengfeng Yang

  • Affiliations:

  • North Carolina State University, Raleigh, North Carolina;North Carolina State University, Raleigh, North Carolina

  • Venue:
  • Proceedings of the 2007 international symposium on Symbolic and algebraic computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation algorithms to interpolate a sparse rational function. domization and early termination strategies are exploited to minimize the number of black box evaluations. In addition, rational number coefficients are recovered from modular images by rational vector recovery. The need for separate numerator and denominator size bounds is avoided via correction, and the modulus is minimized by use of lattice basis reduction, a process that can be applied to sparse rational function vector recovery itself. Finally, one can deploy sparse rational function interpolation algorithm in the hybrid symbolic-numeric setting when the black box for the function returns real and complex values with noise. We present and analyze five new algorithms for the above problems and demonstrate their effectiveness on a mark implementation.