A Class of Fast and Accurate Summation Algorithms
From MaRDI portal
Recommendations
Cites work
- A New Approach to Probabilistic Rounding Error Analysis
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accuracy and Stability of Numerical Algorithms
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Error estimation of floating-point summation and dot product
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 6315331 (Why is no real title available?)
- Improved error bounds for inner products in floating-point arithmetic
- Parallel Reproducible Summation
- PLASMA: Parallel linear algebra software for multicore using OpenMP
- Quasi double-precision in floating point addition
- Reducing floating point error in dot product using the superblock family of algorithms
- Sharp estimates for perturbation errors in summations
- Sharper probabilistic backward error analysis for basic linear algebra kernels with random data
- Simulating Low Precision Floating-Point Arithmetic
Cited in
(26)- An implementation of Karr's summation algorithm in Mathematica
- 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
- On the complexity of the Plantinga-Vegter algorithm
- A fast summation method for oscillatory lattice sums
- Mixed precision block fused multiply-add: error analysis and application to GPU tensor cores
- scientific article; zbMATH DE number 4062474 (Why is no real title available?)
- A Novel Approach for the Efficient Computation of 1-D and 2-D Summations
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
- Sharper probabilistic backward error analysis for basic linear algebra kernels with random data
- Algorithms for efficient reproducible floating point summation
- Efficient Summing over Sliding Windows
- Stochastic rounding and its probabilistic backward error analysis
- Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores
- Mixed precision algorithms in numerical linear algebra
- Floating-point arithmetic
- Convergence Analysis of a Mixed Precision Parareal Algorithm
- Precision-aware deterministic and probabilistic error bounds for floating point summation
- Numerical stability of algorithms at extreme scale and low precisions
- Effects of lower floating-point precision on scale-resolving numerical simulations of turbulence
- Summing divergent matrix series
- A Poisson-bracket scheme for nonlinear shallow-water sloshing in an oscillating tank with irregular bottom surface
- Truncated QR factorization with pivoting in mixed precision
- A Second-Moment Theory for Floating-Point Reduction Trees
- A fourth-order C-bracket scheme for nonlinear shallow-water sloshing in an oscillating tank with non-periodic inflow-outflow boundary conditions and biharmonic dissipation
- A note on Dekker's FastTwoSum algorithm
This page was built for publication: A Class of Fast and Accurate Summation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112565)
