Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic

DOI10.1016/j.ic.2011.09.003zbMath1259.65073OpenAlexW2009267763MaRDI QIDQ714626

Stef Graillat, Valérie Ménissier-Morain

Publication date: 11 October 2012

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.09.003

zbMATH Keywords

algorithmnumerical experimentsHorner's schemehigh precisionaccurate dot productaccurate polynomial evaluationaccurate summationcomplex floating point arithmeticerror-free transformations

Mathematics Subject Classification ID

Roundoff error (65G50) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Related Items (4)

On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Floating-point arithmetic ⋮ Accurate, validated and fast evaluation of elementary symmetric functions and its application ⋮ Evaluation schemes in the ring of quaternionic polynomials

Uses Software

• MPFR
• mctoolbox
• XBLAS

Cites Work

• Verification of positive definiteness
• A floating-point technique for extending the available precision
• Error bounds on complex floating-point multiplication
• MPFR
• Accurate and Efficient Floating Point Summation
• Accuracy and Stability of Numerical Algorithms
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit
• Design, implementation and testing of extended and mixed precision BLAS
• Accurate Sum and Dot Product
• Unnamed Item
• Unnamed Item

This page was built for publication: Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic