A highly parallel algorithm for root extraction
From MaRDI portal
Publication:5375465
DOI10.1109/12.21130zbMATH Open1396.65096OpenAlexW2034011115MaRDI QIDQ5375465FDOQ5375465
Authors: Thomas A. Rice, Leah H. Jamieson
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.21130
Parallel numerical computation (65Y05) Numerical computation of solutions to single equations (65H05)
Cited In (6)
- Frequency synchronization for interleaved OFDMA uplink systems
- On Euler-like methods for the simultaneous approximation of polynomial zeros
- Fast parallel algorithms for Graeffe's root squaring technique
- A posteriori error bound methods for the inclusion of polynomial zeros
- Insert a root to extract a root of quintic quickly
- Family of simultaneous methods of Hansen--Patrick's type
This page was built for publication: A highly parallel algorithm for root extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375465)