Quasi double-precision in floating point addition
From MaRDI portal
Publication:5339762
DOI10.1007/BF01975722zbMath0131.15805MaRDI QIDQ5339762
Publication date: 1965
Published in: BIT (Search for Journal in Brave)
Related Items (21)
The accurate solution of certain continuous problems using only single precision arithmetic ⋮ Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic” ⋮ On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Implementation of a low round-off summation method ⋮ Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\) ⋮ Floating-point arithmetic ⋮ Error bounds on complex floating-point multiplication with an FMA ⋮ Fast and accurate computation of the Euclidean norm of a vector ⋮ Fast computation of error bounds for all eigenpairs of a Hermitian and all singular pairs of a rectangular matrix with emphasis on eigen- and singular value clusters ⋮ Parallel vectorized implementations of compensated summation algorithms ⋮ A Class of Fast and Accurate Summation Algorithms ⋮ Some issues related to double rounding ⋮ Propagation of initial rounding error in Romberg-like quadrature ⋮ Reducing round-off errors in rigid body dynamics ⋮ Primitive Floats in Coq ⋮ Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations ⋮ Irregularities in the Distribution of Primes and Twin Primes ⋮ Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating ⋮ An implementation of singly-implicit Runge-Kutta methods ⋮ A floating-point technique for extending the available precision ⋮ Analysis of some known methods of improving the accuracy of floating-point sums
Cites Work
This page was built for publication: Quasi double-precision in floating point addition
