On a global descent method for polynomials
From MaRDI portal
Publication:802279
DOI10.1007/BF01389468zbMath0553.65028MaRDI QIDQ802279
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132965
numerical experiments; zeros of polynomials; Newton method; descent algorithm; root-finding algorithm; complex polynomial; Cauchy radius
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
Related Items
On the paths of steepest descent for the norm of a one variable complex polynomial, Vergleich von Abstiegsverfahren zur Nullstellenbestimmung bei Polynomen. (Comparison of descent methods for the calculation of zeros of polynomials), On the minimum moduli of normalized polynomials with two prescribed values
Cites Work