Root-Squaring for Root-Finding

Cites work

A history of mathematics. With a foreword by Isaac Asimov
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
Acceleration of subdivision root-finding for sparse polynomials
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
Complexity Analysis of Root Clustering for a Complex Polynomial
Computing one billion roots using the tangent Graeffe method
Dandelin, Lobacevskii, or Graeffe
Design, analysis, and implementation of a multiprecision polynomial rootfinder
Deterministic root finding over finite fields using Graeffe transforms
Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
Generalization of Vieta's formulae to the fractional polynomials, and generalizations of the method of Graeffe-Lobachevsky
scientific article; zbMATH DE number 3489473 (Why is no real title available?)
scientific article; zbMATH DE number 1263253 (Why is no real title available?)
Implementation of a near-optimal complex root clustering algorithm
New progress in univariate polynomial root finding
Numerical methods for roots of polynomials. II
Old and new nearly optimal polynomial root-finders
On the geometry of Graeffe iteration
On the Reduction of Number Range in the Use of the Graeffe Process
On the worst-case arithmetic complexity of approximating zeros of polynomials
Optimal and nearly optimal algorithms for approximating polynomial zeros
Solving a Polynomial Equation: Some History and Recent Progress
Solving secular and polynomial equations: a multiprecision algorithm
Tangent Graeffe iteration
Univariate polynomials, nearly optimal algorithms for factorization and rootfinding

This page was built for publication: Root-Squaring for Root-Finding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496598)