Newton's method in practice: finding all roots of polynomials of degree one million efficiently (Q2357369): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Eigensolve / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2279235603 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.02935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Nullstellenverteilung zufälliger Polynome / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the speed of convergence of Newton’s method for complex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving secular and polynomial equations: a multiprecision algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton’s method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated eigenvalue algorithm for approximating roots of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On location and approximation of clusters of zeros of analytic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find all roots of complex polynomials by Newton's method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of Newton maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Classification of Postcritically Finite Newton Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial classification of postcritically fixed Newton maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2002 update of the supplementary bibliography on roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for roots of polynomials. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding / 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 the number of iterations of Newton's method for complex polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal addresses of the Mandelbrot set and Galois groups of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Komplexe Dynamik, die Mandelbrot-Menge und das Newton-Verfahren oder: Von nutzloser und nützlicher Mathematik / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method in practice: finding all roots of polynomials of degree one million efficiently / 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: Q4720691 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:49, 13 July 2024

scientific article
Language Label Description Also known as
English
Newton's method in practice: finding all roots of polynomials of degree one million efficiently
scientific article

    Statements

    Newton's method in practice: finding all roots of polynomials of degree one million efficiently (English)
    0 references
    0 references
    0 references
    13 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomials
    0 references
    root finding
    0 references
    Newton's method
    0 references
    high degree
    0 references
    complex variable
    0 references
    algorithm
    0 references
    numerical stability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references