On the public citation graph
On the Geometry of Graeffe Iteration
0 signed · 38 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcom.1993.1002openalex-snapshot
Complexity of Bezout′s Theorem
inferredcites →https://doi.org/10.1006/jcom.1996.0008openalex-snapshot
An Efficient Algorithm for the Complex Roots Problem
inferredcites →https://doi.org/10.1006/jcom.1996.0024openalex-snapshot
Topological Complexity of Zero-Finding
inferredcites →https://doi.org/10.1006/jcom.1996.0030openalex-snapshot
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors
inferredcites →https://doi.org/10.1006/jcom.1996.0034openalex-snapshot
On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors
inferredcites →https://doi.org/10.1006/jcom.1998.0481openalex-snapshot
Partial Fraction Decomposition in C(z) and Simultaneous Newton Iteration for Factorization in C[z]
inferredcites →https://doi.org/10.1007/bf01020332openalex-snapshot
Quantitative universality for a class of nonlinear transformations
inferredcites →https://doi.org/10.1007/bf01582052openalex-snapshot
On the cost of approximating all roots of a complex polynomial
inferredcites →https://doi.org/10.1007/bf02163334openalex-snapshot
A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration
inferredcites →https://doi.org/10.1007/bf02546329openalex-snapshot
Recherches sur la méthode de graeffe et les zéros des polynomes et des séries de laurent
inferredcites →https://doi.org/10.1007/s002110050069openalex-snapshot
Pseudozeros of polynomials and pseudospectra of companion matrices
inferredcites →https://doi.org/10.1016/0304-3975(94)00065-4openalex-snapshot
On generalized Newton algorithms: quadratic convergence, path-following and error analysis
inferredcites →https://doi.org/10.1016/0304-3975(94)90122-8openalex-snapshot
Complexity of Bezout's theorem V: polynomial time
inferredcites →https://doi.org/10.1016/0898-1221(95)00078-dopenalex-snapshot
Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
inferredcites →https://doi.org/10.1016/0898-1221(96)00080-6openalex-snapshot
Optimal and nearly optimal algorithms for approximating polynomial zeros
inferredcites →https://doi.org/10.1016/s0898-1221(96)00233-7openalex-snapshot
A fast and stable algorithm for splitting polynomials
inferredcites →https://doi.org/10.1017/s0962492900002774openalex-snapshot
Complexity theory and numerical analysis
inferredcites →https://doi.org/10.1090/s0002-9947-1995-1277095-1openalex-snapshot
Differential Identities
inferredcites →https://doi.org/10.1090/s0025-5718-1995-1262279-2openalex-snapshot
Polynomial Roots from Companion Matrix Eigenvalues
inferredcites →https://doi.org/10.1137/0733008openalex-snapshot
Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
inferredcites →https://doi.org/10.1137/0915064openalex-snapshot
Remark on Algorithms to Find Roots of Polynomials
inferredcites →https://doi.org/10.1137/s0036144595288554openalex-snapshot
Solving a Polynomial Equation: Some History and Recent Progress
inferredcites →https://doi.org/10.1145/321043.321049openalex-snapshot
Resultant Procedure and the Mechanization of the Graeffe Process
inferredcites →https://doi.org/10.1145/321186.321198openalex-snapshot
On the Reduction of Number Range in the Use of the Graeffe Process
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-41724-5_6openalex-snapshot
Root-Squaring for Root-Finding
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.12.070openalex-snapshot
New progress in real and complex polynomial root-finding
inferred← citeshttps://doi.org/10.1016/j.ifacol.2024.10.208openalex-snapshot
Towards the Computation of Stabilizing Controllers of Multidimensional Systems
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102372openalex-snapshot
Fast evaluation and root finding for polynomials with floating-point coefficients
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.006openalex-snapshot
High probability analysis of the condition number of sparse polynomial systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115022openalex-snapshot
A new fast root-finder for black box polynomials
inferred← citeshttps://doi.org/10.1063/1.4965441openalex-snapshot
Comment on “Nonlinear differential algorithm to compute all the zeros of a generic polynomial” [J. Math. Phys. 57, 083508 (2016)]
inferred← citeshttps://doi.org/10.1093/imanum/drac039openalex-snapshot
Complexity of sparse polynomial solving 2: renormalization
inferred← citeshttps://doi.org/10.1109/access.2023.3307772openalex-snapshot
A Diffusion-Map-Based Algorithm for Gradient Computation on Manifolds and Applications
inferred← citeshttps://doi.org/10.1137/140993752openalex-snapshot
Approximate Calculation of Sums II: Gaussian Type Quadrature
inferred← citeshttps://doi.org/10.1145/1837934.1837978openalex-snapshot
Real and complex polynomial root-finding with eigen-solving and preprocessing
inferred← citeshttps://doi.org/10.1145/384101.384122openalex-snapshot
A generalized Graeffe's iteration for evaluating polynomials and rational functions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.