Calculating polynomial zeros on a local memory parallel computer

DOI10.1016/0167-8191(89)90093-8zbMath0691.65028OpenAlexW2089366698MaRDI QIDQ582813

T. L. Freeman

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90093-8

zbMATH Keywords

algorithmsparallel computationzeros of a polynomialconvergence ordertransputers

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)

Related Items (9)

Family of simultaneous methods of Hansen--Patrick's type ⋮ A posteriori error bound methods for the inclusion of polynomial zeros ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ Finding roots of a real polynomial simultaneously by means of Bairstow's method ⋮ Tchebychef-like method for the simultaneous finding zeros of analytic functions ⋮ On Euler-like methods for the simultaneous approximation of polynomial zeros ⋮ Börsch-supan-like methods: point estimation and parallel implementation ⋮ Computational efficiency of some combined methods for polynomial equations ⋮ Local minima of the trust region problem

This page was built for publication: Calculating polynomial zeros on a local memory parallel computer