Hensel and Newton Methods in Valuation Rings (Q3703974)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3929125
Language Label Description Also known as
default for all languages
No label defined
    English
    Hensel and Newton Methods in Valuation Rings
    scientific article; zbMATH DE number 3929125

      Statements

      1984
      0 references
      Hensel method
      0 references
      factorization of polynomials
      0 references
      Newton method
      0 references
      zeros of polynomials over
      0 references
      univariate polynomials
      0 references
      bivariate polynomials
      0 references
      Hensel and Newton Methods in Valuation Rings (English)
      0 references
      Hensel and Newton methods have received quite a lot of attention in algebraic computing. We present them in their natural framework, that of valuation rings. The Hensel method deals with factorization of polynomials, the Newton method with zeros of polynomials over the given valuation ring. Both methods take an approximate solution and produce a new approximation which is better with respect to the given valuation. The Hensel method presented in section 2 describes a lifting of an approximate factorization of a given polynomial over a valuation ring, where the factors are approximately relatively prime. It results in two choices of an iterative procedure, one with linear and one with quadratic convergence behavior. It allows us to describe the factorization of certain polynomials that are not squarefree over the residue class field, a case not covered by the usual formulation. In section 3, we present a Newton method for solving differential equations for formal power series in several variables, in the general case of systems of nonlinar partial differential equations. This includes the case of a system of algebraic equations. One obtains a simple condition which provides an iterative procedure to compute a solution. In section 4, we discuss an important recently discovered tool for factoring polynomials: computing short vectors in modules over (valuation) rings. This tool has been introduced by \textit{A. K. Lenstra}, \textit{H. W. Lenstra} jun. and \textit{L. Lovász} [Math. Cent., Amst., Afd. Inf. IW 195/82 (1982; Zbl 0477.68043)] for factoring univariate integer polynomials. We present a short vector algorithm in the cases of non-Archimedean valuations. This yields, in the final section, an algorithm for factoring univariate polynomials over a ring with sufficient valuations. Special cases of this algorithm include univariate polynomials over \({\mathbb{Q}}\) and bivariate polynomials over a finite field.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references