Hensel and Newton methods in valuation rings
Joachim von zur Gathen · Mathematics of Computation · 1984
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.