On the geometry of Graeffe iteration
From MaRDI portal
Publication:5949383
DOI10.1006/jcom.2001.0585zbMath0994.65055arXivmath/9908149OpenAlexW3103294630MaRDI QIDQ5949383
Gregorio Malajovich, Jorge P. Zubelli
Publication date: 29 September 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9908149
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
High probability analysis of the condition number of sparse polynomial systems ⋮ Fast evaluation and root finding for polynomials with floating-point coefficients ⋮ Approximate Calculation of Sums II: Gaussian Type Quadrature ⋮ New progress in real and complex polynomial root-finding ⋮ Comment on “Nonlinear differential algorithm to compute all the zeros of a generic polynomial” [J. Math. Phys. 57, 083508 (2016)]
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast and stable algorithm for splitting polynomials
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- Complexity of Bezout's theorem. V: Polynomial time
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Quantitative universality for a class of nonlinear transformations
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Topological complexity of zero-finding
- Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors
- On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors
- Complexity of Bezout's theorem. III: Condition number and packing
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- An efficient algorithm for the complex roots problem
- Dandelin, Lobacevskii, or Graeffe
- On the cost of approximating all roots of a complex polynomial
- Resultant Procedure and the Mechanization of the Graeffe Process
- Remark on Algorithms to Find Roots of Polynomials
- Condition Number Analysis for Sparse Polynomial Systems
- Newton Iteration Towards a Cluster of Polynomial Zeros
- Solving a Polynomial Equation: Some History and Recent Progress
- On the Problem of Runs
- Complex Dynamics and Renormalization (AM-135)
- Polynomial Roots from Companion Matrix Eigenvalues
- Differential Identities
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- On the Reduction of Number Range in the Use of the Graeffe Process
This page was built for publication: On the geometry of Graeffe iteration
