Improved sparse multivariate polynomial interpolation algorithms

  • Erich Kaltofen
  • Lakshman Yagati
Part of the Lecture Notes in Computer Science book series (LNCS, volume 358)


We consider the problem of interpolating sparse multivariate polynomials from their values. We discuss two algorithms for sparse interpolation, one due to Ben-Or and Tiwari (1988) and the other due to Zippel (1988). We present efficient algorithms for finding the rank of certain special Toeplitz systems arising in the Ben-Or and Tiwari algorithm and for solving transposed Vandermonde systems of equations, the use of which greatly improves the time complexities of the two interpolation algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Algorithms; Addison and Wesley, Reading, MA, 1974.Google Scholar
  2. Ben-Or, M. and Tiwari, P., “A deterministic algorithm for sparse multivariate polynomial interpolation,” 20th Annual ACM Symp. Theory Comp., pp. 301–309 (1988).Google Scholar
  3. Blahut, R. E., Theory and Practice of Error Control Codes; Addison-Wesley, Reading, MA, 1983.Google Scholar
  4. Brent, R. P., Gustavson, F. G., and Yun, D. Y. Y., “Fast solution of Toeplitz systems of equations and computation of Padé approximants,” J. Algorithms1, pp. 259–295 (1980).Google Scholar
  5. Brown, W. S. and Traub, J. F., “On Euclid's algorithm and the theory of subresultants,” J. ACM18, pp. 505–514 (1971).Google Scholar
  6. Canny, J., Kaltofen, E., and Lakshman, Yagati, “Solving systems of non-linear polynomial equations faster,” Manuscript, 1988.Google Scholar
  7. Cantor, D. G. and Kaltofen, E., “Fast multiplication of polynomials with coefficients from an arbitrary ring,” Manuscript, March 1987.Google Scholar
  8. Grigoryev, D. Yu. and Karpinski, M., “The matching problem for bipartite graphs with polynomially bounded permanents is in NC,” Proc. 28th IEEE Symp. Foundations Comp. Sci., pp. 166–172 (1987).Google Scholar
  9. Kaltofen, E. and Trager, B., “Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators,” Proc. 29th Annual Symp. Foundations of Comp. Sci., (1988 (to appear)).Google Scholar
  10. Loos, R., “Computing rational zeros of integral polynomials by p-adic expansion,” SIAM J.Comp.12, pp. 286–293 (1983).Google Scholar
  11. Schönhage, A. and Strassen, V., “Schnelle Multiplikation grosser Zahlen,” Computing7, pp. 281–292 (1971). (In German).Google Scholar
  12. Zippel, R. E., “Probabilistic algorithms for sparse polynomials,” Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci.72, pp. 216–226 (1979).Google Scholar
  13. Zippel, R. E., “Interpolating polynomials from their values,” Manuscript, Symbolics Inc., January 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Erich Kaltofen
    • 1
  • Lakshman Yagati
    • 1
  1. 1.Department of Computer ScienceRensselaer Polytechnic InstituteTroy

Personalised recommendations