Newton Iteration Towards a Cluster of Polynomial Zeros

DOI10.1007/978-3-642-60539-0_15MaRDI QIDQ4336101zbMATH OpenOpenAlexFDO

Authors Peter Kirrinnis

Publication date 12 June 1997

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-60539-0_15

zbMATH Keywords

numerical examplesalgorithmNewton's methodpolynomial zeroshomotopy methodscluster of polynomial zeros

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 1859224
• Detection and validation of clusters of polynomial zeros

Cited in

(9)

• Zero-clusters of polynomials: best approach in supercomputing era
• A divide and conquer method for polynomial zeros
• On the geometry of Graeffe iteration
• On factorization of analytic functions and its verification
• An Existence Test for Root Clusters and Multiple Roots
• scientific article; zbMATH DE number 1859224 (Why is no real title available?)
• Newton's Method and the Jenkins-Traub Algorithm
• Newton-type iterative methods for finding zeros having higher multiplicity
• Finding a cluster of zeros of univariate polynomials

This page was built for publication: Newton Iteration Towards a Cluster of Polynomial Zeros

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