Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation

Journal of Symbolic Computation

Volumn 21, Issue 4-6, 1996, Pages 377-396

  Murao, Hirokazu ^a   Fujise, Tetsuro ^b,c  

^a UNIVERSITY OF TOKYO   (Japan)

^b Mita Kokusai Bldg   (Japan)

^c MITSUBISHI RESEARCH INSTITUTE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030119339     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0020     Document Type: Article

References (21)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. Ben-Or, M., Tiwari, P. (1988). A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceedings of 20th Symposium on the Theory of Computing, pp. 301-309, Chicago, Illinois, May 2-4.
3. Berlekamp, E.R. (1970). Factoring polynomials over large finite fields. Mathematics of Computation, 24(111):713-735.
4. Blahut, R.E. (1985). Fast Algorithms for Digital Signal Processing. Addison-Wesley.
5. Brent, R.P., Gustavson, F.G., Yun, D.Y.Y. (1980). Fast solution of Toeplitz systems of equations and computation of Padé approximants. J. Algorithms, 1:259-295.
6. Cantor, D.G., Zassenhaus, H. (1981). A new algorithm for factoring polynomials over finite fields. Mathematics of Computation, 36:587-592.
7. Chikayama, T., Fujise, T., Sekita, D. (1994). A portable and efficient implementation of KL1. In Programming Language Implementation and Logic Programming, Proc. 6th PLILP '94, number 844 in LNCS, pp. 25-39. Springer-Verlag.
8. Grigoriev, D.Yu., Karpinski, M. (1987). The matching problem for bipartite graphs with polynomially bounded permanents is in NC. In Proc. 28th IEEE Symposium on the Foundations of Computer Science, pp. 166-172.
9. Kaltofen, F., Lakshman, Y.N. (1988). Improved sparse multivariate polynomial interpolation algorithms. In Gianni, P., (ed), Symbolic and Algebraic Computation, ISSAC '88, number 358 in LNCS, pp. 467-474, Rome, Italy, July 4-8. Springer-Verlag.
10. Kaltofen, E., Lakshman, Y.N., Wiley, J-M. (1990). Modular rational sparse multivariate polynomial interpolation. In Watanabe and Nagata (1990) pp. 135-139.
11. Knuth, D.E. (1981). Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 2nd edition.
12. Loos, R. (1983). Computing rational zeros of integral polynomials by p-adic expansion. SIAM J. Computing, 12:286-293.
13. Murao, H. (1991). Vectorization of symbolic determinant calculation. Supercomputer, VIII(3):36-48.
14. Takahasi, H., Ishibashi, Y. (1960). A new method for the "exact calculation" by a digital computer. Information Processing in Japan, 1(2):78-86. (in Japanese).
15. van der Waerden, B.L. (1940). Moderne Algebra,, volume II. Springer Verlag, 2nd edition.
16. Villard, G. (1989). Exact parallel solution of linear systems, pp. 197-205. Computational Mathematics and Applications. Academic Press.
17. Wang, P.S. (1990). Parallel univariate polynomial factorization on shared-memory multiprocessors. In Watanabe and Nagata (1990) pp. 145-151.
18. Wang, P.S. (1992). Parallel univariate p-adic lifting on shared-memory multiprocessors. In Wang, P.S., (ed), Proc. ISSAC '92, pp. 168-176, Berkeley, CA, July 27-29.
19. Watanabe, S., Nagata, M., (eds). (1990). Proc. ISSAC '90, Tokyo, Japan, August 20-24.
20. Zippel, R.E. (1979). Probabilistic algorithms for sparse polynomials. In Ng, E.W., (ed), Symbolic and Algebraic Computation, Proceedings of EUROSAM '79, number 72 in LNCS, pp. 216-226, Marseille, France, April 5-7. Springer-Verlag.
21. Zippel, R. (1990). Interpolating polynomials from their values. J. Symbolic Computation, 9(3):375-403.