Accurate Horner methods in real and complex floating-point arithmetic

DOI10.1007/S10543-024-01017-WMaRDI QIDQ6492246

Stef Graillat, Thomas R. Cameron

Publication date: 24 April 2024

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
• Inversion of extremely ill-conditioned matrices in floating-point
• A floating-point technique for extending the available precision
• On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
• MPFR
• Accuracy and Stability of Numerical Algorithms
• Quasi double-precision in floating point addition
• Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit
• Accurate Sum and Dot Product

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