On a global descent method for polynomials

DOI10.1007/BF01389468zbMath0553.65028MaRDI QIDQ802279

Stephan Ruscheweyh

Publication date: 1984

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132965

zbMATH Keywords

numerical experimentszeros of polynomialsNewton methoddescent algorithmroot-finding algorithmcomplex polynomialCauchy radius

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items (3)

On the minimum moduli of normalized polynomials with two prescribed values ⋮ Vergleich von Abstiegsverfahren zur Nullstellenbestimmung bei Polynomen. (Comparison of descent methods for the calculation of zeros of polynomials) ⋮ On the paths of steepest descent for the norm of a one variable complex polynomial

Cites Work

• Die numerische Berechnung der Wurzeln eines Polynoms
• Ein konvergentes Iterationsverfahren zur Bestimmung der Nullstellen eines Polynoms
• On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a global descent method for polynomials