Iterative algorithms on heterogeneous network computing: Parallel polynomial root extracting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2552, Issue , 2002, Pages 283-291

  Couturier, Raphaël ^a   Canalda, Philippe ^a   Spies, François ^a  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; HETEROGENEOUS NETWORKS; NETWORK ARCHITECTURE;

ASYNCHRONOUS ALGORITHMS; HARD TASK; HETEROGENEOUS ARCHITECTURES; ITERATIVE ALGORITHM; PARALLEL APPLICATION; PARALLEL POLYNOMIALS;

ITERATIVE METHODS;

EID: 33646546858     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36265-7_27     Document Type: Conference Paper

References (9)

1. D.A. Bini, Numerical Computation of Polynomial Zeros by Means of Aberth’s Method, Numerical Algorithms, 13:179-200, 1996. 284
2. T.C. Chen and W. S. Luk, Alberth’s Method for the Parallel Iterative Finding of Polynomials Zeros, APL94 Conf., Sept, 1994. 284
3. M. Cosnard and P. Fraignaud, Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer, IEEE Trans. on Parallel and Distributed Systems, 5(6):639-648, Jun 94. 284, 286
4. R. Couturier and F. Spies, Extraction de racines dans des polynomes creux de degre eleve, Calculateurs paralleles, Vol. 13(1), pp. 67-81, (2001). 285
5. M. Lang and B. C. Frenzel, Polynomial Root Finding, IEEE SP Letters, 141-143, Oct, 1994.
6. L. Leger, Calcul parallele des racines dun polynome a laide de la methode de Weyl, phD Thesis, University of Rouen, Jun, 1998. 283
7. W. S. Luk, Finding Roots of Real Polynomial Simultaneously by means of Bairstow’s Method, BIT, 36(2), 1996. 283
8. W. Groppn, E. Lusk and A. Skjellum, Using MPI: portable parallel programming with the message passing interface, MIT Press, 1994.
9. K. Rhofir, F. Spies and J.C. Miellou, Perfectionnements de la methode asynchrone de Durand-Kerner pour les polynomes complexes, Calculateurs Paralleles, 10(4):449-458, 1998. 284