Computing roots of polynomials on vector processing machines

DOI10.1016/0168-9274(85)90009-1zbMath0619.65037OpenAlexW2033213517MaRDI QIDQ1089743

Rene Alt

Publication date: 1985

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(85)90009-1

zbMATH Keywords

roots of polynomialsmultiple rootNumerical examplesvector processinground-off error analysisDurand-Kerner algorithmpermutation-perturbation method

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) Real polynomials: location of zeros (26C10)

Related Items (3)

A unified approach to method for the simultaneous computation of all zeros of generalized polynomials ⋮ Floating-point error propagation in iterative methods ⋮ Univariate polynomial factorization over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• New methods for evaluating the validity of the results of mathematical computations
• Stabilizing Bairstow's method
• Étude statistique des erreurs dans l'ARITHM<ETIQUE DES ORDINATEURS, APPLICATIONS AU CONTR<OLE DES R<ESULTTS D'algorithmes numériques
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously

This page was built for publication: Computing roots of polynomials on vector processing machines