123 citations · 479 across the 28 of their papers we have counts for
5 papers · 1 filter
Tangent Graeffe Iteration
Gregorio Malajovich, Jorge P. Zubelli
Graeffe iteration was the choice algorithm for solving univariate polynomials in the XIX-th and early XX-th century. In this paper, a new variation of Graeffe iteration is given, s…
On the Geometry of Graeffe Iteration
Gregorio Malajovich, Jorge P. Zubelli
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous t…
Ultimate Polynomial Time
Gregorio Malajovich
The class of `ultimate polynomial time' problems over is introduced; it contains the class of polynomial time problems over . The…
Lower bounds for some decision problems over C
Gregorio Malajovich
Lower bounds for some explicit decision problems over the complex numbers are given.
Condition number bounds for problems with integer coefficients
Gregorio Malajovich
An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems…