Pages that link to "Item:Q5132335"
From MaRDI portal
The following pages link to Algorithms for Efficient Reproducible Floating Point Summation (Q5132335):
Displaying 18 items.
- Loop invariants in floating point algorithms (Q685861) (← links)
- Optimal inverse projection of floating-point addition (Q2299211) (← links)
- Fast and accurate floating point summation with application to computational geometry (Q2387749) (← links)
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem (Q2660610) (← links)
- Efficiency of Reproducible Level 1 BLAS (Q2803590) (← links)
- Algorithm 908 (Q2989123) (← links)
- (Q3796635) (← links)
- (Q3878659) (← links)
- A Distillation Algorithm for Floating-Point Summation (Q4253089) (← links)
- A Novel Approach for the Efficient Computation of 1-D and 2-D Summations (Q4590016) (← links)
- On Floating-Point Summation (Q4870601) (← links)
- (Q4878765) (← links)
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors (Q4943883) (← links)
- Optimizing floating point operations in Scheme (Q4951520) (← links)
- Floating-point arithmetic (Q6047500) (← links)
- Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors (Q6135463) (← links)
- Finding normal binary floating-point factors efficiently (Q6156639) (← links)
- Verified error bounds for matrix decompositions (Q6641767) (← links)
