Higher-order iteration functions for simultaneously approximating polynomial zeros

DOI10.1080/00207168308803375zbMath0529.65023OpenAlexW2136141372MaRDI QIDQ3311583

No author found.

Publication date: 1983

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168308803375

zbMATH Keywords

numerical exampleR-order convergencehigher order iteration methodssimultaneous approximation of the zeros of a polynomial

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials, On the guaranteed convergence of new two-point root-finding methods for polynomial zeros, On some iteration functions for the simultaneous computation of multiple complex polynomial zeros, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
• Multiple solutions of nonlinear equations: Roots of polynomials
• Lower bounds for the Perron root of a non-negative irreducible matrix
• Über Simultanverfahren zur Bestimmung reeller Polynomwurzeln
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• An algorithm for the total, or partial, factorization of a polynomial
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots