A Family of High-Order Parallel Rootfinders for Polynomials

A Family of High-Order Parallel Rootfinders for Polynomials

Year:    2000

Author:    Shi-Ming Zheng

Journal of Computational Mathematics, Vol. 18 (2000), Iss. 3 : pp. 283–288

Abstract

In this paper we present a family of parallel iterations of order $m+2$ with parameter $m=0,1,...$ for simultaneous finding all zeros of a polynomial without evaluation of derivatives, which includes the well known Weierstrass-Durand-Dochev-Kerner and Börsch-Supan-Nourein iterations as the special cases for $m$=0 and $m$=1, respectively. Some numerical examples are given.  

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2000-JCM-9042

Journal of Computational Mathematics, Vol. 18 (2000), Iss. 3 : pp. 283–288

Published online:    2000-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    6

Keywords:    Parallel iteration zeros of polynomial order of convergence.

Author Details

Shi-Ming Zheng