Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076304423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Polynomials at Fixed Sets of Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplication is the easiest nontrivial arithmetic function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5779155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple algorithms for approximating all roots of a polynomial with real roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Numerical Method for Locating the Zeros of an Analytic Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Laguerre’s Method: Higher Order Methods / 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: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remark on Algorithms to Find Roots of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some modifications of Laguerre's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration / 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: 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: Polynomial Root-Finding Algorithms and Branched Covers / 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: A root-finding algorithm based on Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5797046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliography on roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and parallel complexity of approximate evaluation of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Computations with Matrices and Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weyl's quadtree algorithm for the unsymmetric eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros / 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 isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisection acceleration for the symmetric tridiagonal eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / 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: Unified complexity analysis for Newton LP methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das Newtonsche Verfahren / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadtree algorithm for template matching on a pyramid computer / 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. III: Condition number and packing / 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: Complexity of Bezout's theorem. V: Polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DQR algorithm, basic theory, convergence, and conditional stability / rank
 
Normal rank

Latest revision as of 15:59, 29 May 2024

scientific article
Language Label Description Also known as
English
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
scientific article

    Statements

    Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (English)
    0 references
    2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complex polynomial zeros
    0 references
    algorithms
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references