Ultimately fast accurate summation
From MaRDI portal
Recommendations
Cited in
(38)- A new error-free floating-point summation algorithm
- Parallel algorithms for rounding exact evaluation of sums of products
- Reducing floating point error in dot product using the superblock family of algorithms
- A fast dot-product algorithm with minimal rounding errors
- A fast parallel high-precision summation algorithm based on AccSumK
- Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods
- Improvement of error-free splitting for accurate matrix multiplication
- Some issues related to double rounding
- Numerical validation of compensated summation algorithms with stochastic arithmetic
- 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
- Efficiency of reproducible level 1 BLAS
- Efficient calculations of faithfully rounded l₂-norms of n-vectors
- Error‐free transformation of matrix multiplication with a posteriori validation
- scientific article; zbMATH DE number 3850378 (Why is no real title available?)
- scientific article; zbMATH DE number 3860391 (Why is no real title available?)
- Accurate floating-point summation. II: Sign, K-fold faithful and rounding to nearest
- Correct rounding and a hybrid approach to exact floating-point summation
- Extensions of Priest’s Double‐Precision Summation
- scientific article; zbMATH DE number 4062474 (Why is no real title available?)
- Fast enclosure for solutions of Sylvester equations
- On the robustness of the 2Sum and Fast2Sum algorithms
- The stability of barycentric interpolation at the Chebyshev points of the second kind
- A Class of Fast and Accurate Summation Algorithms
- Algorithms for efficient reproducible floating point summation
- Efficient Summing over Sliding Windows
- Accurate Sum and Dot Product
- Floating-point arithmetic
- Fast and accurate computation of the Euclidean norm of a vector
- Parallel vectorized implementations of compensated summation algorithms
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Condense and distill: fast distillation of large floating-point sums via condensation
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- How to grade the accuracy of the BLAS
- Error estimation of floating-point summation and dot product
- A note on Dekker's FastTwoSum algorithm
This page was built for publication: Ultimately fast accurate summation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3162114)
