Newton's Method and the Jenkins-Traub Algorithm

DOI10.2307/2045928MaRDI QIDQ3751819zbMATH OpenOpenAlexFDO

Authors R. N. Pederson

Publication date 1986

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2045928

zbMATH Keywords

maximum principleNewton's method

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to functions of a complex variable (30-04) Polynomials and rational functions of one complex variable (30C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

Recommendations

• Newton Iteration Towards a Cluster of Polynomial Zeros
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• On the improved Newton-like methods for the inclusion of polynomial zeros
• scientific article; zbMATH DE number 4078649
• A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm

Cited in

(2)

• A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm
• Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials

This page was built for publication: Newton's Method and the Jenkins-Traub Algorithm

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