Fast parallel algorithms for Graeffe's root squaring technique

DOI10.1016/S0898-1221(97)00280-0zbMath0908.65026MaRDI QIDQ1129507

Bhabani P. Sinha, Prasanta K. Jana

Publication date: 22 March 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

zeros of polynomialsparallel algorithmsGraeffe's methodsystolic architecturestrees and multitrees

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse matrix vector multiplication techniques on the IBM 3090 VF
• The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer
• Parallel numerical methods for the solution of equations
• Principles for Testing Polynomial Zerofinding Programs
• Parallel Iteration Methods
• A highly parallel algorithm for root extraction
• Parallel Methods for Approximating the Root of a Function
• A Survey of Parallelism in Numerical Analysis
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration

This page was built for publication: Fast parallel algorithms for Graeffe's root squaring technique