Ultimately Fast Accurate Summation
From MaRDI portal
Publication:3162114
DOI10.1137/080738490zbMath1202.65033OpenAlexW2041844083MaRDI QIDQ3162114
Publication date: 19 October 2010
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080738490
Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items (13)
Fast enclosure for solutions of Sylvester equations ⋮ On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Analytic integration of the Newton potential over cuboids and an application to fast multipole methods ⋮ Floating-point arithmetic ⋮ Error‐free transformation of matrix multiplication with a posteriori validation ⋮ The stability of barycentric interpolation at the Chebyshev points of the second kind ⋮ Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications ⋮ Accurate, validated and fast evaluation of elementary symmetric functions and its application ⋮ Efficiency of Reproducible Level 1 BLAS ⋮ Efficient Calculations of Faithfully Rounded l 2 -Norms of n -Vectors ⋮ Error estimation of floating-point summation and dot product ⋮ A note on Dekker's FastTwoSum algorithm ⋮ Improvement of error-free splitting for accurate matrix multiplication
Uses Software
This page was built for publication: Ultimately Fast Accurate Summation
