Paper Info
Title
Polynomial root-finding: analysis and computational investigation of a parallel algorithm
Abstract
A practical version of a parallel algorithm that approximates theroots of a polynomial whose roots are all real is developed using theideas of an existing NC algorithm. An new elementary proof of correctnessis provided and the complexity of the algorithm is analyzed.A particular implementation of the algorithm that performs well inpractice is described and its run-time behaviour is compared with theanalytical predictions.1 IntroductionIn this paper we describe and analyze the behaviour ...
Year
DOI
Venue
1992
10.1145/140901.140920
SPAA
Keywords
Field
DocType
parallel algorithm,polynomial root-finding,computational investigation
Polynomial root finding,Jenkins–Traub algorithm,Parallel algorithm,Computer science,Parallel computing,Cornacchia's algorithm,Computational resource
Conference
ISBN
Citations 
PageRank 
0-89791-483-X
5
0.54
References 
Authors
10
2
Name
Order
Citations
PageRank
B. Narendran114225.89
Prasoon Tiwari259296.81