Modular Algorithm for Sparse Multivariate Polynomial Interpolation and its Parallel Implementation

@article{Murao1996ModularAF,
  title={Modular Algorithm for Sparse Multivariate Polynomial Interpolation and its Parallel Implementation},
  author={Hirokazu Murao and Tetsuro Fujise},
  journal={J. Symb. Comput.},
  year={1996},
  volume={21},
  pages={377-396}
}
A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is designed to be a practical method to construct symbolic formulas from numeric data produced by vector or massively-parallel processors. The main idea in our algorithm comes from the wellknown technique for primality test based on Fermat’s theorem, and is the application of the generalized Chinese remainder theorem to the monomial exponents. We… CONTINUE READING
8 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Fast Algorithms for Digital Signal Processing

  • R. E. Blahut
  • 1985
Highly Influential
3 Excerpts

Vectorization of symbolic determinant calculation

  • H. Takahasi, Y. Ishibashi
  • Supercomputer
  • 1991

Vectorization of symbolic determinant calculation. Supercomputer, VIII(3):36–48

  • H. Murao
  • 1991
1 Excerpt

Interpolating polynomials from their values

  • France
  • J. Symbolic Computation,
  • 1990

Similar Papers

Loading similar papers…