Some parallel methods for polynomial root-finding

A. J. Maeder; S. A. Wynton

doi:10.1016/0377-0427(87)90056-2

Some parallel methods for polynomial root-finding

A. J. Maeder
, S. A. Wynton

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	71-81
Number of pages	11
Journal	JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume	18
Issue number	1
DOIs	https://doi.org/10.1016/0377-0427(87)90056-2
Publication status	Published - Apr 1987
Externally published	Yes

Keywords

Parallel algorithms
polynomial root-finding
zeros

Access to Document

10.1016/0377-0427(87)90056-2Licence: In Copyright

Cite this

@article{0cbc4d4c25de4d85a32fdf6f7b2b0c3b,

title = "Some parallel methods for polynomial root-finding",

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.",

keywords = "Parallel algorithms, polynomial root-finding, zeros",

author = "Maeder, \{A. J.\} and Wynton, \{S. A.\}",

year = "1987",

month = apr,

doi = "10.1016/0377-0427(87)90056-2",

language = "English",

volume = "18",

pages = "71--81",

journal = "JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS",

issn = "0377-0427",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Some parallel methods for polynomial root-finding

AU - Maeder, A. J.

AU - Wynton, S. A.

PY - 1987/4

Y1 - 1987/4

N2 - 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.

AB - 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.

KW - Parallel algorithms

KW - polynomial root-finding

KW - zeros

UR - https://www.scopus.com/pages/publications/0022047444

U2 - 10.1016/0377-0427(87)90056-2

DO - 10.1016/0377-0427(87)90056-2

M3 - Article

AN - SCOPUS:0022047444

SN - 0377-0427

VL - 18

SP - 71

EP - 81

JO - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

JF - JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

IS - 1

ER -

Some parallel methods for polynomial root-finding

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this