The Accuracy of Floating Point Summation
From MaRDI portal
Publication:3140140
DOI10.1137/0914050zbMath0788.65053OpenAlexW2053987390WikidataQ56268162 ScholiaQ56268162MaRDI QIDQ3140140
Publication date: 20 December 1993
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5c179d447a27c40a54b2bf8b1b2d6819e63c1a69
orderingnumerical experimentsfloating point numberssummation methodsrounding error analysisstatistical estimates
Related Items
Accurate and efficient simulations of Hamiltonian mechanical systems with discontinuous potentials ⋮ Combinatorial characterization of the null spaces of symmetric H-matrices ⋮ Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model ⋮ Accurate floating-point summation: a new approach ⋮ Compensated summation and dot product algorithms for floating-point vectors on parallel architectures: error bounds, implementation and application in the Krylov subspace methods ⋮ A fast and stable test to check if a weakly diagonally dominant matrix is a nonsingular M-matrix ⋮ Analysis of adaptive mesh refinement for IMEX discontinuous Galerkin solutions of the compressible Euler equations with application to atmospheric simulations ⋮ Mass conservation of the unified continuous and discontinuous element-based Galerkin methods on dynamically adaptive grids with application to atmospheric simulations ⋮ An application of the discrete-time Toda lattice to the progressive algorithm by Lanczos and related problems ⋮ Numerical verification of Littlewood's bounds for \(|L(1,\chi)|\) ⋮ The Schur aggregation and solving ill conditioned linear systems: the convergence theorem ⋮ Mixed-precision explicit stabilized Runge-Kutta methods for single- and multi-scale differential equations ⋮ Floating-point arithmetic ⋮ On the stability of Filon-Clenshaw-Curtis rules ⋮ Parallel vectorized implementations of compensated summation algorithms ⋮ A new bound for Erdős’ minimum overlap problem ⋮ Calculating elements of matrix functions using divided differences ⋮ A TensorFlow simulation framework for scientific computing of fluid flows on tensor processing units ⋮ A unified strategy to compute some special functions of number-theoretic interest ⋮ Composition constants for raising the orders of unconventional schemes for ordinary differential equations ⋮ More accuracy at fixed precision. ⋮ The stability of barycentric interpolation at the Chebyshev points of the second kind ⋮ Reducing round-off errors in rigid body dynamics ⋮ Stable application of Filon-Clenshaw-Curtis rules to singular oscillatory integrals by exponential transformations ⋮ Linear combination of independent exponential random variables ⋮ Observed asymptotic differences in energies of stable and minimal point configurations on $\mathbb {S}^2$S2 and the role of defects ⋮ Numerical implementation of complex orthogonalization, parallel transport on Stiefel bundles, and analyticity ⋮ Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees ⋮ A fast algorithm to compute the Ramanujan-Deninger gamma function and some number-theoretic applications ⋮ Estimating the number of stable configurations for the generalized Thomson problem ⋮ Backward error analysis of the extended iterative refinement or improvement algorithm for solving ill conditioned linear system ⋮ Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating ⋮ A DIVIDE-AND-CONQUER STRATEGY FOR QUALITATIVE SIMULATION AND FUZZY IDENTIFICATION OF COMPLEX DYNAMICAL SYSTEMS ⋮ Simulating Low Precision Floating-Point Arithmetic ⋮ Exact computation of the sign of a finite sum ⋮ Efficient and Accurate Parallel Inversion of the Gamma Distribution ⋮ Line segment intersection testing ⋮ Regularized functional matching pursuit for the spherical multiple-shell electro-magnetoencephalography problem ⋮ A generalized Kahan-Babuška-summation-algorithm
