A universal constant for the convergence of Newton's method and an application to the classical homotopy method (Q1895870): 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: Q3998344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some tests of generalized bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity. On the geometry of polynomials and a theory of cost. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank

Latest revision as of 15:08, 23 May 2024

scientific article
Language Label Description Also known as
English
A universal constant for the convergence of Newton's method and an application to the classical homotopy method
scientific article

    Statements

    A universal constant for the convergence of Newton's method and an application to the classical homotopy method (English)
    0 references
    13 August 1995
    0 references
    The author describes a variant of the Kantorovich theorem on the convergence of Newton's method for systems of polynomial equations. It uses estimates of all derivatives and is claimed to assert larger balls of convergence. In this context, a ``universal'' constant independent of the degree of the polynomials and the dimension of the system is used in the estimates. The main body of the paper consists of the proof of the convergence theorem. Some numerical examples as well as the use of the theorem to determine the stepsize of a homotopy method are given at the end.
    0 references
    Kantorovich theorem
    0 references
    convergence
    0 references
    Newton's method
    0 references
    systems of polynomial equations
    0 references
    balls of convergence
    0 references
    numerical examples
    0 references
    homotopy method
    0 references

    Identifiers

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