A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros

DOI10.1145/355606.361872MaRDI QIDQ5659036zbMATH OpenOpenAlexFDO

Authors Merrell L. Patrick

Publication date 1972

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355606.361872

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)

Cited in

(2)

• A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
• Some parallel methods for polynomial root-finding

This page was built for publication: A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros

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