Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987189994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement of a convergence condition for Durand-Kerner iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of powers of complex numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular arithmetic and the determination of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Algorithms for Solvingf(x)=0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Der Fundamentalsatz der Algebra und der Intuitionismus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergänzung zu einer Arbeit von Hellmuth Kneser über den Fundamentalsatz der Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine Method for Solving Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the discriminant of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of rational maps and iterative root-finding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the complex roots problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / 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: On the worst-case arithmetic complexity of approximating zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of S. Smale about Newton's method for analytic mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II / 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
Property / cites work
 
Property / cites work: On the efficiency of algorithms of analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial root finding by means of continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Smale's “Algorithms for solving equations” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953977 / rank
 
Normal rank

Latest revision as of 09:37, 6 July 2024

scientific article; zbMATH DE number 6160454
Language Label Description Also known as
English
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
scientific article; zbMATH DE number 6160454

    Statements

    Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (English)
    0 references
    0 references
    3 May 2013
    0 references
    subdivision schemes
    0 references
    global methods
    0 references
    factorization approach
    0 references
    constructive proofs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers