scientific article; zbMATH DE number 880381

MaRDI QIDQ4877913zbMATH OpenFDO

Authors Éric Fleury, Pierre Fraigniaud

Publication date 26 August 1996

zbMATH Keywords

algorithmparallel implementationspolynomial root finding algorithmsroots of a polynomialWeierstrass operator

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05)

Recommendations

• Finding the roots of a polynomial on an MIMD multicomputer
• Specified precision polynomial root isolation is in NC
• A parallel algorithm for simple roots of polynomials
• A parallel algorithm for finding roots of a complex polynomial
• Fast parallel algorithms for Graeffe's root squaring technique

Cited in

(12)

• On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
• Fast parallel algorithms for Graeffe's root squaring technique
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• A parallel root-finding algorithm
• Two Strategies for Root Finding on Multiprocessor Systems
• scientific article; zbMATH DE number 4064369 (Why is no real title available?)
• Efficient parallel rooting of complex polynomials on the unit circle
• scientific article; zbMATH DE number 1206074 (Why is no real title available?)
• scientific article; zbMATH DE number 1955836 (Why is no real title available?)
• A parallel algorithm for simple roots of polynomials
• A parallel algorithm for finding roots of a complex polynomial
• Finding the roots of a polynomial on an MIMD multicomputer

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4877913)