Accurate Floating-Point Summation Part I: Faithful Rounding
From MaRDI portal
Publication:5189669
Recommendations
- Accurate floating-point summation: a new approach
- Accurate floating-point summation. II: Sign, K-fold faithful and rounding to nearest
- Correct rounding and a hybrid approach to exact floating-point summation
- Correctly Rounded Arbitrary-Precision Floating-Point Summation
- Accurate and Efficient Floating Point Summation
- The Accuracy of Floating Point Summation
- Faithfully rounded floating-point computations
- scientific article; zbMATH DE number 878996
- A new error-free floating-point summation algorithm
- On Floating-Point Summation
Cited in
(80)- A new error-free floating-point summation algorithm
- Iterative refinement for symmetric eigenvalue decomposition
- Formal verification of a floating-point expansion renormalization algorithm
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- The true order of magnitude of Lamé rounding error sums
- A fast parallel high-precision summation algorithm based on AccSumK
- Generation of test matrices with specified eigenvalues using floating-point arithmetic
- Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods
- Convergence analysis of an algorithm for accurate inverse Cholesky factorization
- The relative accuracy of \(\mathtt{(x+y)*(x-y)}\)
- Verified bounds for the determinant of real or complex point or interval matrices
- Improvement of error-free splitting for accurate matrix multiplication
- Verified compilation of floating-point computations
- Schur aggregation for linear systems and determinants
- Accurate floating-point summation: a new approach
- Computing predecessor and successor in rounding to nearest
- Some issues related to double rounding
- Numerical validation of compensated summation algorithms with stochastic arithmetic
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- Efficiency of reproducible level 1 BLAS
- CAMPARY: CUDA multiple precision arithmetic library and applications
- Efficient calculations of faithfully rounded l₂-norms of n-vectors
- Improved error bounds for floating-point products and Horner's scheme
- Error‐free transformation of matrix multiplication with a posteriori validation
- Convergence analysis of accurate inverse Cholesky factorization
- The Accuracy of Floating Point Summation
- Ultimately fast accurate summation
- Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
- Sharp error bounds for complex floating-point inversion
- 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
- TELEMAC: an efficient hydrodynamics suite for massively parallel architectures
- The Schur aggregation and solving ill conditioned linear systems: the convergence theorem
- Fast enclosure for solutions of Sylvester equations
- Accurate and Efficient Floating Point Summation
- Fast interval matrix multiplication
- On relative errors of floating-point operations: optimal bounds and applications
- On Floating-Point Summation
- scientific article; zbMATH DE number 878996 (Why is no real title available?)
- Enclosing Chebyshev expansions in linear time
- Selected implementation issues in computation of the Grünwald-Letnikov fractional-order difference by means of embedded system
- Faithfully rounded floating-point computations
- Computing enclosures for the matrix exponential
- Lagrangian flux calculation through a fixed planar curve for scalar conservation laws
- A radix-independent error analysis of the Cornea-Harrison-Tang method
- On the Computation of Correctly Rounded Sums
- Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
- Accurate evaluation of a polynomial in Chebyshev form
- Accurate Sum and Dot Product
- Approximate calculation of sums. II: Gaussian type quadrature
- Primitive Floats in Coq
- Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-p base
- Floating-point arithmetic
- Fast and accurate computation of the Euclidean norm of a vector
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Parallel vectorized implementations of compensated summation algorithms
- Finding normal binary floating-point factors efficiently
- On computing high-dimensional Riemann theta functions
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Verified error bounds for matrix decompositions
- 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
- Emulation of the FMA and the correctly-rounded sum of three numbers in rounding-to-nearest floating-point arithmetic
- Condense and distill: fast distillation of large floating-point sums via condensation
- A robust algorithm for geometric predicate by error-free determinant transformation
- 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
- Fast verified solutions of linear systems
- Algorithms for accurate, validated and fast polynomial evaluation
- Adaptive and efficient algorithm for 2D orientation problem
- Inversion of extremely ill-conditioned matrices in floating-point
- Iterative refinement for ill-conditioned linear systems
- A method of obtaining verified solutions for linear systems suited for Java
- Randomized preprocessing of homogeneous linear systems of equations
This page was built for publication: Accurate Floating-Point Summation Part I: Faithful Rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189669)
