A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros
From MaRDI portal
Publication:5659036
DOI10.1145/355606.361872zbMath0246.65019OpenAlexW2060809342MaRDI QIDQ5659036
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
Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)
Related Items (2)
Some parallel methods for polynomial root-finding ⋮ A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
This page was built for publication: A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros
