Calculating polynomial zeros on a local memory parallel computer
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)
Investigation of three different algorithms (convergence order two, three and four) for the calculation of all zeros of a polynomial (degree 3 to 36) on a linear chain of up to eight transputers. Speedups for different strategies are presented.
- On Euler-like methods for the simultaneous approximation of polynomial zeros
- Local minima of the trust region problem
- Sorting-based calculation of zeroes and extrema of functions as applied to search and recognition. I
- Family of simultaneous methods of Hansen--Patrick's type
- A parallel complex zero finder
- Finding roots of a real polynomial simultaneously by means of Bairstow's method
- Tchebychef-like method for the simultaneous finding zeros of analytic functions
- A posteriori error bound methods for the inclusion of polynomial zeros
- Sorting-based localization and stable computation of zeros of a polynomial. II.
- Sorting-based localization and stable computation of zeros of a polynomial. I.
- Computational efficiency of some combined methods for polynomial equations
- scientific article; zbMATH DE number 57956 (Why is no real title available?)
- Börsch-supan-like methods: point estimation and parallel implementation
- Finding the roots of a polynomial on an MIMD multicomputer
- On the convergence of the sequences of Gerschgorin-like disks
This page was built for publication: Calculating polynomial zeros on a local memory parallel computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582813)
