Fast parallel algorithms for Graeffe's root squaring technique
From MaRDI portal
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 3439855 (Why is no real title available?)
- scientific article; zbMATH DE number 3240705 (Why is no real title available?)
- A Survey of Parallelism in Numerical Analysis
- A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
- A highly parallel algorithm for root extraction
- Parallel Methods for Approximating the Root of a Function
- Parallel iteration methods
- Parallel numerical methods for the solution of equations
- Principles for Testing Polynomial Zerofinding Programs
- Sparse matrix vector multiplication techniques on the IBM 3090 VF
- The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer
Cited in
(2)
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)