On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros

DOI10.1137/0726043MaRDI QIDQ3830423zbMATH OpenOpenAlexFDO

Authors M. S. Petković

Publication date 1989

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0726043

zbMATH Keywords

convergence rateHalley's iterative formulanumerical examplespolynomial complex multiple zerosrounding errors

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)

Recommendations

• scientific article; zbMATH DE number 4195051
• Halley-like method with corrections for the inclusion of polynomial zeros
• On the convergence of Halley's method for simultaneous computation of polynomial zeros
• The accelerated Halley-like method for the inclusion of polynomial zeros
• Some modifications of the parallel Halley iteration method and their convergence

Cited in

(30)

• The self-validated method for polynomial zeros of high efficiency
• Some modifications of the parallel Halley iteration method and their convergence
• Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
• Higher-order iterative methods for approximating zeros of analytic functions
• A class of simultaneous methods for the zeros of analytic functions
• On the convergence of Wang-Zheng's method
• Phase path tracing methods for solving the high order zeros of nonlinear systems
• A local convergence theorem for the super-Halley method in a Banach space
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• On initial conditions for the convergence of simultaneous root finding methods
• On the simultaneous refinement of the zeros of H-palindromic polynomials
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
• Derivative free inclusion methods for polynomial zeros
• A higher order family for the simultaneous inclusion of multiple zeros of polynomials
• Improved Halley-like methods for the inclusion of polynomial zeros
• scientific article; zbMATH DE number 4195051 (Why is no real title available?)
• Forward-backward serial iteration methods for simultaneously approximating polynomial zeros
• scientific article; zbMATH DE number 3881776 (Why is no real title available?)
• The fast Halley algorithm for finding all zeros of a polynomial
• A family of simultaneous zero finding methods
• scientific article; zbMATH DE number 1512150 (Why is no real title available?)
• On an efficient inclusion method for finding polynomial zeros
• Efficient methods for the inclusion of polynomial zeros
• A new higher-order family of inclusion zero-finding methods
• New higher-order methods for the simultaneous inclusion of polynomial zeros
• Schröder-like algorithms for multiple complex zeros of a polynomial
• A hybrid method for polynomial complex zero
• On the efficiency of some combined methods for polynomial complex zeros
• On the convergence condition of generalized root iterations for the inclusion of polynomial zeros

This page was built for publication: On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros

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