Some modifications of the parallel Halley iteration method and their convergence

DOI10.1007/BF02253746MaRDI QIDQ1074309zbMATH OpenFDO

Authors Deren Wang, Yujiang Wu

Publication date 1987

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02253746

zbMATH Keywords

complex polynomialconvergence ordernumerical exampleparallel Halley iteration methodzeros

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)

Review text

We derive five kinds of algorithms for simultaneously finding the zeros of a complex polynomial. The convergence and the convergence rate with higher order are obtained. The algorithms are numerically illustrated by an example of degree 10, and the numerical results are satisfactory.

Recommendations

• scientific article; zbMATH DE number 2143834
• scientific article; zbMATH DE number 4048919
• scientific article; zbMATH DE number 1780011
• scientific article; zbMATH DE number 4195051
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros

Cites work

• Circular arithmetic and the determination of polynomial zeros
• scientific article; zbMATH DE number 3976212 (Why is no real title available?)
• On the convergence order of a modified method for simultaneous finding polynomial zeros
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

Cited in

(21)

• The Durand-Kerner method for trigonometric and exponential polynomials
• Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
• The globalization of Durand-Kerner algorithm
• The convergence of a class of parallel Newton-type iterative methods
• On an efficient simultaneous method for finding polynomial zeros
• A family of root-finding methods with accelerated convergence
• An efficient higher order family of root finders
• Improved Halley-like methods for the inclusion of polynomial zeros
• scientific article; zbMATH DE number 4195051 (Why is no real title available?)
• scientific article; zbMATH DE number 3860295 (Why is no real title available?)
• scientific article; zbMATH DE number 3876482 (Why is no real title available?)
• The fast and parallel Halley algorithm for finding all zeros of a polynomial
• scientific article; zbMATH DE number 3942922 (Why is no real title available?)
• scientific article; zbMATH DE number 4048919 (Why is no real title available?)
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• scientific article; zbMATH DE number 1780011 (Why is no real title available?)
• scientific article; zbMATH DE number 2143834 (Why is no real title available?)
• The improved Farmer--Loizou method for finding polynomial zeros
• On some improvements of square root iteration for polynomial complex zeros
• A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
• Families of high-order simultaneous methods with several corrections

This page was built for publication: Some modifications of the parallel Halley iteration method and their convergence

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