Pages that link to "Item:Q5112565"
From MaRDI portal
The following pages link to A Class of Fast and Accurate Summation Algorithms (Q5112565):
Displaying 17 items.
- An implementation of Karr's summation algorithm in Mathematica (Q1972215) (← links)
- Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods (Q2151619) (← links)
- On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
- A fast summation method for oscillatory lattice sums (Q2968457) (← links)
- Mixed Precision Block Fused Multiply-Add: Error Analysis and Application to GPU Tensor Cores (Q3300847) (← links)
- (Q3796635) (← links)
- A Novel Approach for the Efficient Computation of 1-D and 2-D Summations (Q4590016) (← links)
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors (Q4943883) (← links)
- Sharper Probabilistic Backward Error Analysis for Basic Linear Algebra Kernels with Random Data (Q5132023) (← links)
- Efficient Summing over Sliding Windows (Q5369513) (← links)
- Stochastic Rounding and Its Probabilistic Backward Error Analysis (Q5857625) (← links)
- Matrix Multiplication in Multiword Arithmetic: Error Analysis and Application to GPU Tensor Cores (Q5886842) (← links)
- Mixed precision algorithms in numerical linear algebra (Q5887837) (← links)
- Floating-point arithmetic (Q6047500) (← links)
- Convergence Analysis of a Mixed Precision Parareal Algorithm (Q6054293) (← links)
- Precision-aware deterministic and probabilistic error bounds for floating point summation (Q6093390) (← links)
- Numerical stability of algorithms at extreme scale and low precisions (Q6200205) (← links)
