Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
type: Item
instance of: scholarly article
title: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
zbMATH Open document ID: 1041.65043
published in: Journal of Complexity
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 26C15
Mathematics Subject Classification ID: 30C15
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 1444125
zbMATH Keywords: complex polynomial zeros
zbMATH Keywords: algorithms
zbMATH Keywords: computational complexity
author: Victor Y. Pan
describes a project that uses: CPOLY
MaRDI profile type: Publication
OpenAlex ID: W2076304423
cites work: Evaluating Polynomials at Fixed Sets of Points
cites work: Q4177796
cites work: Multiplication is the easiest nontrivial arithmetic function
cites work: Q5779155
cites work: A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
cites work: Q5572275
cites work: Simple algorithms for approximating all roots of a polynomial with real roots
cites work: Q4314299
cites work: Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
cites work: Q3279563
cites work: Q5563347
cites work: A Numerical Method for Locating the Zeros of an Analytic Function
cites work: Generalizations of Laguerre’s Method: Higher Order Methods
cites work: Circular arithmetic and the determination of polynomial zeros
cites work: Q5689624
cites work: Remark on Algorithms to Find Roots of Polynomials
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial
cites work: Q3996584
cites work: Q5653524
cites work: A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm
cites work: Q4072022
cites work: Some modifications of Laguerre's method
cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
cites work: Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
cites work: Polynomial Root-Finding Algorithms and Branched Covers
cites work: A Machine Method for Solving Polynomial Equations
cites work: A root-finding algorithm based on Newton's method
cites work: Q5797046
cites work: A bibliography on roots of polynomials
cites work: Sequential and parallel complexity of approximate evaluation of polynomial zeros
cites work: Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
cites work: Complexity of Computations with Matrices and Polynomials
cites work: Q3128885
cites work: Q4234125
cites work: Weyl's quadtree algorithm for the unsymmetric eigenvalue problem
cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors
cites work: Bisection acceleration for the symmetric tridiagonal eigenvalue problem
cites work: Q3694703
cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials
cites work: Unified complexity analysis for Newton LP methods
cites work: Über das Newtonsche Verfahren
cites work: A quadtree algorithm for template matching on a pyramid computer
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: Q3135179
cites work: Complexity of Bezout's theorem. III: Condition number and packing
cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
cites work: Complexity of Bezout's theorem. V: Polynomial time
cites work: Q3333131
cites work: The DQR algorithm, basic theory, convergence, and conditional stability
DOI: 10.1006/JCOM.1999.0532
description: scientific article; zbMATH DE number 1444125