Smale's fundamental theorem of algebra reconsidered (Q404254): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10208-013-9155-y / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1204.0036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuation method to solve polynomial systems and its complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smale’s 17th problem: Average polynomial time to compute affine and projective solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear homotopy to find approximate zeros of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the finite variance of the averaging function for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem posed by Steve Smale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive step-size selection for homotopy methods to solve polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An arithmetic Poisson formula for the multi-variate resultant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. III: Condition number and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric / 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: Q3135179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501787 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10208-013-9155-Y / rank
 
Normal rank

Latest revision as of 16:35, 9 December 2024

scientific article
Language Label Description Also known as
English
Smale's fundamental theorem of algebra reconsidered
scientific article

    Statements

    Smale's fundamental theorem of algebra reconsidered (English)
    0 references
    0 references
    0 references
    4 September 2014
    0 references
    The authors discuss Smale's homotopy method for solving polynomial equations and its development in the recent years along with application of variations of the Newton method. They show that the upper bound estimate is polynomial and can be possibly extended to any dimensions of the polynomial equations. Numerical experiments illustrate the basins of attractions of the methods.
    0 references
    0 references
    polynomial equation
    0 references
    homotopy method
    0 references
    Newton method
    0 references
    Smale's fundamental theorem of algebra
    0 references
    numerical experiment
    0 references

    Identifiers