Hensel and Newton Methods in Valuation Rings
- 1 April 1984
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 42 (166), 637-661
- https://doi.org/10.2307/2007608
Abstract
We give a computational description of Hensel’s method for lifting approximate factorizations of polynomials. The general setting of valuation rings provides the framework for this and the other results of the paper. We describe a Newton method for solving algebraic and differential equations. Finally, we discuss a fast algorithm for factoring polynomials via computing short vectors in modules.Keywords
This publication has 17 references indexed in Scilit:
- Factoring multivariate integral polynomialsPublished by Springer Nature ,2006
- Polynomial-time factorization of multivariate polynomials over finite fieldsPublished by Springer Nature ,1983
- An Improved Multivariate Polynomial Factoring AlgorithmMathematics of Computation, 1978
- Multivariate Polynomial FactorizationJournal of the ACM, 1975
- An Inequality About Factors of PolynomialsMathematics of Computation, 1974
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- On Hensel factorization, IJournal of Number Theory, 1969
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- Symmetric positive linear differential equationsCommunications on Pure and Applied Mathematics, 1958
- Effective procedures in field theoryPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1956