论文信息 - A p-adic division with remainder algorithm

A p-adic division with remainder algorithm

A new algorithm for division with remainder of univariate and multivariate polynomials over the integers is reported. This division algorithm relies on a p-adic construction which is closely related to the Hensel-type constructions used for polynomial factorization and greatest common divisor computations. It furnishes a new and systematic way of looking at the classical problem of division (with or without remainder). Due to the sparseness-preserving property of p-adic constructions, it appears useful as an alternative division algorithm in suitable cases when the polynomials are sparse. Detailed discussion and a more complete computing time analysis will be deferred until a later time as the work progresses further. An hope, in the meantime, is to attract comments and criticism on the algorithm and its significance.

David Y. Y. Yun

[1] Richard J. Fateman. On the Computation of Powers of Sparse Polynomials , 1974 .

[2] George E. Collins. Polynomial Remainder Sequences and Determinants , 1966 .

[3] David Y. Y. Yun,et al. The Hensel Lemma in Algebraic Manipulation , 1973, Outstanding Dissertations in the Computer Sciences.

[4] David Y. Y. Yun,et al. The EZ GCD algorithm , 1973, ACM Annual Conference.

[5] Ellis Horowitz. On the substitution of polynomial forms , 1973, ACM Annual Conference.

[6] D. Musser. Algorithms for polynomial factorization. , 1971 .

[7] Paul S. Wang,et al. Factoring multivariate polynomials over the integers , 1973, SIGS.

[8] W. S. Brown. On Euclid's algorithm and the computation of polynomial greatest common divisors , 1971, SYMSAC '71.

[9] Stephen C. Johnson,et al. Sparse polynomial arithmetic , 1974, SIGS.

[10] W. S. Brown,et al. On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors , 1971, JACM.

[11] David Y. Y. Yun,et al. Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms , 1974, SIGS.

[12] E CollinsGeorge. Subresultants and Reduced Polynomial Remainder Sequences , 1967 .

[13] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[14] H. Zassenhaus. On Hensel factorization, I , 1969 .

[15] George E. Collins,et al. Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.