Graeffe's method

Known as: Gräffe's method, Dandelin-Gräffe method, Graeffe method

In mathematics, Graeffe's method or Dandelin–Graeffe method is an algorithm for finding all of the roots of a polynomial. It was developed…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2014

In this paper, we combine Graeffe matrices with the classical numerical method of Dandelin-Graeffe to estimate bounds for the…

2013

Regge trajectories can be simply derived from the conservation of angular momentum in hyperbolic space. The condition to be…

2010

Two problems concerning polynomials are considered. For the first problem it is proved that the zeroes of the fractional…

1989

The symmetric level-index,sli, system for representing numbers eases the monitoring of precision while avoiding the problems…

1985

We evaluate all the real and complex zeros λ1,...,λn of an n-th degree univariate polynomial with the relative precision 1/2nc…

1966

s[i]; f := fb e n d else b e g i n gb := dot(g,s); i f gb < 0 A count > n A step <10-6 t h e n go to exit; fb := f ; i ta := ira…

1965

The algorithnl given here mechanizes .' ~ modified form of the Gracffe process designed to av()id an expanding ,mmber range. This…

1956

In a previous paper on the subject Bernoulli's method was extended to cover those cases in which there were several roots of…

1947