Fast parallel algorithms for Graeffe's root squaring technique

DOI10.1016/S0898-1221(97)00280-0zbMATH Open0908.65026MaRDI QIDQ1129507FDOQ1129507

Bhabani P. Sinha, Prasanta K. Jana

Publication date: 22 March 1999

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

Recommendations

• scientific article; zbMATH DE number 880381
• A parallel algorithm for simple roots of polynomials
• Systolic designs for the root-squaring method
• On the parallel arithmetic complexity of the root-finding problem
• Parallel algorithms for some algebraic operations on polynomial equations

zbMATH Keywords

parallel algorithmssystolic architectureszeros of polynomialsGraeffe's methodtrees and multitrees

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

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

Cited In (1)

• On the geometry of Graeffe iteration

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

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