On the geometry of Graeffe iteration

Journal of Complexity

Volumn 17, Issue 3, 2001, Pages 541-573

  Malajovich, Gregorio ^a   Zubelli, Jorge P ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b IMPA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARITHMETIC; ARTICLE; CONTROLLED STUDY; GEOMETRY; MATHEMATICAL COMPUTING; PROBABILITY;

EID: 0035174511     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2001.0585     Document Type: Article

References (54)

1. Resultant procedure and the mechanization of the Graeffe process
2. The numerical solution of polynomial equations and the resultant procedures
3. Differential identities
4. Graeffe's Chebyshev-like and Cardinal's processes for splitting a polynomial into factors
5. On the geometry of factorization algorithms
6. On two iterative methods for approximating the roots of a polynomial
7. A propos de la méthode de Graeffe
8. Approximate solutions of numerical problems, condition number analysis and condition number theorem
9. Condition number analysis for sparse polynomial systems
10. Polynomial roots from companion matrix eigenvalues
11. Numerical univariate polynomial GCD
12. Quantitative university for a class of nonlinear transformations
13. Remark on algorithms to find roots of polynomials
14. On the reduction of number range in the use of the Graeffe process
15. Dandelin, Lobatchevskii, or Graeffe?
16. A three-stage variable shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
17. n and simultaneous Newton iteration for factorization in C[z]
18. Newton iteration towards a cluster of polynomial zeros
19. Random polynomials and the statistical fundamental theorem of algebra
20. On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
21. A fast and stable algorithm for splitting polynomials
22. Solving special polynomial systems by using structured matrices and algebraic residues
23. An efficient algorithm for the complex roots problem
24. Topological complexity of zero-finding
25. Recherches sur la Méthode de Graeffe et les Zéros de Polynomes et des Séries de Laurent
26. Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
27. Optimal and nearly optimal algorithms for approximating polynomial zeros
28. Solving a polynomial equation: Some history and recent progress
29. On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors
30. Sur la méthode de Graeffe
31. On the cost of approximating all roots of a complex polynomial
32. On the complexity of Bezout's theorem. I. Geometric aspects
33. On the complexity of Bezout's theorem. II. Volumes and probabilities
34. On the complexity of Bezout's theorem. III. Condition number and packing
35. Complexity of Bezout's theorem. IV. Probability of success; extensions
36. Complexity of Bezout's theorem. V. Polynomial time
37. Complexity theory and numerical analysis
38. Equation solving in terms of computational complexity
39. Pseudozeros of polynomials and pseudospectra of companion matrices
40. Topological complexity of root-finding algorithms