Abstract
A new algorithm is introduced which computes the multivariate leading coefficients of polynomial factors from their univariate images. This algorithm is incorporated into a sparse Hensel lifting scheme and only requires the factorization of a single univariate image. The algorithm also provides the content of the input polynomial in the main variable as a by-product. We show how we can take advantage of this property when computing the GCD of multivariate polynomials by sparse Hensel lifting.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bareiss, E.H.: Sylvester's identity and multistep integers preserving Gaussian elimination. Math. Comp. 22, 565–578 (1965).
Brown, W.S.: On Euclid's algorithm and the computation of polynomial greatest common divisors. J. ACM 18, 478–504 (1971).
Buchberger, B., Loos, R.: Algebraic Simplification. Computing, Supplement 4, 11–43 (1982).
Czapor, S.R., Geddes, K.O.: A comparison of algorithms for the symbolic computation of Padé approximants. Proc. EUROSAM 1984, Springer Lec. Notes Comp. Sci. 174, 248–259.
Epstein, H.I.: Using basis computation to determine pseudo-multiplicative independence. Proc. 1976 ACM Symp. Symbolic Algebraic Comp., 229–237.
von zur Gathen, J.: Irreducibility of multivariate polynomials. J. Comp. System Sci., to appear.
von zur Gathen, J.: Factoring sparse multivariate polynomials. Proc. 24th IEEE Symp. Foundations Comp. Sci., 172–179 (1983).
Kaltofen, E.: Effective Hilbert Irreducibility. Proc. EUROSAM 1984, Springer Lec. Notes Comp. Sci. 174, 277–284.
Kaltofen, E.: On a theorem by R. Dedekind. Manuscript 1984.
Kaltofen, E.: Computing with polynomials given by straight-line programs I; Greatest Common Divisors. Proc. 17th ACM Symp. Theory Comp., to appear (1985).
Kaltofen, E.: Computing with polynomials given by straight-line programs II; Factorization. In preparation.
Moses, J., Yun, D.Y.Y.: The EZ-GCD algorithm. Proc 1973 ACM National Conf., 159–166.
Schwarz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701–717 (1980).
Viry, G.: Factorisation des polynomes a plusieurs variables. R.A.I.R.O. Informatique Théoretique 17, 209–223 (1980).
Wang, P.S.: An improved multivariate polynomial factorization algorithm. Math. Comp. 32, 1215–1231 (1978).
Wang, P.S.: The EEZ-GCD algorithm. SIGSAM Bulletin 14-2, 50–60 (May 1980).
Wang, P.S.: Early detection of true factors in univariate polynomial factorization. Proc. EUROCAL 1983, Springer Lec. Notes Comp. Sci. 162, 225–235.
Yun, D.Y.Y.: The Hensel lemma in algebraic manipulation. Ph.D. dissertation, MIT 1974. Reprint: Garland Publ. Co., New York 1980.
Zippel, R.E.: Newton's iteration and the sparse Hensel algorithm. Proc. 1981 ACM Symp. Symbolic Algebraic Comp., 68–72.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaltofen, E. (1985). Sparse hensel lifting. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_230
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_230
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive