On a global descent method for polynomials

DOI10.1007/BF01389468zbMATH Open0553.65028MaRDI QIDQ802279FDOQ802279

Authors: Stephan Ruscheweyh 

Publication date: 1984

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

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

Recommendations

• Vergleich von Abstiegsverfahren zur Nullstellenbestimmung bei Polynomen. (Comparison of descent methods for the calculation of zeros of polynomials)
• scientific article; zbMATH DE number 1124569
• How to find all roots of complex polynomials by Newton's method.
• On the complex dynamics of continued and discrete Cauchy's method
• scientific article; zbMATH DE number 3923973

zbMATH Keywords

numerical experimentsNewton methodzeros of polynomialsdescent 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)

Cites Work

• Title not available (Why is that?)
• Die numerische Berechnung der Wurzeln eines Polynoms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (3)

• 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

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

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