Cart (Loading....) | Create Account
Close category search window

On the convergence of a parallel algorithm for finding polynomial zeros

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Luccio, F.L. ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada

The problem of finding the zeros of a polynomial p(z) of degree n is considered. Some results related to a parallel algorithm given by Bini and Gemignani are improved. The algorithm is a reformulation of Householder's sequential algorithm (1971) that is based on the computation of the polynomial remainder sequence generated by the Euclidean scheme. The approximation to the sought after zeros (or factors) can be carried out if at the generic j-th step of the Euclidean scheme, the modulus of a certain quantity βj, that depends on the remainder of the division, is “sufficiently small”. This condition is verified through the detection of a strong break-point for the zeros, that is, a value of j such that if z i, i=1,…,n are the zeros of p(z), then |[a(zj+1 )]/[a(zj)]|<1-1/nk for a given k and for a given function a(z). In this paper we present sufficient conditions and necessary conditions for the existence of a strong break point

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.