Dandelin, Lobacevskii, or Graeffe
From MaRDI portal
Publication:3264215
DOI10.2307/2310626zbMath0089.24202OpenAlexW4254568926MaRDI QIDQ3264215
Publication date: 1959
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2310626
Related Items (11)
Stability domains of explicit multistep methods ⋮ Extremal graphs for a spectral inequality on edge-disjoint spanning trees ⋮ Polynomials Whose Zeros Are Powers of a Given Polynomial’s Zeros ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation ⋮ Root-squaring with DPR1 matrices ⋮ Approximate Calculation of Sums II: Gaussian Type Quadrature ⋮ On the geometry of Graeffe iteration ⋮ Real polynomial root-finding by means of matrix and polynomial iterations ⋮ Accelerated approximation of the complex roots and factors of a univariate polynomial
This page was built for publication: Dandelin, Lobacevskii, or Graeffe
