Hensel construction with an arbitrary degree of convergence (Q1922224): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1364972 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Adrian Swift / rank | |||
Normal rank |
Revision as of 16:18, 27 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hensel construction with an arbitrary degree of convergence |
scientific article |
Statements
Hensel construction with an arbitrary degree of convergence (English)
0 references
25 March 1997
0 references
The Hensel construction [cf. \textit{K. Hensel}, Zahlentheorie, Göschen, Berlin (1913; JFM 44.0203.15)] is an important technique in computer algebra, playing a central role in topics related to polynomial factorization. In this paper, the author presents a Hensel construction over the field of complex numbers which can be implemented with an arbitrarily high degree of convergence. The paper commences by describing two types of Hensel construction, the first of which uses Newton's method and the second the parallel Hensel construction. The first construction is extended, in the process deriving a Hensel construction which has an arbitrarily high degree of convergence. A numerical example shows the construction with degree of convergence four.
0 references
polynomial zeros
0 references
Hensel construction
0 references
computer algebra
0 references
polynomial factorization
0 references
convergence
0 references
Newton's method
0 references
numerical example
0 references