Solving multivariate algebraic equation by Hensel construction (Q1301578): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Algebraic Functions Can Be Computed Fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified method for multivariate polynomial factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic continuation and Riemann surface determination of algebraic functions by computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials and absolute irreducibility testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4183410 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:26, 28 May 2024

scientific article
Language Label Description Also known as
English
Solving multivariate algebraic equation by Hensel construction
scientific article

    Statements

    Solving multivariate algebraic equation by Hensel construction (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2000
    0 references
    The paper deals with calculating the roots of multivariate polynomials with respect to one of the variables involved. The roots are computed in terms of formal power series or Puiseux series in the remaining variables. The authors use the well-known methods of Newton polygon and the generalized Hensel's construction (which they modify slightly in the case the polynomial has multiple roots). First, they apply their method to a polynomial in two variables, and then they adapt is to several indeterminates. The authors state that, when dealing with symbolic resolution and algebraic numbers, their method uses less algebraic numbers to represent a root than Newton-Puiseux's method or Kung-Traub's method [see \textit{H. T. Kung} and \textit{J. F. Traub}, J. Assoc. Comput. Mach. 25, 245-260 (1978; Zbl 0371.68019)]. They also state that, when dealing with numerical approximations, the method used in this paper is more accurate than the Newton-Puiseux's one.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algebraic computation
    0 references
    roots of multivariate polynomials
    0 references
    formal power series
    0 references
    Puiseux series
    0 references
    Newton polygon
    0 references
    Hensel's construction
    0 references
    symbolic resolution
    0 references