Stabilizing Bairstow's method

DOI10.1016/0898-1221(82)90031-1zbMath0502.65031OpenAlexW1996478441MaRDI QIDQ1172922

S. Singh

Publication date: 1982

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(82)90031-1

zbMATH Keywords

numerical examplesroot of a polynomialBairstow's methodoptimal termination criterionRaphson-Newton iterationssuccessive polynomial divisions

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)

Related Items

Stochastic approach of the permutation-perturbation method for round-off error analysis, Computing roots of polynomials on vector processing machines, Floating-point error propagation in iterative methods, Verified error bounds for multiple roots of systems of nonlinear equations

Cites Work

• New methods for evaluating the validity of the results of mathematical computations
• Étude statistique des erreurs dans l'ARITHM<ETIQUE DES ORDINATEURS, APPLICATIONS AU CONTR<OLE DES R<ESULTTS D'algorithmes numériques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item