Accurate Horner methods in real and complex floating-point arithmetic

DOI10.1007/S10543-024-01017-WMaRDI QIDQ6492246zbMATH OpenFDO

Authors Thomas R. Cameron, Stef Graillat

Publication date 24 April 2024

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10543-024-01017-W

Mathematics Subject Classification ID

Error analysis and interval analysis (65G99) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
• Algorithms for accurate, validated and fast polynomial evaluation
• A simple test qualifying the accuracy of Horner's rule for polynomials
• Accurate simple zeros of polynomials in floating point arithmetic
• An accurate algorithm for evaluating rational functions

Cites work

• A floating-point technique for extending the available precision
• Accuracy and Stability of Numerical Algorithms
• Accurate Sum and Dot Product
• Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 3064499 (Why is no real title available?)
• Inversion of extremely ill-conditioned matrices in floating-point
• MPFR
• On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
• Quasi double-precision in floating point addition
• Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit

This page was built for publication: Accurate Horner methods in real and complex floating-point arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492246)