Computing roots of polynomials on vector processing machines
1985; Elsevier BV; Volume: 1; Issue: 4 Linguagem: Inglês
10.1016/0168-9274(85)90009-1
ISSN1873-5460
Autores Tópico(s)Advanced Optimization Algorithms Research
ResumoThe Durand and Kerner algorithm for the computation of roots of polynomials has not been og reat use up to now. The reason is the existence of more efficient methods for computers ofthe SISD type (sequential). Actually vector processing machines such as CRAY-1 or CDC CYBER 205 must bring Durand's algorithm back to honour because of its possibility of extensive vectorization. However, as the method has its maximum efficiency for a polynomial with no multiple root a criterion using Vignes' permutation-perturbation method is given to know whether the roots are all distinct or not. The optimum criterion for stopping the iterations is shown to be vectorizable and some useful properties of the method are given. Numerical examples are considered.
Referência(s)