Some parallel methods for polynomial root-finding

A. J. Maeder, S. A. Wynton

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

Parallelizations of various different methods for determining the roots of a polynomial are discussed. These include methods which locate a single root only as well as those which find all roots. Some techniques for parallelizing such methods are identified and some examples are given. Further places in polynomial root-finding algorithms where parallel behaviour can be introduced are described. Results are presented for a range of programs written to test the effectiveness of methods presented here.

Original languageEnglish
Pages (from-to)71-81
Number of pages11
JournalJOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume18
Issue number1
DOIs
Publication statusPublished - Apr 1987
Externally publishedYes

Keywords

  • Parallel algorithms
  • polynomial root-finding
  • zeros

Fingerprint Dive into the research topics of 'Some parallel methods for polynomial root-finding'. Together they form a unique fingerprint.

Cite this