Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems (Q1319864): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user 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: Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to method for the simultaneous computation of all zeros of generalized polynomials / 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: Numerical Solution of a Class of Deficient Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Method for Simultaneously Finding Polynomial Roots / rank
 
Normal rank

Latest revision as of 14:41, 22 May 2024

scientific article
Language Label Description Also known as
English
Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
scientific article

    Statements

    Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems (English)
    0 references
    0 references
    15 January 1995
    0 references
    The author constructs Newton-like iteration methods for the real solutions of systems of algebraic equations. The methods considered are related to and generalize the methods of Durand and Kerner for the calculation of all real roots of univariate polynomials via, e.g., the symmetric equations for the roots of a polynomial. Analogous resolvent systems are formulated and the iteration maps for such systems are simplified Newton maps. Local quadratic convergence results are given. Several numerical examples are also given. It would be of interest to compare the performance of the present method with the recently developed homotopy continuation methods for this class of problems.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    local quadratic convergence
    0 references
    Durand-Kerner method
    0 references
    Newton-like iteration methods
    0 references
    systems of algebraic equations
    0 references
    numerical examples
    0 references
    performance
    0 references