Börsch-supan-like methods: point estimation and parallel implementation

In this paper we consider Borsch-Supan's method and its modification with Weierstrass' correction. These methods are suitable for the simultaneous approximation of all simple zeros of polynomials and have the convergence order three and four, respectively. In the first part we give an initial condition for the safe convergence of the method with correction. This condition depends only on attainable data and has a practical importance. In the second part the comparison of the considered two methods on MIMD parallel computers (synchronous and asynchronous implementation) are studied.

[1]  Christian Bischof,et al.  1st European Workshop on Hypercube and Distributed Computers , 1990 .

[2]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[3]  T. L. Freeman,et al.  Asynchronous polynomial zero-finding algorithms , 1991, Parallel Comput..

[4]  Miodrag S. Petković.  On an iterative method for simultaneous inclusion of polynomial complex zeros , 1982 .

[5]  Wolfgang Börsch-supan,et al.  Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation , 1970 .

[6]  Pierre Fraigniaud,et al.  Finding the roots of a polynomial on an MIMD multicomputer , 1990, Parallel Comput..

[7]  Carsten Carstensen,et al.  On iteration methods without derivatives for the simultaneous determination of polynomial zeros , 1993 .

[8]  A. W. Nourein.  An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (An algorithm) , 1977 .

[9]  Miodrag S. Petković,et al.  Iterative Methods for Simultaneous Inclusion of Polynomial Zeros , 1989 .

[10]  Gérard M. Baudet,et al.  Asynchronous Iterative Methods for Multiprocessors , 1978, JACM.

[11]  W. Börsch-Supan.  A posteriori error bounds for the zeros of polynomials , 1963 .

[12]  Dietrich Braess,et al.  Simultaneous inclusion of the zeros of a polynomial , 1973 .

[13]  A. W. Nourein,et al.  An iteration formula for the simultaneous determination of the zeros of a polynomial , 1975 .

[14]  Carsten Carstensen,et al.  Anwendungen von Begleitmatrizen , 1991 .

[15]  Pierre Fraigniaud,et al.  Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer , 1994, IEEE Trans. Parallel Distributed Syst..

[16]  T. L. Freeman,et al.  Calculating polynomial zeros on a local memory parallel computer , 1989, Parallel Comput..