Accurate simple zeros of polynomials in floating point arithmetic

DOI10.1016/j.camwa.2008.02.027zbMath1155.65335OpenAlexW2112011769MaRDI QIDQ1004779

Stef Graillat

Publication date: 12 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.02.027

zbMATH Keywords

Newton's methodzeros of polynomialscondition numberfloating point arithmetic

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (7)

Accurate evaluation of a polynomial and its derivative in Bernstein form ⋮ On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Fast evaluation and root finding for polynomials with floating-point coefficients ⋮ Reducing rounding errors and achieving Brouwer's law with Taylor series method ⋮ Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Numerical validation of compensated algorithms with stochastic arithmetic

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• A floating-point technique for extending the available precision
• Newton's Method in Floating Point Arithmetic and Iterative Refinement of Generalized Eigenvalue Problems
• Adaptive Multiprecision Path Tracking
• Accuracy and Stability of Numerical Algorithms
• Lectures on Finite Precision Computations
• Accurate Sum and Dot Product

This page was built for publication: Accurate simple zeros of polynomials in floating point arithmetic