Systolic designs for the root-squaring method

DOI10.1080/00207168708803580zbMath0656.65048OpenAlexW2024526958WikidataQ126255489 ScholiaQ126255489MaRDI QIDQ3804082

Konstantinos G. Margaritis, David J. Evans

Publication date: 1987

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168708803580

zbMATH Keywords

parallel computingroot finding methodssystolic designsroot-squaring methodsystolic systemsGraeffe methodOCCAM programsemi-systolic array

Mathematics Subject Classification ID

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) Real polynomials: location of zeros (26C10) Theory of operating systems (68N25)

Related Items (2)

A systolic ring architecture for solving polynomial equations ⋮ To the role of decomposition strategy in high parallel algorithms

Cites Work

• Unnamed Item

This page was built for publication: Systolic designs for the root-squaring method