Systolic designs for the root-squaring method
From MaRDI portal
Graeffe methodOCCAM programparallel computingroot finding methodsroot-squaring methodsemi-systolic arraysystolic designssystolic systems
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05) Theory of operating systems (68N25)
Recommendations
- Systolic designs for Aitken's root finding method
- Systolic designs for Bernoulli's method
- A numerically reliable solution for the squaring-down problem in system design
- An integral matrix-based technique for systematic systolic design
- A systolic design for the Aitken extrapolation formula
- The Design of Optimal Systolic Arrays
- scientific article; zbMATH DE number 4074335
- scientific article; zbMATH DE number 3958722
- Systolic designs for the calculation of the eigenvalues and eigenvectors of a symmetric tridiagonal matrix
- On the design of some systolic algorithms
Cited in
(7)- A systolic design for the Aitken extrapolation formula
- Fast parallel algorithms for Graeffe's root squaring technique
- Systolic designs for Aitken's root finding method
- To the role of decomposition strategy in high parallel algorithms
- A systolic ring architecture for solving polynomial equations
- scientific article; zbMATH DE number 4112025 (Why is no real title available?)
- Systolic designs for Bernoulli's method
This page was built for publication: Systolic designs for the root-squaring method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804082)
